The DOI matches its Crossref record; 58 of the 59 references it cites were found in a registry or an index.
Quantum resistant public key cryptography: a survey
Abstract
Public key cryptography is widely used to secure transactions over the Internet. However, advances in quantum computers threaten to undermine the security assumptions upon which currently used public key cryptographic algorithms are based. In this paper, we provide a survey of some of the public key cryptographic algorithms that have been developed that, while not currently in widespread use, are believed to be resistant to quantum computing based attacks and discuss some of the issues that protocol designers may need to consider if there is a need to deploy these algorithms at some point in the future.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Though the symmetric encryption mechanism (e.g.AES) and hashing are secure against quantum attacks [109]”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [109]
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · cited 9×
“A modi.cation of the RSA public-key encryption procedure.”
BackgroundInfluentialA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“One-time pads [50, 53] and universal hash functions [8] are uncondi tionally secure in any computation model, if used properly, but they are usually impractical to use in a way that doesn’t invalidate the proof.”
BackgroundA fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · cited 1×
“While Grover developed a quantum search algo rithm that provides a quadratic speedup relative to search algorithms designed for classical computers [24], Bennet, Bernstein, Brassard, and Vazirani demonstrated that quan”
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 1×
“The possibility of quantum computation became relevant to cryptography in 1994, when Shor demonstrated efficient quantum algorithms for factoring and the computation of discrete logarithms [51].”
BackgroundA public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634 · cited 4×
“Alsoincluded within the secondfamilyis elliptic curve cryp-tography(ECC)[32,40], whichincludesallknown,practi- This paper is authored by employees of the U.S. Government and is in the public domain.”
BackgroundInfluentialUse of Elliptic Curves in Cryptography
Miller, V. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_31 · Cited by 3,946
Research works printed but not linked: 20
- Boneh D., 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, 514
- Courtois N., 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, 157
- Dubois V., 2007, 27th Annual International Cryptology Conference, 1
- Gama N., 2007, 10th International Conference on Practice and Theory in Public-Key Cryptography, 89
- Gamal T. E., 1984, Proceedings of CRYPTO '84, 10
- Gentry C., 2001, International Conference on the Theory and Application of Cryptographic Techniques, 182
- Gentry C., 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, 1
- 10.5555/646762.706185 · doi:10.5555/646762.706185
- Hoffstein J., 2003, Topics in Cryptology -- CT-RSA, 122
- Hoffstein J., 2006, PQCrypto 2006: International Workshop on Post-Quantum Cryptography, 141
- Hoffstein J., 2001, International Conference on the Theory and Application of Cryptographic Techniques, 211
- Howgrave-Graham N., 2007, 27th Annual International Cryptology Conference, 150
- Joux A., 2000, 20th Annual International Cryptology Conference, 20
- Merkle R. C., 1989, 9th Annual International Cryptology Conference, 218
- 10.5555/1167813.1705202 · doi:10.5555/1167813.1705202
- 10.5555/648244.753503 · doi:10.5555/648244.753503
- Miller V. S., 1986, Advances in Cryptology -- CRYPTO '85, 417
- Robinson S., 2003, Emerging insights on limitations of quantum computing shape quest for fast algorithms, SIAM News, 36
- Schnorr C.-P., 1995, International Conference on the Theory and Application of Cryptographic Techniques, 1
- W. Whyte. NTRUSign and P1363.1 Apr. 2006. http://grouper.ieee.org/groups/1363/WorkingGroup/presentations/P1363.1-2006-04.ppt. W. Whyte. NTRUSign and P1363.1 Apr. 2006. http://grouper.ieee.org/groups/1363/WorkingGroup/presentations/P1363.1-2006-04.ppt.
Cited by
Report on Post-Quantum Cryptography
Chen, L., Jordan, S., Liu, Y.-K., Moody, D., Peralta, R., Perlner, R., & Smith-Tone, D. (2016) · doi:10.6028/nist.ir.8105 · Cited by 1,034
Self-citationEnhanced model for PKI certificate validation in the mobile banking
Elbasheer, M. O., & Bashier, E. B. M. (2013) · INTERNATIONAL CONFERENCE ON COMPUTING, ELECTRICAL AND ELECTRONIC ENGINEERING · doi:10.1109/icceee.2013.6633984 · Cited by 535
“For long time the RSA and elliptic curve cryptosystems (ECC) have been considered as the most popular public key cryptography algorithms.”
MethodInfluentialTesting of Code-Based Pseudorandom Number Generators for Post-Quantum Application
Kuznetsov, A. A., Кіян, А., Smirnov, O. A., Череп, А. В., Kanabekova, M., & Chepurko, I. (2020) · International Conference on Dependable Systems, Services and Technologies (DESSERT) · doi:10.1109/dessert50317.2020.9125045 · Cited by 467
“Active research into the development of quantum computers has led to the post-quantum standardization competition announced by the National Institute of Standards and Technology in 2017, which will result in the standardization of projects in the field of encryption, electronic digital signature and key encapsulation…”
BackgroundMaking NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
“, [44]).”
Zero Trust Architecture (ZTA): A Comprehensive Survey
Syed, N. F., Shah, S. W., Shaghaghi, A., Anwar, A., Baig, Z., & Doss, R. (2022) · IEEE Access · doi:10.1109/access.2022.3174679 · Cited by 406
“AES) and hashing are secure against quantum attacks [109], they still need larger key size and hash length to maintain the necessary level of security [110].”
Background
Metadata
- Authors
- Perlner, R. A., & Cooper, D. A.
- Affiliations
- National Institute of Standards and Technology (US)
- Venue
- Proceedings of the 8th Symposium on Identity and Trust on the Internet
- Publisher
- ACM
- Published
- 2009-04-14
- Pages
- 85-93
- OpenAlex
- W2102542363
- Semantic Scholar
- 179d46754b5be8990570978b3f6547cc55cf3404
- Cited by
- 137
- References
- 59
- Citations by year
- 2026: 2 · 2025: 6 · 2024: 13 · 2023: 7 · 2022: 7 · 2021: 10 · 2020: 29 · 2019: 12 · 2018: 4 · 2017: 6 · 2016: 11 · 2015: 8 · 2014: 5 · 2013: 3 · 2012: 8
- FWCI
- 3.28
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Identity and Trust on the Internet (publishedVersion, public-domain)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- post-quantum cryptography, quantum attacks, public key algorithms, cryptographic protocol design, internet security
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum resistant public key cryptography: a survey. https://app.cochat.ai/papers/10.1145/1527017.1527028
- The paper
- Perlner, R. A., & Cooper, D. A. (2009). Quantum resistant public key cryptography: a survey. Proceedings of the 8th Symposium on Identity and Trust on the Internet. https://doi.org/10.1145/1527017.1527028
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.