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.
CITATION STYLE
Bernstein, D. J., Heninger, N., Lou, P., & Valenta, L. (2017). Post-quantum rsa. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10346 LNCS, pp. 311–329). Springer Verlag. https://doi.org/10.1007/978-3-319-59879-6_18
Mendeley helps you to discover research relevant for your work.