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 601–700 of 1,003
Quantum Resistant Authentication and Key Agreement Protocol (AKA) for Autonomous Vehichle
Wang, W., & Tan, S. F. (2025) · International Conference on Neural Networks, Information and Communication Engineering (NNICE) · doi:10.1109/nnice64954.2025.11064484 · Cited by 7
“Meanwhile, PQC has been proposed as a paradigm of classical cryptography schemes that are secure against attackers with access to fault-tolerant quantum computers [16].”
Power-consumption back door in quantum key distribution
da Costa, B. L., Bolaños, M. R., Chaves, R., Narduzzi, C., Avesani, M., Marangon, D. G., Stanco, A., Vallone, G., Villoresi, P., & Omar, Y. (2025) · Physical Review Applied · doi:10.1103/f92x-c3zj · Cited by 5
“Along-side post-quantum cryptography [6], it offers a promising way to develop cryptographic systems that are secure against attacks by classical and quantum computers [7].”
Security and Privacy Management of IoT Using Quantum Computing
Sen, J. (2026) · Studies in computational intelligence · doi:10.1007/978-981-95-6276-3_4 · Cited by 6
Predictive Modeling of Quantum Computing Development and its Impact on Blockchain Security
Švarcmajer, M., Šabanović, D., Köhler, M., & Lukić, I. (2026) · IEEE Access · doi:10.1109/access.2026.3689963 · Cited by 5
“We develop a capacity-based modeling approach for estimating logical qubit availability using conservative, baseline, and optimistic fault-tolerance assumptions drawn from published literature [6], [7].”
Security Analysis of an Improved MFE Public Key Cryptosystem
Nie, X., Zhao-hu, X., Lu, L., & Liao, Y. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25513-7_9 · Cited by 5
Kuantum Kriptolojisi ve Siber Güvenlik
Çelik, S. (2021) · Bilişim Teknolojileri Dergisi · doi:10.17671/gazibtd.733309 · Cited by 5
Using Error-Correcting Codes to Ensure Information Security of Unmanned Vehicles and IoT Systems
Pankov, K. N., & Глухов, М. М. (2022) · 2018Systems of Signal Synchronization, Generating and Processing in Telecommunications (SYNCHROINFO) · doi:10.1109/synchroinfo55067.2022.9840949 · Cited by 5
Quantum privacy‐preserving service for secure lane change in vehicular networks
Rahmani, Z., Barbosa, L. S., & Pinto, A. N. (2023) · IET Quantum Communication · doi:10.1049/qtc2.12059 · Cited by 5
Secure Cloud Storage using End-to-End Encryption
Sinha, S., Shankar, M., Pande, Y., Kumar, K. S., Sharma, S., & Virdi, K. (2023) · International Journal for Research in Applied Science and Engineering Technology · doi:10.22214/ijraset.2023.57414 · Cited by 5
Unbreakable and breakable quantum censorship
Pinske, J., & Sperling, J. (2024) · Physical Review A · doi:10.1103/physreva.109.052408 · Cited by 5
“As Shor’s algorithm for the efficient factoring of prime numbers exemplified [1], quantum information can be used to break certain cryptographic schemes [2, 3], being foundational for quantum [4, 5] and post-quantum cryptography [6].”
Quantum Computers—Security Threats and Solutions
Szatmáry, K. S. (2024) · Advanced sciences and technologies for security applications · doi:10.1007/978-3-031-47990-8_38 · Cited by 5
Structural analysis of code-based algorithms of the NIST post-quantum call
de la Torre, M. Á. G., Encinas, L. H., & GarcÍa, J. I. S. (2024) · Logic Journal of IGPL · doi:10.1093/jigpal/jzae071 · Cited by 5
Safeguarding Consumer Rights in the Digital Age: Challenges and Strategies
Babaev, J. (2023) · Uzbek journal of law and digital policy. · doi:10.59022/ujldp.70 · Cited by 5
Folorunsho, S. O., Adenekan, O. A., Ezeigweneme, C. A., Ike, C. S., & Okeleke, P. A. (2024) · Computer Science & IT Research Journal · doi:10.51594/csitrj.v5i8.1448 · Cited by 5
Blockchain Technology in Cybersecurity: Uses Beyond Cryptocurrencies
Malik, V., Khanna, A., & Nalluri, S. (2024) · International Journal of Global Innovations and Solutions (IJGIS) · doi:10.21428/e90189c8.d37d59a9 · Cited by 5
An Improved Multi-Chaotic Public Key Algorithm Based on Chebyshev Polynomials
Zhang, C., Bai, J., Liang, Y., Tavares, A., Wang, L., Gomes, T., & Pinto, S. (2024) · Algorithms · doi:10.3390/a17090389 · Cited by 5
Quantum-Resistant Security Analysis of Blockchain Networks with PoS Consensus
Umar, A., & Kumar, D. (2024) · IEEE International Conference on Blockchain and Distributed Systems Security (ICBDS) · doi:10.1109/icbds61829.2024.10837168 · Cited by 5
“Although they are less explored in practical blockchain implementations, their theoretical foundations suggest significant potential for enhancing blockchain security against quantum threats [10].”
The adversary: the philosophy of cryptography
Halpin, H. (2025) · Journal of Cybersecurity · doi:10.1093/cybsec/tyaf006 · Cited by 7
Embedded Syndrome-Based Hashing
von Maurich, I., & Güneysu, T. E. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34931-7_20 · Cited by 5
Polynomial Structures in Code-Based Cryptography
Drăgoi, V., Cayrel, P.-L., Colombier, B., & Richmond, T. (2013) · Lecture notes in computer science · doi:10.1007/978-3-319-03515-4_19 · Cited by 5
Proof-Carrying Sensing: Towards Real-World Authentication in Cyber-Physical Systems
Wu, M. H., Pereira, F. M. Q., Liu, J., Ramos, H. S., Alvim, M. S., & Oliveira, L. B. (2017) · ACM Conference on Embedded Networked Sensor Systems (SenSys) · doi:10.1145/3131672.3131700 · Cited by 15
Yi, H. (2020) · Measurement · doi:10.1016/j.measurement.2020.107827 · Cited by 5
Fast and Secure Routing Algorithms for Quantum Key Distribution Networks
Vishnu, B., & Sinha, A. (2022) · International Conference on Communication Systems & Networks (COMSNETS) · doi:10.1109/comsnets53615.2022.9668578 · Cited by 5
Quantum Learning and Its Related Applications for the Future
Bhowmik, B. R., & Manjunath, T. D. (2023) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-6684-6697-1.ch002 · Cited by 5
Locking Down Big Data: A Comprehensive Survey of Data Encryption Methods
Srihith, I. V. D., Donald, A. D., Srinivas, T. A. S., Thippanna, G., & Anjali, D. (2023) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-9102 · Cited by 5
Machine Learning Ensures Quantum-Safe Blockchain Availability
Seol, J., & Kim, J. (2024) · Journal of Computer Information Systems · doi:10.1080/08874417.2024.2308207 · Cited by 5
Practical Algebraic Cryptanalysis for Dragon-Based Cryptosystems
Buchmann, J. A., Bulygin, S., Ding, J., Mohamed, W. S. A. E., & Werner, F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17619-7_11 · Cited by 5
Hierarchical ID-Based Blind Signature from Lattices
Chen, L., Cui, Y., Tang, X., Hu, D., & Xin, W. (2011) · International Conference on Computational Intelligence and Security (CIS) · doi:10.1109/cis.2011.182 · Cited by 5
Hash-Based TPM Signatures for the Quantum World
Ando, M., Guttman, J. D., Papaleo, A. R., & Scire, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-39555-5_5 · Cited by 5
“Fortunately, a number of cryptographic techniques are believed to be quantum-secure despite these known algorithms, including: hashbased, code-based, lattice-based, and multivariate-quadratic-equations cryptography [11, 12].”
BackgroundMethodInfluentialEfficient Parallel Evaluation of Multivariate Quadratic Polynomials on GPUs
Tanaka, S., Chou, T., Yang, B., Cheng, C.-M., & Sakurai, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35416-8_3 · Cited by 7
From personalization to patient centered systems toxicology and pharmacology
Ochoa, J. G. D., & Weil, F. (2019) · Computational Toxicology · doi:10.1016/j.comtox.2019.02.002 · Cited by 5
Su, G., Pu, T., Zheng, J., & Tan, Y. (2019) · IEEE Access · doi:10.1109/access.2019.2955226 · Cited by 5
Optimization Space Exploration of Hardware Design for CRYSTALS-KYBER
Zhao, Y., Chao, Z., Ye, J., Wang, W., Cao, Y., Chen, S., Li, X., & Li, H. (2020) · Proceedings - Asian Test Symposium/Proceedings · doi:10.1109/ats49688.2020.9301498 · Cited by 5
“Although symmetric cryptography is still secure by expanding the size of the key, public key cryptography suffers from a great degree of irreversible damage [1, 11].”
BackgroundCode Structures for Quantum Encryption and Decryption
Sakk, E., & Wang, S. P. (2021) · International Conference on Cryptography, Security and Privacy (CSP) · doi:10.1109/csp51677.2021.9357606 · Cited by 5
“In the era of post-quantum cryptography there appear to be two basic areas of focus [1,2].”
BackgroundA Calibration-Free In-Memory True Random Number Generator Using Voltage-Controlled MRAM
Yang, J., Wu, D., Lee, A., Razavi, S. A., Gupta, P., Wang, K. L., & Pamarti, S. (2021) · European Solid-State Circuits Conference (ESSCIRC) · doi:10.1109/esscirc53450.2021.9567766 · Cited by 6
Modular Framework for Constructing IoT-Server AKE in Post-Quantum Setting
Liu, B., Tang, Q., & Zhou, J. (2022) · IEEE Access · doi:10.1109/access.2022.3187537 · Cited by 5
The Threat of Quantum Computing to SMEs
Schindler, P., & Ruhland, J. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-031-10461-9_28 · Cited by 5
Evaluation of CRYSTALS-Kyber and Saber on the ARMv8 architecture
Ortiz, J. N., Rodrigues, F. C., Filho, D. L. G., Teixeira, C., López, J., & Dahab, R. (2022) · Simpósio Brasileiro de Cibersegurança (SBSeg) · doi:10.5753/sbseg.2022.224450 · Cited by 5
Evaluation of Quantum Key Distribution for Secure Satellite-integrated IoT Networks
Edwards, A., Law, Y. W., Mulinde, R., & Slay, J. (2023) · International Conference on Cyber Warfare and Security · doi:10.34190/iccws.18.1.982 · Cited by 7
Theoretical Analysis of Decoding Failure Rate of Non–binary QC–MDPC Codes
Vedenev, K., & Kosolapov, Y. V. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-46495-9_3 · Cited by 5
“With the advent of quantum computers, many traditional public–key cryptosystems based on number–theoretic or elliptic curves primitives are to become vulnerable to attacks using them [14, 42].”
BackgroundA New Multivariate Primitive from CCZ Equivalence
Calderini, M., Caminata, A., & Villa, I. (2025) · Journal of Cryptology · doi:10.1007/s00145-025-09544-7 · Cited by 5
“With the advent of Post-quantum Cryptography [BL17] following the development of Shor’s algorithm, many cryptographers have focused on finding quantum-resistant public-key systems.”
Broadcast Attacks against Code-Based Schemes
Niebuhr, R., & Cayrel, P.-L. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34159-5_1 · Cited by 5
Computing Shortest Lattice Vectors on Special Hardware
Schneider, M. (2011) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00002829 · Cited by 8
Quantum Blockchain Survey: Foundations, Trends, and GapsPreprint
Ghosh, S. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5380355 · Cited by 5
XOR Chain and Perfect Secrecy at the Dawn of the Quantum Era
Lizama-Pérez, L. A. (2023) · Cryptography · doi:10.3390/cryptography7040050 · Cited by 4
Privacy-preserving computation meets quantum computing: A scoping review
Gómez-Goiri, A., Seco-Aguirre, I., Lage, Ó., & Ruíz, A. (2025) · Digital Communications and Networks · doi:10.1016/j.dcan.2025.05.010 · Cited by 6
Gao, J., Cheng, T., Shi, Q., Yang, Z., & Zhu, J. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3598304 · Cited by 4
“In information theory, it offers unconditional security [18], [54].”
Efficient NTT/INTT processor for FALCON post-quantum cryptography
Alsuhli, G. H., Saleh, H. H., Al‐Qutayri, M., Mohammad, B. S., & Stouraitis, T. (2025) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2025.104177 · Cited by 4
Hasan, M. K., Hasan, M. M., Al-Qirim, N., Abdullah, S. R. S., Islam, S., & Razzaque, M. A. (2026) · Journal on Information Security · doi:10.1186/s13635-026-00225-x · Cited by 6
Quantum Technology Governance I: Law and Regulation
Aboy, M., Compagnucci, M. C., & Minssen, T. (2026) · Perspectives in law, business and innovation · doi:10.1007/978-981-95-8371-3 · Cited by 5
On the security of multivariate-based ring signature and other related primitives
Srivastava, V., Debnath, S. K., Tiwari, S. K., & Singh, H. (2023) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2023.103474 · Cited by 4
Analyzing the contribution of material science in quantum cryptography: A scientometric study
Sharma, P., Gupta, V., & Sood, S. K. (2023) · International Journal of Quantum Chemistry · doi:10.1002/qua.27280 · Cited by 4
Seo, H., & Kim, Y. (2024) · Proceedings - International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems · doi:10.1109/mascots64422.2024.10786505 · Cited by 4
Wang, J. P., Ji, Y., Yang, L. P., Wang, C. Q., Dong, L., & Xiu, X. (2024) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ad9f48 · Cited by 5
“It is widely used in quantum teleportation [ 7 – 9 ] , quantum key distribution [ 10 – 12 ] , quantum cryptography [ 2, 13 – 15 ] , quantum computing [ 16, 17 ] and so on.”
Performance of Practical Quantum Oblivious Key Distribution
Lemus, M., Schiansky, P., Goulão, M., Bozzio, M., Elkouss, D., Paunković, N., Mateus, P., & Walther, P. J. (2025) · PRX Quantum · doi:10.1103/j8mt-c124 · Cited by 7
“Classical cryptography based solutions, also referred as post-quantum cryptography [3–5], involve using a family of mathematical problems that are conjectured to be resilient to quantum computing attacks.”
High-Speed FPGA Implementation of Modular Multiplication Over Prime Field
Madani, B., Azzaz, M. S., Sadoudi, S., & Kaibou, R. (2024) · International Conference on Electrical, Computer, Telecommunication and Energy Technologies (ECTE-Tech) · doi:10.1109/ecte-tech62477.2024.10851072 · Cited by 4
Performance Evaluation and Benchmarking of PQC CRYSTALS-Kyber on Embedded Devices
Mighri, M. A., Benfarah, A., & Meddeb, A. (2024) · IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) · doi:10.1109/aiccsa63423.2024.10912602 · Cited by 4
“A. Kyber Specifications CRYSTALS-Kyber [2], [5] is a robust PQC scheme [6], designed to resist attacks from quantum computers while upholding stringent security levels.”
Kavitha, A., Balachandhar, R., & Harikrishna, K. (2025) · International Conference on Data Science, Agents & Artificial Intelligence (ICDSAAI) · doi:10.1109/icdsaai65575.2025.11011628 · Cited by 5
“…as: where H is a parity check matrix, s is the raw key, and e is the error vector [18, 19]. v) Privacy Amplification: Privacy amplification reduces partial information that could have been acquired by Eve through hashing on the reconciled key followed by the creation of a secure final key [12, 19].”
Evaluating Post-Quantum Cryptography in DNSSEC Signing for Top-Level Domain Operators
Schutijser, C., Koning, R., Lastdrager, E., & Hesselman, C. (2025) · Network Traffic Measurement and Analysis Conference (TMA) · doi:10.23919/tma66427.2025.11097008 · Cited by 4
“Therefore, we should consider the scenario in which currently deployed cryptographic algorithms need to be replaced with post-quantum ones [4].”
Rifat, M. R. I., Rahman, M. M., Nayon, M. A. K., Azad, M. S., & Mahdy, M. R. C. (2025) · Engineering Science and Technology an International Journal · doi:10.1016/j.jestch.2025.102167 · Cited by 5
On the security of the identity-based encryption based on DHIES from ASIACCS 2010
Susilo, W., & Baek, J. (2011) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1966913.1966962 · Cited by 4
Fortis-ámyna-smart contract model for cross border financial transactions
Narendra, K., & Aghila, G. (2021) · ICT Express · doi:10.1016/j.icte.2021.08.007 · Cited by 4
Quantum-resistant Cryptography in FPGA
Policarpo, R. C., Nery, A. S., & Albuquerque, R. D. O. (2022) · Workshop on Communication Networks and Power Systems (WCNPS) · doi:10.1109/wcnps56355.2022.9969738 · Cited by 4
“For instance, RSA (Rivest–Shamir–Adleman) and Elliptic Curve Cryptography are not quantum-resistant [3], since the underlying mathematical operations (e.g. factoring of large integers and the discrete logarithm problem, that are the basis of these systems) are difficult to solve on conventional…”
BackgroundProspects of Chip-Based Multi-Protocol Quantum Key Distribution Transceivers
Grebenchukov, A., Lui, H., Nazarikov, G., Cimoli, B., Rommel, S., & Monroy, I. T. (2023) · International Conference on Transparent Optical Networks · doi:10.1109/icton59386.2023.10207518 · Cited by 4
An Energy-Efficient Multiple-Factor Authentication Protocol for Critical Infrastructure IoT Systems
Momeni, M. R., Jabbari, A., & Fung, C. (2023) · Cyber Security in Networking Conference (CSNet) · doi:10.1109/csnet59123.2023.10339700 · Cited by 5
Generating Bell states and Werner states of two qubits via optical field
Jiang, D., Zhai, C., Song, Y., Peng, Z.-H., Yuan, J.-B., Tang, S.-Q., & Lu, W. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad39b0 · Cited by 5
Post-Quantum Security Measures for the Internet of Things
Şafak, I., Alagöz, F., & Anarım, E. (2024) · Advances in information quality and management · doi:10.4018/978-1-6684-7366-5.ch075 · Cited by 5
Quantum Computing and Cryptography: Addressing Emerging Threats
Yadav, A., & Gangarde, R. (2024) · International Conference on Intelligent Systems and Advanced Applications (ICISAA) · doi:10.1109/icisaa62385.2024.10828839 · Cited by 5
“To safeguard data in an instance of a quantum computer attack, the security of encrypted data can be ensured through algorithms using structured lattices, for example FALCON, hash functions, for example SPHINCS+ [42, 43].”
Post-Quantum Digital Signature: Verkle-Based HORST
Iavich, M., Kuchukhidze, T., & Bocu, R. (2025) · Journal of Cybersecurity and Privacy · doi:10.3390/jcp5020028 · Cited by 4
“To address these issues, stateless hash-based systems such as HORS (Hash to Obtain Random Subset) and its tree-based variant, HORST (HORS with Trees), were created [10,11].”
Efficient measurement of neutral-atom qubits with matched filters
Kent, R. M., Phuttitarn, L., Mude, C. N., Tannu, S., Saffman, M. E., Lafyatis, G. P., & Gauthier, D. J. (2026) · Physical Review Applied · doi:10.1103/x3h2-nz8y · Cited by 5
Ding, J., & Schmidt, D. S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_3 · Cited by 4
Quantum era challenges for classical computers
Regazzoni, F., Fowler, A. G., & Polian, I. (2018) · International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation · doi:10.1145/3229631.3264737 · Cited by 4
User-Generated Pseudonyms Through Merkle Trees
Kermezis, G., Limniotis, K., & Kolokotronis, N. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-76663-4_5 · Cited by 4
Fast asymmetric encryption and decryption of SimpleMatrix scheme for Internet of Things
Yi, H. (2022) · Computer Communications · doi:10.1016/j.comcom.2022.04.013 · Cited by 4
Cryptosystems Based on Tropical Congruent Transformation of Symmetric Matrices
Huang, H. (2022) · Symmetry · doi:10.3390/sym14112378 · Cited by 4
Integral Sampler and Polynomial Multiplication Architecture for Lattice-based Cryptography
Wang, A., Tan, W., Parhi, K. K., & Lao, Y. (2022) · Proceedings · doi:10.1109/dft56152.2022.9962361 · Cited by 4
“Currently, the National Institute of Standards and Technology (NIST) is standardizing one or more quantum-resistant public-key cryptographic algorithms, which is known as post-quantum cryptography (PQC) [4].”
BackgroundInfluentialPost-Quantum PHY-Layer Authentication for Secure Initial Access in V2X Communications
Xu, D., & Ritcey, J. A. (2022) · Globecom · doi:10.1109/globecom48099.2022.10001736 · Cited by 4
“On one hand, quantum computers can break current cryptosystems based on the hardness of factoring and discrete log algorithms, e.g., Rivest Shamir Adleman (RSA) and elliptic curve cryptography(ECC) [4].”
BackgroundSzczypiorski, K. (2020) · International Journal of Electronics and Telecommunications · doi:10.24425/ijet.2020.131870 · Cited by 4
“Currently, from the perspective of cryptanalysis, the end of this arms race is a vision of a quantum computer [5], and from the angle of cryptography – postquantum algorithms [6].”
BackgroundQuantum‐Accelerated Algorithms for Generating Random Primitive Polynomials Over Finite Fields
Huang, S., Yin, H., Chen, Z., & Wu, S. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300302 · Cited by 4
Experimental Factoring Integers Using Fixed-Point-QAOA with a Trapped-Ion Quantum Processor
Zalivako, I. V., Chernyavskiy, A. Y., Nikolaeva, A. S., Borisenko, A. S., Semenin, N. V., Galstyan, K. P., Korolkov, A. E., Grebnev, S. V., Kiktenko, E. O., Khabarova, K. Y., et al. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0021 · Cited by 4
“The implication of the integer factorization problem to the widely adopted cryptographic schemes, such as the RSA cryptosystem [3], is a clear motivation for studying its practical complexity within both the classical and quantum approaches [4, 5].”
A Proxy Signature Scheme Based on Coding Theory
Jannati, H., & Falahati, A. (2010) · Communications in computer and information science · doi:10.1007/978-3-642-15717-2_30 · Cited by 4
Quantum-assisted QD-CFS signatures
Possignolo, R. T., Margi, C. B., & Barreto, P. S. L. M. (2014) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2014.10.003 · Cited by 4
You Shall Not Pass! (Once Again): An IoT Application of Post-quantum Stateful Signature Schemes
Bellini, E., Caullery, F., Hasikos, A., Manzano, M., & Mateu, V. (2018) · ACM ASIA Public-Key Cryptography Workshop (APKC) · doi:10.1145/3197507.3197512 · Cited by 4
Impact of the malicious input data modification on the efficiency of quantum spatial search
Glos, A., & Miszczak, J. A. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2459-3 · Cited by 5
“Motivation While the intensive research effort invested in the area of quantum computing is fully justified by groundbreaking theoretical developments [1, 2, 3], year by year scientists have discovered new limitations of quantum computing devices [4].”
BackgroundCryptography from post-quantum assumptionsPreprint
Kazmi, R. A. (2015) · IACR Cryptology ePrint Archive · doi:10.82308/36805 · Cited by 7
Low-rank tensor decompositions of quantum circuitsPreprint
Gelß, P., Klus, S., Knebel, S., Shakibaei, Z., & Pokutta, S. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2205.09882 · Cited by 7
“With increasing frequency, they are used for such versatile applications as machine learning [9, 10], cryptography [11, 12], chemistry [13, 14], and finance [15, 16].”
BackgroundInvited Paper: Instruction Set Extensions for Post-Quantum Cryptography
Brohet, M., Valencia, F., & Regazzoni, F. (2023) · doi:10.1109/iccad57390.2023.10323931 · Cited by 3
“Bernstein and Lange [34] presented an introductory review of the PQC field.”
Chikouche, N., Mezrag, F., & Hamza, R. (2024) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-024-04852-5 · Cited by 3
Resilience of lattice-based Cryptosystems to Quantum Attacks
Köppl, T., Zander, R., & Tcholtchev, N. (2024) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc61673.2024.10733570 · Cited by 3
“Motivated by the enormous effort that is made to improve both quantum hardware and algorithms, new ideas and concepts for analyzing and developing public key cryptosystems are considered at the moment [13], [14].”
BackgroundA Tight Security Proof for SPHINCS$$^{+}$$, Formally Verified
Barbosa, M., Dupressoir, F., Hülsing, A., Meijers, M., & Strub, P.-Y. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0894-2_2 · Cited by 3
Towards efficient and secure quantum-classical communication networks
Zeng, P., Bandyopadhyay, D., Méndez, J. A. M., Bitner, N., Kolar, A., Solomon, M. T., Heremans, F. J., Awschalom, D. D., Jiang, L., & Liu, J. (2024) · IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA) · doi:10.1109/tps-isa62245.2024.00070 · Cited by 3
“Another approach is to explore alternative computationally hard mathematical problems, which has sparked interest in the field of post-quantum cryptography (PQC) [29].”
Analysis of learning with errors problems with variational quantum algorithms
Zeng, J., Zheng, M., Li, H., Wei, S., & Long, G. (2025) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/add959 · Cited by 4
Quantum-AI Federated Clouds: A trust-aware framework for cross-domain observability and security
Olufemi, O. D. (2025) · World Journal of Advanced Research and Reviews · doi:10.30574/wjarr.2025.26.2.2074 · Cited by 3
“…to build Quantum-AI Federated Clouds (QAIFC) stems from the following: • Rising threats to classical encryption: Quantum computing algorithms such as Shor’s and Grover’s can compromise RSA, ECC, and symmetric encryption, necessitating post-quantum cryptographic measures (Bernstein et al., 2017).”
Post-Quantum Cryptography: A Comprehensive Review of Past Technologies and Current Advances
Jain, B., & Mittal, H. (2025) · Global Conference on AI Research and Emerging Developments (G-CARED) · doi:10.63169/gcared2025.p52 · Cited by 3
Quantum Voice‐Based Cyber‐Attacks: Threats, Vulnerabilities, and Post‐Quantum Mitigation Strategies
Sihare, S. R. (2025) · Security and Privacy · doi:10.1002/spy2.70106 · Cited by 3
A survey of folding-based zero-knowledge proofs
Sakwa, C. O., Omala, A. A., & Li, F. (2025) · Information Sciences · doi:10.1016/j.ins.2025.122698 · Cited by 5
Decoherence and quantum threats in voice biometric authentication with post-quantum countermeasures
Sihare, S. R. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04980-7 · Cited by 3
Public policy considerations of quantum computing
Moloney, K., & Al-Kuwari, S. M. (2025) · Science and Public Policy · doi:10.1093/scipol/scaf065 · Cited by 4
Evaluating Post-Quantum Cryptographic Algorithms on Resource-Constrained Devices
Lopez, J., Cadena, V., & Rahman, M. S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00103 · Cited by 6
“In particular, Shor’s algorithm can efficiently solve the integer factorization and discrete logarithm problems that underpin RSA and ECC, rendering them insecure in the presence of large-scale quantum computers [6], [7].”
Superconducting-qubit readout using next-generation reservoir computing
Kent, R., Lienhard, B., Lafyatis, G. P., & Gauthier, D. J. (2026) · Physical Review Applied · doi:10.1103/bnwn-d2p4 · Cited by 4
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.