Journal
POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2017
Volume 10346, Issue -, Pages 311-329Publisher
SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1007/978-3-319-59879-6_18
Keywords
Post-quantum cryptography; RSA scalability; Shor's algorithm; ECM; Grover's algorithm; Make RSA Great Again
Categories
Funding
- Commission of the European Communities through the Horizon 2020 program [645622, 645421]
- Netherlands Organisation for Scientific Research (NWO) [639.073.005]
- U.S. National Institute of Standards and Technology [60NANB10D263]
- U.S. National Science Foundation [1314919, 1408734, 1505799, 1513671]
- Rachleff Scholars program at the University of Pennsylvania
- Direct For Computer & Info Scie & Enginr
- Division Of Computer and Network Systems [1513671, 1408734] Funding Source: National Science Foundation
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [1314919, 1505799] Funding Source: National Science Foundation
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
