NIST has organized a competition for public-key algorithms secure against a quantum computer. It recently published all of its Round 1 submissions. (Details of the NIST efforts are here. A timeline for the new algorithms is here.)
Powered by WPeMatico
December 27, 2017 algorithms, contests, cryptography, nist, quantumcomputing, Security technology Read more >
Interesting research on a version of RSA that is secure against a quantum computer:
Post-quantum RSA
Daniel J. Bernstein, Nadia Heninger, Paul Lou, and Luke Valenta
Abstract: This paper proposes RSA parameters for which (1) key generation, encryption, decryption, signing, and verification are feasible on today’s computers while (2) all known attacks are infeasible, even assuming highly scalable quantum computers. As part of the performance analysis, this paper introduces a new algorithm to generate a batch of primes. As part of the attack analysis, this paper introduces a new quantum factorization algorithm that is often much faster than Shor’s algorithm and much faster than pre-quantum factorization algorithms. Initial pqRSA implementation results are provided.
Powered by WPeMatico
May 31, 2017 academicpapers, quantumcomputing, rsa, Security technology Read more >
NIST is accepting proposals for public-key algorithms immune to quantum computing techniques. Details here. Deadline is the end of November 2017.
I applaud NIST for taking the lead on this, and for taking it now when there is no emergency and we have time to do this right.
Slashdot thread.
Powered by WPeMatico
December 23, 2016 algorithms, cryptography, nist, quantumcomputing, Security technology Read more >
This talk (and paper) describe a lattice-based public-key algorithm called Soliloquy developed by GCHQ, and a quantum-computer attack on it.
News article.
Powered by WPeMatico
December 4, 2014 academicpapers, algorithms, cryptanalysis, cryptography, quantumcomputing, quantumcryptography, Security technology Read more >