Post-quantum cryptography
Open accessThe DOI matches its Crossref record; 84 of the 84 references it cites were found in a registry or an index.
Abstract
Cryptography is essential for the security of online communication, cars and implanted medical devices. However, many commonly used cryptosystems will be completely broken once large quantum computers exist. Post-quantum cryptography is cryptography under the assumption that the attacker has a large quantum computer; post-quantum cryptosystems strive to remain secure even in this scenario. This relatively young research area has seen some successes in identifying mathematical operations for which quantum algorithms offer little advantage in speed, and then building cryptographic systems around those. The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, the authors of [183] showed that almost all of the current public-key mechanisms can be broken by Shor's algorithms [184].”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [183]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Post-quantum cryptography (PQC) refers to a new generation of asymmetric algorithms that cannot be broken by Shor’s algorithm and therefore are considered quantum-resistant.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [23]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“However, numerous shortcomings of the aforementioned approaches are mentioned in [183].”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [183]
The cited source says what the claim attributes to it.
In the citing paper
“As pointed out in [183], post-quantum cryptosystems still need varying designs alongside techniques for optimization and implementation.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [183]
The cited source says what the claim attributes to it.
In the citing paper
“Authors in [183] have shown five key approaches for which no known way of applying the Shor's algorithm exists.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [183]
4 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
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 3×
“RSA-3072 [7] signature 128 broken (Shor)”
InfluentialA 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
A 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×
“Many more cryptographic systems are affected by an algorithm that Grover [18] intro-”
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 13×
“For example, very recently the “cyclotomic” structure of x p − 1 has been used to break [18, 19, 20] some lattice-based cryptosystems by an extension of Shor’s algorithm.”
InfluentialKocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634 · cited 2×
“Replacing multiplication mod p with addition of points on an “elliptic curve” mod p breaks “elliptic-curve cryptography” [11, 12] (ECC), a popular alternative to RSA.”
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_9 · Cited by 4,387 · cited 1×
“The most important examples are “side-channel attacks”, in which the attacker learns extra information by observing timing [49], power consumption [50], etc.”
Use 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
The design of Rijndael AES - the advanced encryption standard
Daemen, J., & Rijmen, V. (2002) · Cited by 2,863
Research works printed but not linked: 3
- [18] Campbell, P., Groves, M. & Shepherd, D. Soliloquy: a cautionary tale (2014). URL http://docbox.etsi.org/Workshop/2014/201410\_CRYPTO/S07\_ Systems\_and\_Attacks/S07\_Groves\_Annex.pdf . -
- [41] Merkle, R. C. Secrecy, authentication, and public key systems . Ph.D. thesis, Stanford University (1979). http://www.merkle.com/papers/Thesis1979.pdf . -
- [54] Alkim, E., Ducas, L., P¨ oppelmann, T. & Schwabe, P. Post-quantum key exchange - A new hope. In Holz, T. & Savage, S. (eds.) 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016. , 327343 (USENIX Association, 2016). URL https://www.usenix.org/conference/ usenixsecurity16/technical-sessions/presentation/alkim . -
Cited by
Items 501–600 of 1,003
Beating the break-even point with autonomous quantum error correction
Li, Y., Mei, Q.-X., Jie, Q., Cai, W., Li, Y., Liu, Z., Chen, Z.-J., Xie, Z., Cheng, X., Zhao, X., et al. (2026) · Nature Physics · doi:10.1038/s41567-026-03486-y · Cited by 10
“Quantum computers promise substantial computational power for quantum chemistry, quantum many-body physics, and cryptography [19–22].”
SLAP: Simpler, Improved Private Stream Aggregation from Ring Learning with Errors
Takeshita, J., Karl, R., Gong, T., & Jung, T. (2023) · Journal of Cryptology · doi:10.1007/s00145-023-09450-w · Cited by 8
“To prepare for a future with quantum-capable adversaries, cryptographers have begun to construct schemes with post-quantum security against such attackers [37].”
Backgroundo'g'li, M. S. B. (2023) · International Journal of Law and Policy · doi:10.59022/ijlp.46 · Cited by 8
Far, S. B., & Rad, A. I. (2024) · Data Science and Management · doi:10.1016/j.dsm.2024.03.001 · Cited by 8
Memory Integrity Techniques for Memory-Unsafe Languages: A Survey
Moghadam, V. E., Serra, G., Aromolo, F., Buttazzo, G., & Prinetto, P. (2024) · IEEE Access · doi:10.1109/access.2024.3380478 · Cited by 8
“The potential prospect of powerful quantum computers becoming widely available has led to the need for developing quantum-resistant cryptographic protocols, in what is known as post-quantum cryptography [130], [131].”
BackgroundQuantum and Post-Quantum Security in Future Networks
Sanon, S. P., Alzalam, I., & Schotten, H. D. (2023) · IEEE Future Networks World Forum (FNWF) · doi:10.1109/fnwf58287.2023.10520624 · Cited by 8
“PQC develops new cryptographic algorithms that are secure against quantum computers and can be run on a classical computer [6].”
BackgroundLPbT-SSO: Password-Based Threshold Single-Sign-On Authentication From LWE
Cao, C., Xu, C., Jiang, C., Zhang, Z., Dong, X., & Chen, K. (2024) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2024.3404045 · Cited by 10
SHP-FsNTT: A Scalable and High-Performance NTT Accelerator Based on the Four-step Algorithm
Chen, X., Lu, W., Su, T., & Chen, D. (2024) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas58744.2024.10558123 · Cited by 8
“RLWE-based schemes include Post-Quantum Cryptography (PQC) [1] and Fully Homomorphic Encryption (FHE) [2].”
BackgroundChaQra: a cellular unit of the Indian quantum network
Gupta, S., Agarwal, I., Mogiligidda, V., Krishnan, R. K., Chennuri, S., Aggarwal, D., Hoodati, A., Cooper, S., Ranjan, Ranjan, et al. (2024) · Scientific Reports · doi:10.1038/s41598-024-67495-8 · Cited by 9
“It derives the symmetric keys using hybrid approach incorporating multi layers (Post Quantum Cryptography + steganography + Galois field) for post-quantum security of 401 bits.”
BackgroundInfluentialGeneration and deployment of honeytokens in relational databases for cyber deception
Prabhaker, N., Bopche, G. S., & Arock, M. (2024) · Computers & Security · doi:10.1016/j.cose.2024.104032 · Cited by 11
Quantum Secure Anonymous Communication Networks
Rahman, M. S., DiAdamo, S., Mehić, M., & Fleming, C. (2024) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc62729.2024.00060 · Cited by 8
“PQC protocols, encompassing strategies like lattice-based, hash-based, and multivariate polynomial cryptography, are designed to withstand quantum attacks [7].”
BackgroundNguyen, T. N., Chien, T. V., Tran, D.-H., Minh, B. V., Nguyen, C.-N., Vozn̆ák, M., & Ding, Z. (2024) · IEEE Systems Journal · doi:10.1109/jsyst.2024.3463715 · Cited by 8
“More importantly, with recent advances in quantum computing, existing cryptography techniques could soon become unreliable while quantum-safe or postquantum cryptography is still under development [20].”
Exploring AES Encryption Implementation Through Quantum Computing Techniques
Gorine, A., & Suhaib, M. (2024) · American Journal of Computer Science and Technology · doi:10.11648/j.ajcst.20240704.12 · Cited by 9
Smith‐Miles, K. (2025) · Applied Mathematical Modelling · doi:10.1016/j.apm.2025.115965 · Cited by 11
A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
Mathew, K. P., Vasant, S., & Rangan, C. P. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-12160-4_21 · Cited by 8
Experimental demonstration of confidential communication with quantum security monitoring
Gong, Y., Wonfor, A., Hunt, J. H., White, I. H., & Penty, R. V. (2021) · Scientific Reports · doi:10.1038/s41598-021-01013-y · Cited by 10
“Possible candidates to respond to this threat are post quantum (or quantum resistant) cryptography (PQC) 17 which is a refinement of current cryptography not susceptible to Shor’s algorithm 18 , and quantum key distribution (QKD) 19 which transmits secure keys using quantum states for classical symmetry encryption.”
InfluentialPerformance Analysis of Post-Quantum Algorithms
Lauterbach, F., Burdiak, P., Richter, F., & Vozn̆ák, M. (2021) · Telecommunications Forum (TELFOR) · doi:10.1109/telfor52709.2021.9653313 · Cited by 8
A High-Speed FPGA-Based Hardware Implementation for Leighton-Micali Signature
Song, Y., Hu, X. H., Tian, J., & Wang, Z. (2022) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2022.3210016 · Cited by 8
“By then, most widely-used public-key cryptographic schemes would be broken, including Rivest-Shamir-Adleman (RSA), Digital Signature Algorithm (DSA), and Elliptic Curve Digital Signature Algorithm (ECDSA) [5].”
MethodToward Next Generation Quantum-Safe eIDs and eMRTDs: A Survey
Alnahawi, N., Schmitt, N., Wiesmaier, A., & Zok, C.-M. (2023) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3585517 · Cited by 9
“Unlike classical schemes relying on non-quantum-safe number-theoretic hardness assumptions (e.g., discrete logarithms and integer factorizing), PQC algorithms are based on mathematical problems that presumably cannot be solved efficiently using QC or by classical computers for that matter [25, 28].”
BackgroundMethodA Generic Cryptographic Deep-Learning Inference Platform for Remote Sensing Scenes
Chen, Q., Wu, Y., Wang, X., Jiang, Z. L., Zhang, W., Liu, Y., & Alazab, M. (2023) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2023.3260867 · Cited by 8
“And the critical function of fully HE [47], [50] is to support the addition and multiplication operations under ciphertext The process of HE is as above.”
BackgroundMethodWahlang, R., & Chandrasekaran, K. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00023 · Cited by 8
“The popular schemes to have garnered attention [5] includes mathematical objects based on lattices, error-correcting codes, hash functions, multivariate polynomials and isogenies.”
BackgroundRaheman, F. (2024) · Journal of Computer and Communications · doi:10.4236/jcc.2024.127005 · Cited by 8
“Post Quantum Cryptography (PQC) encompasses a new generation of algorithms for the creation of asymmetric keys that are believed to be resistant to attacks by quantum computers [55].”
BackgroundA novel voting scheme using quantum cryptography
Sundar, D. S., & Narayan, N. (2014) · IEEE Conference on Open Systems · doi:10.1109/icos.2014.7042411 · Cited by 8
A Latency-Optimized Hash-Based Digital Signature Accelerator for the Tactile Internet
Pauls, F., Wittig, R., & Fettweis, G. P. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-27562-4_7 · Cited by 8
Code Based Cryptography and Steganography
Véron, P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40663-8_5 · Cited by 8
A Quantum-classical Hybrid Architecture for Security Algorithms Acceleration
Possignolo, R. T., & Margi, C. B. (2012) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom.2012.49 · Cited by 9
Combinatorial Designs for Authentication and Secrecy Codes
Huber, M. R. (2008) · now publishers, Inc. eBooks · doi:10.1561/9781601983596 · Cited by 7
What is Cognitive Computing? An Architecture and State of the ArtPreprint
Elnagar, S., Thomas, M. A., & Osei-Bryson, K.-M. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4357990 · Cited by 8
Securing MIMO Wiretap Channel With Learning-Based Friendly Jamming Under Imperfect CSI
Tuan, B. M., Nguyen, D. N., Trung, N. L., Nguyen, V., Huynh, N. V., Hoang, D. T., Krunz, M., & Dutkiewicz, E. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3536702 · Cited by 10
“Finally, quantum computing may soon crack encryption techniques while post-quantum cryptography is still in its infancy and may not be feasible/suitable for power-constrained devices [4].”
QD-MSA : A quantum distributed tensor network framework for multimodal sentiment analysis
Li, Y., Li, Y., Qi, Z., Yang, H., Shang, R., & Jiao, L. (2025) · Information Fusion · doi:10.1016/j.inffus.2025.103404 · Cited by 8
Ultra lightweight post-quantum resistant 5G-AKA protocol
Braeken, A. (2025) · Computer Networks · doi:10.1016/j.comnet.2025.111444 · Cited by 7
Lightweight Post-Quantum Cryptographic Solutions for IoT: A Practical Approach
El-Hajj, M. I. (2025) · Intelligent Cybersecurity Conference (ICSC) · doi:10.1109/icsc65596.2025.11139871 · Cited by 7
“For instance, lattice-based schemes like Kyber demand 10–100× more energy than AES [6], making them impractical for battery-powered sensors.”
InfluentialQuantum AI Enhanced Blockchain Security for Drug Discovery
Roosan, D., Khou, T., Pham, B., Li, Y., Ashakin, M. R., Khan, H. M., Khan, R. I., & Haider, M. R. (2026) · Lecture notes in electrical engineering · doi:10.1007/978-981-95-0887-7_1 · Cited by 9
6G AI Security: From Fundamentals to Offensive and Defensive Landscape in 6G
Braeken, A., Deac, D., Nguyen, T. T., Gür, G., Pham, Q., Yapa, C., Naranjo, P. G. V., Mora, H. C., Moremada, C., & Liyanage, M. (2026) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2026.3659793 · Cited by 10
“These algorithms rely on di ff erent hard problems as the factorization and discrete logarithm, where lattice-based cryptography, code-based cryptography, and multivariate polynomial cryptography are among the most popular [142].”
Quantum-Resistant Security for Blockchain-Enabled 6G Networks: A Comprehensive Review
Udugahapattuwa, P., de Alwis, C., Zeydan, E., Wijewardhana, U., & Liyanage, M. (2026) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2026.3673993 · Cited by 9
“There are some key features [127], [128], [129] in the quantum-resistant consensus blockchain algorithms shown below.”
Ezeogu, A. O. (2025) · Research Corridor Journal of Engineering Science · doi:10.66320/s0k5vw19 · Cited by 14
On the Practicality of Quantum Sieving Algorithms for the Shortest Vector Problem
Doriguello, J. F., Giapitzakis, G., Luongo, A., & Morolia, A. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-22695-2_1 · Cited by 7
Cybersecurity Measures for Protecting Data
Adeyinka, K. I., & Adeyinka, T. I. (2024) · Advances in information security, privacy, and ethics book series · doi:10.4018/979-8-3693-9491-5.ch016 · Cited by 9
Palaniswamy, B., Karati, A., Chen, T.-Y., Das, A. K., & Bhargava, B. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3583246 · Cited by 7
“The current landscape of public-key encryption methods, exemplified by Rivest-Shamir-Adleman (RSA) and elliptic curve cryptography (ECC), is potentially vulnerable to Shor’s algorithm [7].”
QF2PM: Quantum-Secure Fine-Grained Privacy-Preserving Profile Matching for Mobile Social Networks
Huang, X., Zhang, W., Wang, X., Zhang, S., & Khan, M. K. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3619531 · Cited by 7
“In response to the threat posed by quantum computers, some scholars have been actively investigating alternative solutions—post-quantum cryptography (PQC) [47], [48], [49], [50], [51], [52].”
Decoding Square-Free Goppa Codes Over $\BBF_{p}$
Barreto, P. S. L. M., Misoczki, R., & Lindner, R. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2270272 · Cited by 7
XOR of PRPs in a Quantum World
Mennink, B., & Szepieniec, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_21 · Cited by 7
“The growing branch of post-quantum cryptography [9] focuses chiefly on public key cryptosystems and aims to offer immunity to Shor’s quantum algorithm for integer factorization and discrete logarithms [50].”
Hosoyamada, A., & Yamakawa, T. (2024) · Journal of Cryptology · doi:10.1007/s00145-024-09517-2 · Cited by 8
Improvements on new quantum key agreement protocol with five-qubit Brown states
Karim, F. K., Abulkasim, H., Alabdulkreem, E. A., Ahmed, N. M. O. S., Jamjoom, M. M., & Abbas, S. (2022) · Modern Physics Letters A · doi:10.1142/s0217732322501280 · Cited by 7
Innovative frontiers: Post-quantum perspectives in healthcare and medical imaging
Herzog, D. J., & Herzog, N. J. (2024) · Imaging and Radiation Research · doi:10.24294/irr.v6i1.3852 · Cited by 7
Bonny, T., & Nassan, W. A. (2024) · Applied System Innovation · doi:10.3390/asi7060107 · Cited by 7
Pattern-based quantum text watermarking: Securing digital content with next-Gen quantum techniques
Xing, Z., Yuan, X., & Lam, C. (2024) · iScience · doi:10.1016/j.isci.2024.111364 · Cited by 9
Robust Access Control for Secure IoT Outsourcing with Leakage Resilience
Riad, K. (2025) · Sensors · doi:10.3390/s25030625 · Cited by 7
“Classical security primitives, such as AES-128, SHA-256, and ECDSA, rely on mathematical problems that can be efficiently solved by quantum algorithms, like Shor’s algorithm [52].”
A practically scalable approach to the closest vector problem for sieving via QAOA with fixed angles
Priestley, B., & Wallden, P. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae4cc6 · Cited by 10
“There have been many new proposals for cryptosystems based on different problems that are believed to be secure against any adversary with a large, fault-tolerant quantum computer (see Bernstein and Lange [8] for a recent review).”
A variant of rainbow with shorter secret key and faster signature generation
Yasuda, T., Ding, J., Takagi, T., & Sakurai, K. (2013) · ACM ASIA Public-Key Cryptography Workshop (APKC) · doi:10.1145/2484389.2484401 · Cited by 7
Evolutionary techniques in lattice sieving algorithms
Laarhoven, T. T. (2019) · TU/e Research Portal · Cited by 7
Non-Invertible Public Key Certificates
Lizama-Pérez, L. A., & R., J. M. L. (2021) · Entropy · doi:10.3390/e23020226 · Cited by 8
“On the other side, post-quantum cryptography encompasses cryptographic methods conceived to resist computational capacity of quantum computers [10, 4].”
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
Barbero, S., Bellini, E., Sanna, C., & Verbel, J. A. (2021) · Discrete Applied Mathematics · doi:10.1016/j.dam.2021.11.014 · Cited by 7
Random Sampling for Short Lattice Vectors on Graphics Cards
Schneider, M., & Lahr, N. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23951-9_11 · Cited by 8
Custom TTA Operations for Accelerating Kyber Algorithm
Akçay, L., & Örs, B. (2021) · National Conference on Electrical and Electronics Engineering (ELECO) · doi:10.23919/eleco54474.2021.9677863 · Cited by 7
A Tree-type Multiparty Quantum Key Agreement Protocol Against Collusive Attacks
Hao, Y., Lu, S., Zhu, J., Wu, J., Zhou, Q., & Li, T. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05265-w · Cited by 7
“Nevertheless, as the security of the traditional cryptosystems relies on unproven mathematical assumptions, the powerful computing power of future quantum computers may threaten the security of many current public-key cryptosystems [5].”
BackgroundRecent Trends and Open Challenges in Blind Quantum Computation
Joshi, M., Karthikeyan, S., & Mishra, M. K. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-28183-9_34 · Cited by 7
A Rainbow-Based Authentical Scheme for Securing Smart Connected Health Systems
Yi, H., Li, J., Lin, Q., Wang, H. H., Song, H., Ming, Z., & Nie, Z. (2019) · Journal of Medical Systems · doi:10.1007/s10916-019-1320-7 · Cited by 7
Ilie, D. I., Knottenbelt, W. J., & Stewart, I. D. (2020) · Springer proceedings in business and economics · doi:10.1007/978-3-030-37110-4_9 · Cited by 11
“However, as each of these topics is by itself fairly complex, we recommend readers unfamiliar to these concepts to examine existing literature, such as: [2,24,25] for Bitcoin, [18,26] for quantum computing, and [3] for quantum resistant schemes.”
BackgroundExcited State Search Using Quantum Annealing
Seki, Y., Matsuzaki, Y., & Kawabata, S. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.054002 · Cited by 10
Accelerating the Development of NTRU Algorithm on Embedded Systems
Camacho-Ruiz, E., Martínez‐Rodríguez, M. C., Sánchez-Solano, S., & Brox, P. (2020) · Conference on Design of Circuits and Integrated Systems · doi:10.1109/dcis51330.2020.9268647 · Cited by 7
“They were classified into two groups: public-key encryption and key-establishment algorithms, and digital signatures algorithms [5].”
MethodQuantum and semi-quantum sealed-bid auction: vulnerabilities and advantages
Asagodu, P., Thapliyal, K., & Pathak, A. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03537-2 · Cited by 7
“that the universal hash functions are often discussed in context of post-quantum cryptography [40].”
BackgroundAnatomy of entanglement and nonclassicality criteriaPreprint
Taşgın, M. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.04045 · Cited by 8
“Technologies, like quantum cryptography [1], quantum teleportation [2], measurements below standard quantum limit [3, 4] and quantum radars [5], are made possible by quantum nonclassicality, e.”
BackgroundQKD Oracles for Authenticated Key ExchangePreprint
Hövelmanns, K., Planken, D., Schaffner, C., & Verschoor, S. R. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2509.12478 · Cited by 10
Hasija, T., Ramkumar, K. R., Kaur, A., & Bali, M. S. (2025) · Journal Of Big Data · doi:10.1186/s40537-025-01269-5 · Cited by 7
Ying, L., Gong, Y., Huang, W., Cai, J., Xu, N., & Li, K. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-28124-2_32 · Cited by 6
Lattice-Based Cryptography in the Quantum Era: A Survey
Laule, M. S. C., & Olazabal, J. (2023) · Interfases · doi:10.26439/interfases2023.n018.6631 · Cited by 8
“Analogous to typical private and public key encryption, the private set will make it easier to calculate the lattice (Bernstein et al., 2017).”
BackgroundQKD protected fiber-based infrastructure for time dissemination
Meda, A., Mura, A., Virzì, S., Avella, A., Levi, F., Degiovanni, I. P., Geraldi, A., Valeri, M., Bartolo, S. D., Catuogno, T., et al. (2025) · Scientific Reports · doi:10.1038/s41598-025-97480-8 · Cited by 9
“5,6 .”
An Analysis of Existing Hash-Based Post-Quantum Signature Schemes
Păcurar, C. M., Bocu, R., & Iavich, M. (2025) · Symmetry · doi:10.3390/sym17060919 · Cited by 6
Trungadi, F., Fabiano, M., Aloisio, D., Brunaccini, G., Sergi, F., Merlino, G., & Longo, F. (2025) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2025.104199 · Cited by 16
Entanglement-assisted authenticated BB84 protocol
Farré, P. J., Galetsky, V., Ghosh, S., Nötzel, J., & Deppe, C. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae0838 · Cited by 6
“The review in [3] and the comprehensive survey in [4] outline the state of the art in QKD and its evolution over the past decades.”
A Flexible NTT-Based Multiplier for Post-Quantum Cryptography
Koleci, K., Mazzetti, P., Martina, M., & Masera, G. (2023) · IEEE Access · doi:10.1109/access.2023.3234816 · Cited by 6
“Indeed, a new approach in Public Key Cryptography is required to handle the threats posed by Quantum Computers [1].”
BackgroundExperimental Boson Sampling Enabling Cryptographic One-Way Function
Wang, X., Zhou, W.-H., Fu, Y.-X., Gao, J., Lu, Y., Chang, Y.-J., Qiao, L., Ren, R.-J., Jiang, Z.-K., Jiao, Z., et al. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.060802 · Cited by 9
Physically Encrypted Wireless Transmission Based on XOR between Two Data in Terahertz Beams
Chen, H., Che, M., Seiki, N., Shiramizu, T., Yano, T., Mikami, Y., Ueda, Y., & Kato, K. (2023) · Electronics · doi:10.3390/electronics12122629 · Cited by 7
Schema Extraction in NoSQL Databases: A Systematic Literature Review
Belefqih, S., Zellou, A., & Berquedich, M. (2023) · Recent Advances in Computer Science and Communications · doi:10.2174/0126662558273437231204061106 · Cited by 7
Digital Footprints and the Battle for Data Sovereignty: Digital Privacy, Security, and Ownership
Sharma, I., & Aggarwal, A. (2024) · Advances in human and social aspects of technology book series · doi:10.4018/979-8-3693-3253-5.ch005 · Cited by 9
Quantum Computing: A Comprehensive Review
Tamrakar, A., & Sharma, R. (2019) · Türk bilgisayar ve matematik eğitimi dergisi · doi:10.61841/turcomat.v10i3.14623 · Cited by 6
Quantum-Safe Internet of Things
Chattopadhyay, A., Bhasin, S., Güneysu, T. E., & Bhunia, S. (2024) · IEEE Design and Test · doi:10.1109/mdat.2024.3408748 · Cited by 6
“To that end, quantum key distribution (QKD) [3] and postquantum cryptography (PQC) [4] are being promoted as two distinct and yet complementary solutions—eventually aiming toward a quan-tum-safe digital society.”
BackgroundAn efficient quantum oblivious transfer protocol
Sarkar, S., Srivastava, V., Mohanty, T., Debnath, S. K., & Mesnager, S. (2024) · Cluster Computing · doi:10.1007/s10586-024-04642-w · Cited by 6
A meta-analysis on NIST post-quantum cryptographic primitive finalists
Benny, S., Desai, I., Uriarte, L., Tsai, I., & McMahan, L. (2024) · Journal of Emerging Investigators · doi:10.59720/23-233 · Cited by 6
“Recognizing this imminent threat, the U.S. National Institute of Standards and Technology (NIST) initiated a standardization process in 2016 to address the vulnerability of current cryptographic systems in the face of quantum computing (6).”
BackgroundWang, Y., Li, L., Zhou, Y., & Zhang, H. (2024) · Axioms · doi:10.3390/axioms13110741 · Cited by 6
Public Key Cryptosystem Based on Low Density Lattice Codes
Hooshmand, R., & Aref, M. R. (2016) · Wireless Personal Communications · doi:10.1007/s11277-016-3596-y · Cited by 6
“These cryptosystems are seemed to be more secure than RSA and ElGamal encryption schemes against quantum computers and can be considered as the potential alternatives to conventional public key schemes [1].”
BackgroundLi, Z., Ling, S., Xing, C., & Yeo, S. L. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2967047 · Cited by 6
“We refer the reader to [36, 7] for more background materials.”
BackgroundNon-invertible key exchange protocol
Lizama-Pérez, L. A. (2020) · SN Applied Sciences · doi:10.1007/s42452-020-2791-3 · Cited by 7
Secure Route-Obfuscation Mechanism with Information-Theoretic Security for Internet of Things
Rauf, A., Wang, Z., Sajid, H., & Tahir, M. A. (2020) · Sensors · doi:10.3390/s20154221 · Cited by 6
A Study of Post Quantum Cipher Suites for Key Exchange
Garcia, D., & Liu, H. (2021) · IEEE Conference on Technologies for Homeland Security (HST) · doi:10.1109/hst53381.2021.9619839 · Cited by 6
NTRU and LASH for a Quantum Resistant Blockchain
Easttom, C. (2022) · IEEE Annual Computing and Communication Workshop and Conference (CCWC) · doi:10.1109/ccwc54503.2022.9720790 · Cited by 8
“However, it has been proven that quantum computing will render current widely used asymmetric cryptographic algorithms obsolete [1], [2].”
BackgroundPreventing a Cryptoapocalypse: From mathematics to circuits for postquantum cryptography
Roy, S. S., & Banerjee, U. (2023) · IEEE Solid-State Circuits Magazine · doi:10.1109/mssc.2022.3221692 · Cited by 6
“A significantly powerful quantum computer could easily solve these mathematical problems using Shor’s algorithm and therefore break the backbone of public key cryptography [2].”
Simple implementation of vectorial modulo operation based on fundamental parallelepiped
Angeletti, P. (2012) · Electronics Letters · doi:10.1049/el.2011.3667 · Cited by 6
Attacking Code-Based Cryptosystems with Information Set Decoding Using Special-Purpose Hardware
Heyse, S., Zimmermann, R., & Paar, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_8 · Cited by 6
Revisiting fully homomorphic encryption schemes and their cryptographic primitives
Zhang, Z. (2014) · Research Online (University of Wollongong) · Cited by 6
Selecting Parameters for the Rainbow Signature Scheme - Extended Version -.Preprint
Petzoldt, A., Bulygin, S., & Buchmann, J. A. (2010) · IACR Cryptology ePrint Archive · Cited by 6
A usability study of post-quantum algorithms
Kindberg, M. (2017) · Lund University Publications Student Papers (Lund University) · Cited by 7
CyclicRainbow - A multivariate Signature Scheme with a Partially Cyclic Public Key based on Rainbow.Preprint
Petzoldt, A., Bulygin, S., & Buchmann, J. A. (2010) · IACR Cryptology ePrint Archive · Cited by 6
Optimizing the walk coin in the quantum random walk search algorithm through machine learningPreprint
Tonchev, H., & Danev, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.08020 · Cited by 6
“These two quantum algorithms can break classical cryptographic protocols RSA [22] and the cryptographic protocol of elliptic curves [23].”
BackgroundReducing the Key Size of the SRP Encryption Scheme
Duong, D. H., Petzoldt, A., & Takagi, T. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-40367-0_27 · Cited by 5
Soft Decoding Based on Ordered Subsets of Verification Equations of Turbo-Productive Codes
Kuznetsov, A. A., Кіян, А., Kuznetsov, A. A., Hryhorenko, V., Smirnov, O. A., & Prokopovych-Tkachenko, D. (2019) · doi:10.32782/cmis/2353-69 · Cited by 5
“The obtained results may be useful in constructing information security code schemes [21-26], for example, as a real alternative to traditional cryptography for post-quantum applications [27].”
BackgroundControl Layer Security: A New Security Paradigm for Cooperative Autonomous Systems
Guo, W., Wei, Z., Villarreal, O. J. G., Perrusquía, A., & Tsourdos, A. (2023) · IEEE Vehicular Technology Magazine · doi:10.1109/mvt.2023.3290773 · Cited by 5
“, the integer factorization problem, the discrete logarithm problem, and the elliptic-curve discrete logarithm problem, of which, however, all could be solved by an eavesdropper (Eve) equipped with a powerful quantum computer [2].”
BackgroundAI and quantum computing ethics- same but different? Towards a new sub-field of computing ethics
Coates, R. L., Douglas, D., & Per, M. C. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/add9c2 · Cited by 8
“The possibility of breaking existing methods of public-key encryption creates the need for methods of post-quantum cryptography that are not vulnerable to the capabilities of quantum computers (Bernstein and Lange 2017).”
A comprehensive review on hardware implementations of lattice-based cryptographic schemes
Ahmadunnisa, S., & Mathe, S. E. (2025) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2025.103486 · Cited by 5
Metadata
- Authors
- Bernstein, D. J., & Lange, T.
- Affiliations
- University of Illinois Chicago (US)
- Eindhoven University of Technology (NL)
- Corresponding author
- Lange, Tanja
- Venue
- Nature
- Published
- 2017-09
- Volume
- 549
- Issue
- 7671
- Pages
- 188-194
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1513904472
- Semantic Scholar
- 99291ce0b97a31c786560241fea62604332afbf5
- Cited by
- 1,242
- References
- 61
- Citations by year
- 2026: 180 · 2025: 238 · 2024: 179 · 2023: 152 · 2022: 73 · 2021: 83 · 2020: 40 · 2019: 42 · 2018: 23 · 2017: 14
- FWCI
- 19.41
- Type
- journal article
- Language
- en
- Open access
- green
- research.tue.nl
- Licence
- other-oa
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- TU/e Research Portal (submittedVersion)
- TU/e Research Portal (submittedVersion, other-oa)
- Funders
- National Science Foundation (1314919)
- European Commission (645622)
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- post-quantum cryptography, quantum computing threats, quantum algorithms, cryptographic security, internet security, cryptosystem design
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
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.