Got Post-Quantum Encryption?

Got Post-Quantum Encryption?

As companies like Google, IBM, Intel, Microsoft and several startups are touting new records in the number of qubits realized for quantum computing, the PKI nightmare of breaking asymmetric encryption in seconds, rather than eons, draws closer. 

The race for new encryption algorithms has been on for a while to counter this with post-quantum or quantum-safe encryption. PKI is typically based on the factorization of large integers which are the product of two prime numbers. Shor's algorithm is based on quantum computing and massively reduces the time required to find these two primes, something which is incredibly hard to do for current computers, given the numbers are large enough. This means that new mathematical approaches are urgently needed. The NIST for example has setup a project for this as have many other organisations. It's not going to be easy but it is absolutely crucial to resolve this before quantum computers are available that can standardize breaking the encryption on which most secured exchanges of data are based today. We would for example need to fall back on symmetric encryption with all its drawbacks - even though there is also an attack vector for that called Grover's algorithm which is based on quantum algorithms as well. However, the efficiency / speedup of that algorithm is fortunately by far not as substantial as for Shor's algorithm for asymmetric keysets.

We also need keep in mind that quantum computing also threatens the encryption in blockchains as it stands today

and thus another mega-trend in digital transformation is affected by this breakthrough technology - which in itself of course holds an incredible promise to solve computing challenges beyond today's imagination. 

See also 


Picture by Pixabay under CC0 Creative Commons

To view or add a comment, sign in

More articles by Matthias Laux

Others also viewed

Explore content categories