Imagine a scenario where confidential information that was encrypted and sent years ago is suddenly able to be decrypted. The security systems worked as intended, the information was exchanged, the encryption algorithms were considered secure and there was no evidence of a breach. However, advances in computing have made that formerly secure information vulnerable. This is a concern that is driving the discussion about quantum resistant security.
We use encryption to secure almost every aspect of our digital lives. From banking transactions and healthcare data to industrial communications and defence systems, the encryption algorithms we use to secure sensitive information have been trusted for decades. However, the rise of quantum computing is challenging our assumptions about how long certain types of security will remain effective.
While quantum computers that can crack popular public-key cryptography aren't currently available, the possibility of this is an important consideration for organisations that need to ensure long term security of data.
Cybersecurity as we know it today relies on different types of cryptography for different purposes. We use Advanced Encryption Standard (AES) algorithms to secure data. We use public-key cryptography like RSA and elliptic curve cryptography (ECC) for securing key establishment, authentication and digital signatures.
Quantum computing presents different challenges to these cryptographic systems. With Shor's algorithm, a sufficiently powerful quantum computer could potentially solve the mathematical problems behind RSA and ECC, thus compromising systems that rely on these cryptographic systems.
With Grover's algorithm, we have the theoretical speed up for searching for keys in symmetric encryption.
Source link







