Following on from a number of post apocalyptic articles I'd read as to how quantum computers would spell the end of security on the web, I wrote back in March about how there are many candidates for public key encryption systems that appear to be resistant to quantum attacks, specifically Shor's algorithm. One of the candidates I listed was from McEliece.
The original paper in 1978 was only two pages long:
Showing posts with label post quantum encryption. Show all posts
Showing posts with label post quantum encryption. Show all posts
Monday, 9 May 2016
Saturday, 5 March 2016
Quantum Computers Will Not Be The End Of Public Key Encryption
The fact that quantum computers may one day easily crack modern public key encryption does not mean that encryption, or even public key encryption is doomed. There are a range of alternatives which are "quantum resistant". A report from the US National Institute of Standards and Technology (NIST) contained a table that prime facie does not bode well for the encryption in use today, and spells the end for public key encryption:
However, we already have several candidates at our disposal which look to be quantum resistant. In public key encryption there are a number of complex problems which appear to be possible replacements for the one way functions at the heart of the likes of RSA and ECDSA.
However, we already have several candidates at our disposal which look to be quantum resistant. In public key encryption there are a number of complex problems which appear to be possible replacements for the one way functions at the heart of the likes of RSA and ECDSA.
Subscribe to:
Posts (Atom)