SlideShare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
SlideShare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Successfully reported this slideshow.
Activate your 30 day free trial to unlock unlimited reading.
Gave rise to a lot of speculations [1]: * Can the NSA break ECC? * Are the NIST curves weak? * Does the NSA know something the outside world doesn’t about quantum computers? * Can the NSA break (certain) QRAs? * Does the NSA want distract from Snowden?
[1] A Riddle Wrapped in an Enigma, Neal Koblitz and Alfred J. Menezez https://www.math.uwaterloo.ca/~ajmeneze/publications/pqc.pdf
The authors in [1] argue that the announcement was probably motivated mainly by political considerations (distracting from Snowden reveals).
Bennett and Brassard in 1984
vulnerable to PNS attacks
* PQC: post quantum cryptography * QRA: quantum resistant algorithm * QSA: quantum save algorithms are synonymous for algorithms that are based on mathematical problems that () cannot be solved by a quantum computer in polynomial time