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: 4
- Campbell, P., Groves, M. & Shepherd, D. Soliloquy: a cautionary tale. http://docbox.etsi.org/Workshop/2014/201410_CRYPTO/S07_Systems_and_Attacks/S07_Groves_Annex.pdf (2014)
- Bernstein, D. J., Chuengsatiansup, C., Lange, T. & van Vredendaal, C. NTRU Prime. Preprint at https://eprint.iacr.org/2016/461 (2016)
- Merkle, R. C. Secrecy, Authentication, and Public Key Systems. PhD thesis, Stanford Univ., http://www.merkle.com/papers/Thesis1979.pdf (1979)
- Alkim, E., Ducas, L., Pöppelmann, T. & Schwabe, P. Post-quantum key exchange—a new hope. In 25th USENIX Security Symp. (USENIX Security 16) (eds Holz, T. & Savage, S.) 327–343 (USENIX Association, 2016)
Cited by
BKZ 2.0: Better Lattice Security Estimates
Chen, Y., & Nguyen, P. Q. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_1 · Cited by 598
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Applebaum, B., Cash, D., Peikert, C., & Sahai, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_35 · Cited by 562
Quantum computing: A taxonomy, systematic review and future directions
Gill, S. S., Kumar, A., Singh, H., Singh, M., Kaur, K., Usman, M., & Buyya, R. (2022) · Software: Practice and Experience · doi:10.1002/spe.3039 · Cited by 476
“The post-quantum cryptosystem is defined as the set of cryptography primitives and protocols that are secure against quantum computer attacks [65] [66] [67] [68] [69].”
BackgroundThe Evolution of Quantum Key Distribution Networks: On the Road to the Qinternet
Cao, Y., Zhao, Y., Wang, Q., Zhang, J., Ng, S. X., & Hanzo, L. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3144219 · Cited by 505
Security and Privacy for 6G: A Survey on Prospective Technologies and Challenges
Nguyen, V.-L., Lin, P.-C., Cheng, B.-C., Hwang, R.-H., & Lin, Y.-D. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3108618 · Cited by 515
“Although there are no known attacks that successfully break existing public cryptographic schemes [152], many cryptographers are still pursuing futuristic cryptographic schemes to prepare for when such attacks become reality.”
BackgroundComputing Systems for Autonomous Driving: State of the Art and Challenges
Liu, L., Lu, S., Zhong, R., Wu, B., Yao, Y., Zhang, Q., & Shi, W. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3043716 · Cited by 450
“Thus, designing postquantum cryptography [233] and architecture is a promising topic for CAVs and infrastructure in ITS.”
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
The Roadmap to 6G Security and Privacy
Porambage, P., Gur, G., Osorio, D. P. M., Liyanage, M., Gurtov, A., & Ylianttila, M. (2021) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2021.3078081 · Cited by 416
“Integrating post-quantum cryptography schemes with physical layer security schemes may ensure secure 6G communication links [118].”
BackgroundZero 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
“However, numerous shortcomings of the afore-mentioned approaches are mentioned in [183].”
BackgroundMethodInfluentialTransitioning organizations to post-quantum cryptography
Joseph, D., Misoczki, R., Manzano, M., Tricot, J., Pinuaga, F. D., Lacombe, O., Leichenauer, S., Hidary, J., Venables, P., & Hansen, R. (2022) · Nature · doi:10.1038/s41586-022-04623-2 · Cited by 281
“To name a few conferences on the International Association of Cryptological Research (IACR) calendar, there is Post-Quantum Cryptography, Real World Cryptography, Public-Key Cryptography, and Cryptographic Hardware and Embedded Systems.”
BackgroundInfluentialFaster Fully Homomorphic Encryption
Stehlé, D., & Steinfeld, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_22 · Cited by 330
Blockchain Technology: Security Issues, Healthcare Applications, Challenges and Future Trends
Wenhua, Z., Qamar, F., Abdali, T.-A. N., Hassan, R., Jafri, S. T. A., & Nguyen, Q. N. (2023) · Electronics · doi:10.3390/electronics12030546 · Cited by 282
Quantum Algorithms: A Survey of Applications and End-to-end Complexities
Dalzell, A. M., McArdle, S., Berta, M., Bienias, P., Chen, C.-F., Gilyén, A., Hann, C. T., Kastoryano, M. J., Khabiboulline, E. T., Kubica, A., et al. (2023) · RWTH Publications (RWTH Aachen) · doi:10.18154/rwth-2026-02888 · Cited by 360
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Güneysu, T., Lyubashevsky, V., & Pöppelmann, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_31 · Cited by 301
Simple Encrypted Arithmetic Library - SEAL v2.1
Chen, H., Laine, K., & Player, R. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70278-0_1 · Cited by 275
A Survey of Important Issues in Quantum Computing and Communications
Yang, Z., Zolanvari, M., & Jain, R. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3254481 · Cited by 251
“Since quantum computers endanger classical cryptography, post-quantum cryptography (based on classical computers) has also been proposed to avoid the quantum threats classically [131], [132], [133].”
BackgroundInfluentialSecurity Bounds for the Design of Code-Based Cryptosystems
Finiasz, M., & Sendrier, N. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_6 · Cited by 260
Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_29 · Cited by 254
Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
May, A., Meurer, A., & Thomae, E. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_6 · Cited by 215
Quantum Communication Using Semiconductor Quantum Dots
Vajner, D. A., Rickert, L., Gao, T., Kaymazlar, K., & Heindel, T. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202100116 · Cited by 206
Reducing Key Length of the McEliece Cryptosystem
Berger, T. P., Cayrel, P.-L., Gaborit, P., & Otmani, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02384-2_6 · Cited by 205
W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
Hülsing, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38553-7_10 · Cited by 195
Challenges and Opportunities of Near-Term Quantum Computing Systems
Corcoles, A. D., Kandala, A., Javadi-Abhari, A., McClure, D. T., Cross, A. W., Temme, K., Nation, P. D., Steffen, M., & Gambetta, J. M. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954005 · Cited by 203
“…qubit measurement, etc.) or other quantum hardware approaches (references within, for example, [7]), quantum information [1], [132] (including its relationship with complexity theory [133]), quantum communication [134], [135] (e.g., QKD), quantum sensing [136], and post-quantum cryptography [137].”
BackgroundAlgebraic Cryptanalysis of McEliece Variants with Compact Keys
Faugère, J.-C., Otmani, A., Perret, L., & Tillich, J.-P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_14 · Cited by 188
Smaller Decoding Exponents: Ball-Collision Decoding
Bernstein, D. J., Lange, T., & Peters, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_42 · Cited by 191
Self-citationEriksson, T. A., Hirano, T., Puttnam, B. J., Rademacher, G., Luís, R. S., Fujiwara, M., Namiki, R., Awaji, Y., Takeoka, M., Wada, N., et al. (2019) · Communications Physics · doi:10.1038/s42005-018-0105-5 · Cited by 176
Analysis of Autoencoders for Network Intrusion Detection
Song, Y., Hyun, S., & Cheong, Y.-G. (2021) · Sensors · doi:10.3390/s21134294 · Cited by 151
“With the advent of quantum computing, classical public key cryptography will face limitations in terms of security [1], thus post-quantum public key cryptography is being developed to replace them [2,3].”
BackgroundA Survey on Fully Homomorphic Encryption: An Engineering Perspective
Martins, P., Sousa, L. A., & Mariano, A. (2017) · ACM Computing Surveys · doi:10.1145/3124441 · Cited by 177
“LBCsare usually supported on either the Closest Vector Problem (CVP), the Shortest Vector Problem (SVP), or the General Learning with Errors (GLWE), the definitions of which follow (Bernstein et al. 2008; Brakerski et al. 2012), and can be instantiated for any norm.”
BackgroundQuantum computers put blockchain security at risk
Fedorov, A. K., Kiktenko, E. O., & Lvovsky, A. I. (2018) · Nature · doi:10.1038/d41586-018-07449-z · Cited by 159
Quantum computing challenges in the software industry. A fuzzy AHP-based approach
Awan, U., Hannola, L., Tandon, A., Goyal, R. K., & Dhir, A. (2022) · Information and Software Technology · doi:10.1016/j.infsof.2022.106896 · Cited by 184
Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms
Asif, R. (2021) · IoT · doi:10.3390/iot2010005 · Cited by 193
“Others have been broken or excluded from the process; some are more conservative or demonstrate how far it would be possible to advance classical cryptography so that it could not be cracked by a quantum computer at a fair expense [14].”
BackgroundInformation-Set Decoding for Linear Codes over F q
Peters, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_7 · Cited by 160
Optimized Schoolbook Polynomial Multiplication for Compact Lattice-Based Cryptography on FPGA
Liu, W., Fan, S., Khalid, A., Rafferty, C., & O'Neill, M. P. (2019) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2019.2922999 · Cited by 160
Bernstein, D. J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_6 · Cited by 158
Self-citationA Survey and Comparison of Post-Quantum and Quantum Blockchains
Yang, Z., Alfauri, H., Farkiani, B., Jain, R. K., Pietro, R. D., & Erbad, A. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3325761 · Cited by 179
“Detailed information on post-quantum cryptosystems can be found in [8], [13], [16].”
BackgroundMethodInternet of Things 2.0: Concepts, Applications, and Future Directions
Zhou, I., Makhdoom, I., Shariati, N., Raza, M. A., Keshavarz, R., Lipman, J., Abolhasan, M., & Jamalipour, A. (2021) · IEEE Access · doi:10.1109/access.2021.3078549 · Cited by 160
“In this regard, classical cryptography could be vulnerable to quantum computers [354].”
BackgroundRoom‐Temperature Phosphorescence Enabled through Nacre‐Mimetic Nanocomposite Design
Yao, X., Wang, J., Jiao, D., Huang, Z., Mhirsi, O., Lossada, F., Chen, L., Haehnle, B., Kuehne, A. J. C., Ma, X., et al. (2020) · Advanced Materials · doi:10.1002/adma.202005973 · Cited by 146
Javeed, D., Saeed, M. S., Ahmad, I., Adil, M., Kumar, P., & Islam, A. K. M. N. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.06.023 · Cited by 162
“In contrast to conventional cryptographic algorithms that may be susceptible to quantum computer attacks, PQC makes use of mathematical structures that are considered to remain secure even when strong quantum algorithms are present [89].”
BackgroundAnalyzing Blockwise Lattice Algorithms Using Dynamical Systems
Hanrot, G., Pujol, X., & Stehlé, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_25 · Cited by 141
KaLi: A Crystal for Post-Quantum Security Using Kyber and Dilithium
Aikata, A., Mert, A. C., Imran, M., Pagliarini, S., & Roy, S. S. (2022) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2022.3219555 · Cited by 135
Fully Homomophic Encryption over the Integers Revisited
Cheon, J. H., & Stehlé, D. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46800-5_20 · Cited by 145
McBits: Fast Constant-Time Code-Based Cryptography
Bernstein, D. J., Chou, T., & Schwabe, P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40349-1_15 · Cited by 158
Self-citationShahidinejad, A., & Abawajy, J. (2024) · ACM Computing Surveys · doi:10.1145/3645087 · Cited by 134
“This is because they are based on the Elliptic Curve Discrete Logarithm Problem or Integer Factorization Problem that can be easily solved by quantum computers using Shor’s algorithm [39].”
MethodDesign Principles for HFEv- Based Multivariate Signature Schemes
Petzoldt, A., Chen, M.-S., Yang, B., Tao, C., & Ding, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48797-6_14 · Cited by 123
“Besides lattice, code and hash based cryptosystems, multivariate cryptography is one of the main candidates for this [1].”
BackgroundIdentifying Research Challenges in Post Quantum Cryptography Migration and Cryptographic AgilityPreprint
Ott, D. E., Peikert, C., & participants, O. W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.07353 · Cited by 151
Algorithms for the Shortest and Closest Lattice Vector Problems
Hanrot, G., Pujol, X., & Stehlé, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20901-7_10 · Cited by 120
A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
Cayrel, P.-L., Véron, P., & Alaoui, S. M. E. Y. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19574-7_12 · Cited by 115
Random Organic Nanolaser Arrays for Cryptographic Primitives
Feng, J., Wen, W., Wei, X., Jiang, X., Cao, M., Wang, X., Zhang, X., Jiang, L., & Wu, Y. (2019) · Advanced Materials · doi:10.1002/adma.201807880 · Cited by 114
Business Renaissance: Opportunities and Challenges at the Dawn of the Quantum Computing Era
How, M.-L., & Cheah, S.-M. (2023) · Businesses · doi:10.3390/businesses3040036 · Cited by 141
“Examples include lattice-based cryptography, code-based cryptography, and multivariate polynomial cryptography [47].”
BackgroundBiryukov, A., Bouillaguet, C., & Khovratovich, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45611-8_4 · Cited by 112
A Review of Digital Twin Technologies for Enhanced Sustainability in the Construction Industry
Zhang, Z., Wei, Z., Court, S., Yang, L., Wang, S., Thirunavukarasu, A., & Zhao, Y. (2024) · Buildings · doi:10.3390/buildings14041113 · Cited by 126
“Figure 1 shows the increasing trend of GHG emissions from the UK construction industry over the past decade [6].”
BackgroundPost-Quantum Era Privacy Protection for Intelligent Infrastructures
Malina, L., Dzurenda, P., Ricci, S., Hajny, J., Srivastava, G., Matulevicius, R., Affia, A.-A. O., Laurent, M., Sultan, N. H., & Tang, Q. (2021) · IEEE Access · doi:10.1109/access.2021.3062201 · Cited by 111
“Bernstein and Lange [35] explained the damage of classic cryptography done by quantum computing and describe some candidates for post-quantum cryptography.”
BackgroundSafeguarding Next-Generation Multiple Access Using Physical Layer Security Techniques: A Tutorial
Lv, L., Xu, D., Hu, R. Q., Ye, Y., Yang, L. X., Lei, X., Wang, X., Kim, D. I., & Nallanathan, A. (2024) · Proceedings of the IEEE · doi:10.1109/jproc.2024.3420127 · Cited by 112
“However, since 2022, SIDH and its encryption algorithm SIKE have been subjected to the key recovery attack proposed by Castryck et al. [112], and were finally fully deciphered.”
MethodQuantum-resistance in blockchain networks
Allende, M., León, D. L., Cerón, S., Pareja, A., Pacheco, E., Leal, A., Da Silva, M., Pardo, A., Jones, D., Worrall, D. J., et al. (2023) · Scientific Reports · doi:10.1038/s41598-023-32701-6 · Cited by 109
“Post-Quantum Cryptography encompasses a new generation of algorithms for the creation of asymmetric keys that are thought to be resistant to attacks by quantum computers [20].”
BackgroundSecuring the future internet of things with post‐quantum cryptography
Kumar, A., Ottaviani, C., Gill, S. S., & Buyya, R. (2022) · SECURITY AND PRIVACY · doi:10.1002/spy2.200 · Cited by 108
6G white paper: Research challenges for trust, security and privacy
Ylianttila, M., Kantola, R., Gurtov, A., Mucchi, L., Oppermann, I., Yan, Z., Nguyen, T. H., Liu, F., Hewa, T., Liyanage, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2004.11665 · Cited by 106
“There are public-key primitives considered to be quantum-safe [19].”
BackgroundSSE Implementation of Multivariate PKCs on Modern x86 CPUs
Chen, A. I.-T., Chen, M.-S., Chen, T.-R., Cheng, C.-M., Ding, J., Kuo, E. L.-H., Lee, F. Y.-S., & Yang, B. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04138-9_3 · Cited by 105
Post-Quantum Security: Opportunities and Challenges
Li, S., Chen, Y., Chen, L., Liao, J., Kuang, C., Li, K., Liang, W., & Xiong, N. N. (2023) · Sensors · doi:10.3390/s23218744 · Cited by 134
Torres, W. A. A., Steinfeld, R., Sakzad, A., Liu, J. K., Kuchta, V., Bhattacharjee, N., Au, M. H., & Cheng, J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93638-3_32 · Cited by 104
State-of-the-Art Survey of Quantum Cryptography
Kumar, A., & Garhwal, S. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09561-2 · Cited by 122
Rückert, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_14 · Cited by 103
Practical high-dimensional quantum key distribution protocol over deployed multicore fiber
Zahidy, M., Ribezzo, D., Lazzari, C. D., Vagniluca, I., Biagi, N., Müller, R., Occhipinti, T., Oxenløwe, L. K., Galili, M., Hayashi, T., et al. (2024) · Nature Communications · doi:10.1038/s41467-024-45876-x · Cited by 130
Digital Twins for 5G Networks: A Modeling and Deployment Methodology
Sanz, M., Rivera, D., Moreno, J. I., Álvarez-Campana, M., & Lopez, D. R. (2023) · IEEE Access · doi:10.1109/access.2023.3267548 · Cited by 117
“However, due to the critical importance of intercommunication between twins, we propose the use of post-quantum cryptography (PQC) [51], [52] on transport layer security (TLS) in the methodology phase for the twin link to try to make the communication between physical and digital elements more…”
MethodSimple Matrix Scheme for Encryption
Tao, C., Diene, A., Tang, S., & Ding, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_16 · Cited by 99
A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
Biasse, J., Jao, D., & Sankar, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13039-2_25 · Cited by 99
Finding shortest lattice vectors faster using quantum search
Laarhoven, T., Mosca, M., & van de Pol, J. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0067-5 · Cited by 115
“Currently, a small set of systems [13] are being studied intensely as possible systems to replace those broken by large-scale quantum computers.”
BackgroundPost-Quantum Cryptoprocessors Optimized for Edge and Resource-Constrained Devices in IoT
Ebrahimi, S., Bayat-Sarmadi, S., & Mosanaei-Boorani, H. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2903082 · Cited by 102
Baseri, Y., Chouhan, V., & Hafid, A. S. (2024) · Computers & Security · doi:10.1016/j.cose.2024.103883 · Cited by 107
“These countermeasures include strategies to control network congestion, prevent fragmentation, and enhance resistance against various attacks, all of which are essential during the transition to quantum-resistant protocols.”
BackgroundHöyhtyä, M., Boumard, S., Yastrebova, A., Järvensivu, P., Kiviranta, M., & Anttonen, A. (2022) · IEEE Access · doi:10.1109/access.2022.3206862 · Cited by 106
“In 6G communications, post-quantum cryptography will be 1906 essential to secure information [40], [197].”
BackgroundTowards a Quantum-Resilient Future: Strategies for Transitioning to Post-Quantum Cryptography
Aydeger, A., Zeydan, E., Yadav, A. K., Hemachandra, K. T., & Liyanage, M. (2024) · International Conference on the Network of the Future (NOF) · doi:10.1109/nof62948.2024.10741441 · Cited by 93
“IBM has also been actively working on integrating They have implemented lattice-based cryptographic algorithms such as CRYSTALS-Kyber and CRYSTALS-Dilithium into their cloud infrastructure to enable quantum-resistant data encryption and secure communication 7 .”
BackgroundMethodKey-Private Proxy Re-encryption under LWE
Aono, Y., Boyen, X., Phong, L. T., & Wang, L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-319-03515-4_1 · Cited by 98
Popoola, O. J., Rodrigues, M., Marchang, J., Shenfield, A., Ikpehai, A., & Popoola, J. (2024) · Internet of Things · doi:10.1016/j.iot.2024.101314 · Cited by 100
Quantum computing at the quantum advantage threshold: a down-to-business reviewPreprint
Fedorov, A. K., Gisin, N., Beloussov, S. M., & Lvovsky, A. I. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2203.17181 · Cited by 103
“These solutions, however, do not provide ultimate security as they are still based on computational complexity assumptions and their potential vulnerabilities are a subject of ongoing research [332, 333].”
BackgroundDecentralization Using Quantum Blockchain: A Theoretical Analysis
Yang, Z., Salman, T., Jain, R. K., & Pietro, R. D. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3207111 · Cited by 95
“To address the potential quantum threats, new classical cryptography algorithms, called post-quantum cryptography, are being developed [11].”
BackgroundReview of Security Methods Based on Classical Cryptography and Quantum Cryptography
Subramani, S., Selvi, M., Kannan, A., & Santhosh Kumar, S. V. N. (2023) · Cybernetics & Systems · doi:10.1080/01969722.2023.2166261 · Cited by 106
“Quantum cryptography uses the smallest quantity of physical property in a system and it allows storing thoughtful information to a key material and that cannot be read by anyone excluding the receiver (Bernstein 2011; Bernstein and Lange 2017).”
Cybersecurity in the quantum era: Assessing the impact of quantum computing on infrastructure
Baseri, Y., Chouhan, V., & Ghorbani, A. A. (2026) · Computers & Security · doi:10.1016/j.cose.2026.104917 · Cited by 86
“These providers focus on quantum-resistant cryptography (PQC) [13] to secure against quantum computing threats.”
Transforming research with quantum computing
Gill, S. S., & Buyya, R. (2024) · Journal of Economy and Technology · doi:10.1016/j.ject.2024.07.001 · Cited by 108
Efficient Quantum Blockchain With a Consensus Mechanism QDPoS
Li, Q., Wu, J., Quan, J., Shi, J., & Zhang, S. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3203316 · Cited by 83
“[44], [45], [46], [47] for further improving the 877 efficiency of the quantum blockchain.”
BackgroundQuantum Advantage in Cryptography
Renner, R., & Wolf, R. (2023) · AIAA Journal · doi:10.2514/1.j062267 · Cited by 99
“The goal of post-quantum cryptography [BBD09, BL17] is thus to find algorithms that are hard for quantum computers (which, of course, includes classical computers as a special case).”
BackgroundLBA-PAKE: Lattice-Based Anonymous Password Authenticated Key Exchange for Mobile Devices
Dabra, V., Bala, A., & Kumari, S. (2020) · IEEE Systems Journal · doi:10.1109/jsyst.2020.3023808 · Cited by 82
Kim, P., Han, D., & Jeong, K. C. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2107-3 · Cited by 80
Quantum cloud computing: Trends and challenges
Golec, M., Hatay, E. S., Golec, M., Uyar, M., Golec, M., & Gill, S. S. (2024) · Journal of Economy and Technology · doi:10.1016/j.ject.2024.05.001 · Cited by 101
Future-Proofing Security for UAVs With Post-Quantum Cryptography: A Review
Khan, M. A., Javaid, S., Mohsan, S. A. H., Tanveer, M., & Ullah, I. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3486649 · Cited by 96
“Grover’s search algorithm accelerates the key search process in symmetric schemes such as AES and 3DES, reducing the search time to the square root of the original time [7].”
McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks
Dinh, H., Moore, C., & Russell, A. C. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_43 · Cited by 94
CyclicRainbow – A Multivariate Signature Scheme with a Partially Cyclic Public Key
Petzoldt, A., Bulygin, S., & Buchmann, J. A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17401-8_4 · Cited by 79
Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices
Heyse, S., von Maurich, I., & Güneysu, T. E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40349-1_16 · Cited by 94
Quantum Cryptography for Future Networks Security: A Systematic Review
Durr-E-Shahwar, Imran, M., Altamimi, A. B., Khan, W., Hussain, S., & Alsaffar, M. S. (2024) · IEEE Access · doi:10.1109/access.2024.3504815 · Cited by 113
“Post Quantum Cryptography is also considered as a solution to this problem [5], [12].”
Quantum Algorithms: A Survey of Applications and End-to-end Complexities
Dalzell, A. M., McArdle, S., Berta, M., Bienias, P., Chen, C.-F., Gilyén, A., Hann, C. T., Kastoryano, M. J., Khabiboulline, E. T., Kubica, A., et al. (2025) · Cambridge University Press eBooks · doi:10.1017/9781009639651 · Cited by 146
Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
Ducas, L., & Nguyễn, P. Q. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_26 · Cited by 87
Quantum-resistant Transport Layer Security
García, C. R., Rommel, S., Takarabt, S., Olmos, J. J. V., Guilley, S., Nguyen, P. E., & Monroy, I. T. (2023) · Computer Communications · doi:10.1016/j.comcom.2023.11.010 · Cited by 86
“Unlike QKD, PQC maintains the same functional principles seen in classical asymmetric cryptography, such as key-pair generation, digital signatures, key-establishment or key encapsulation/decapsulation [28].”
Data Management in Biobanking: Strategies, Challenges, and Future Directions
Alkhatib, R., & Gaede, K. I. (2024) · BioTech · doi:10.3390/biotech13030034 · Cited by 90
“Implementing these algorithms will help ensure that sensitive information remains secure, even as quantum computing becomes more widespread [81].”
BackgroundMicroEliece: McEliece for Embedded Devices
Eisenbarth, T., Güneysu, T. E., Heyse, S., & Paar, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04138-9_4 · Cited by 77
Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
del Moral, J. O., iOlius, A. D., Vidal, G., Crespo, P. M., & Martínez, J. E. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3410702 · Cited by 94
“…the symmetric cryptography paradigm since the qudaratic boost can be compensated by doubling the key size and increasing the computational cost of the key exchange and encrypt and decrypt algorithms, but as it is just doubling down the key size, the extra costs are rarely noticeable [21].”
BackgroundMethodInfluentialHülsing, A., Ning, K.-C., Schwabe, P., Weber, F. J., & Zimmermann, P. R. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00030 · Cited by 75
Quantum Cloud Computing: A Review, Open Problems, and Future DirectionsPreprint
Nguyen, H. T., Krishnan, P., Krishnaswamy, D., Usman, M., & Buyya, R. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2404.11420 · Cited by 96
“On the contrary, many studies pay extensive attention to quantum security [27, 106, 163, 190], post-quantum cryptography [11, 16], and quantum-safe techniques [82]. where physical network characteristics are abstracted [54].”
BackgroundA survey on security and cryptographic perspective of Industrial-Internet-of-Things
Mishra, N., Islam, S. H., & Zeadally, S. (2023) · Internet of Things · doi:10.1016/j.iot.2023.101037 · Cited by 89
Eren, H., Karaduman, Ö., & Gençoğlu, M. T. (2025) · Applied Sciences · doi:10.3390/app15063225 · Cited by 91
ZHFE, a New Multivariate Public Key Encryption Scheme
Porras, J., Baena, J. B., & Ding, J. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_14 · Cited by 71
Bernstein, D. J., Lange, T., & Peters, C. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19574-7_10 · Cited by 71
Self-citation
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.