Post-Quantum RSA

2017-05-31T11:31:30
ID SCHNEIER:5328F5F16F1AC974FBD6655EAE3E5FB0
Type schneier
Reporter Bruce Schneier
Modified 2017-05-31T11:31:30

Description

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.