Paper 2017/351 Original: eprint.iacr.org/2017/351 ↗
Post-quantum RSA
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2017-04-26: last updated
- 2017-04-26: published
- Short URL
- https://ia.cr/2017/351
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2017/351,
author = {Daniel J. Bernstein and Nadia Heninger and Paul Lou and Luke Valenta},
title = {Post-quantum RSA},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/351},
year = {2017},
url = {https://eprint.iacr.org/2017/351}
}