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 101–200 of 1,003
Selecting Parameters for the Rainbow Signature Scheme
Petzoldt, A., Bulygin, S., & Buchmann, J. A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_16 · Cited by 69
Quantum distributed deep learning architectures: Models, discussions, and applications
Kwak, Y., Yun, W. J., Kim, J. P., Cho, H., Park, J., Choi, M., Jung, S., & Kim, J. (2022) · ICT Express · doi:10.1016/j.icte.2022.08.004 · Cited by 79
“post-quantum cryptography [22] is necessary to protect against quantum computing-based attacks, and a quantum communication security protocol using quantum entanglement and superposition has been popular for defending against such attacks.”
BackgroundThe Evaluation of Software Security through Quantum Computing Techniques: A Durability Perspective
Alyami, H., Nadeem, M., Alharbi, A., Alosaimi, W. A., Ansari, M. T. J., Pandey, D., Kumar, R., & Khan, R. A. (2021) · Applied Sciences · doi:10.3390/app112411784 · Cited by 67
“This method of correspondence depends on Einstein theory and is known as the ‘spooky action at a distance’ [23].”
BackgroundMethodInfluentialInverting HFE Systems Is Quasi-Polynomial for All Fields
Ding, J., & Hodges, T. J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_41 · Cited by 66
Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes
Bardet, M., Chaulet, J., Drăgoi, V., Otmani, A., & Tillich, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29360-8_9 · Cited by 71
A Lattice-Based Threshold Ring Signature Scheme
Cayrel, P.-L., Lindner, R., Rückert, M., & Silva, R. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14712-8_16 · Cited by 65
Architectures of flexible symmetric key crypto engines—a survey
Bossuet, L., Grand, M., Gaspar, L., Fischer, V., & Gogniat, G. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501655 · Cited by 72
Post-Quantum Cryptography: State of the Art
Buchmann, J. A., Butin, D., Göpfert, F., & Petzoldt, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49301-4_6 · Cited by 83
“Instead, they use codes such as Goppa codes [6] for which a representation exists that allows for efficient decoding.”
Vasani, V., Prateek, K., Amin, R., Maity, S., & Dwivedi, A. D. (2024) · Journal of Industrial Information Integration · doi:10.1016/j.jii.2024.100594 · Cited by 80
A Timing Attack against Patterson Algorithm in the McEliece PKC
Shoufan, A., Strenzke, F., Molter, H. G., & Stöttinger, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14423-3_12 · Cited by 67
Latif, R. M. A., Hussain, K., Jhanjhi, N. Z., Nayyar, A., & Rizwan, O. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-10087-1 · Cited by 118
RetractedShEF: shielded enclaves for cloud FPGAs
Zhao, M., Gao, M., & Kozyrakis, C. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3503222.3507733 · Cited by 77
“First, cryptography and cryptanalysis are constantly evolving; standards and best-practices constantly improve, especially as new computing paradigms such as quantum computing are introduced [25].”
BackgroundLightweight block ciphers for resource-constrained environments: A comprehensive survey
Zhong, Y. Q., & Gu, J. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.03.054 · Cited by 68
Meta: A Memory-Efficient Tri-Stage Polynomial Multiplication Accelerator Using 2D Coupled-BFUs
Xu, Y., Ding, L., He, P., Lu, Z., & Zhang, J. (2024) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2024.3461736 · Cited by 61
“Conventional public-key cryptosystems, such as rivest-shamir-adleman (RSA) and elliptic curve cryptography (ECC), are vulnerable to decryption by Shor’s algorithm in superpolynomial time [1], [2].”
Improvement and Efficient Implementation of a Lattice-Based Signature Scheme
Bansarkhani, R. E., & Buchmann, J. A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43414-7_3 · Cited by 60
A Timing Attack against the Secret Permutation in the McEliece PKC
Strenzke, F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_8 · Cited by 67
Quantum NETwork: from theory to practice
Fang, K., Zhao, J., Li, X., Li, Y., & Duan, R. (2023) · Science China Information Sciences · doi:10.1007/s11432-023-3773-4 · Cited by 67
List Decoding for Binary Goppa Codes
Bernstein, D. J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20901-7_4 · Cited by 59
Self-citationHorizontal side-channel vulnerabilities of post-quantum key exchange protocols
Aysu, A., Tobah, Y., Tiwari, M., Gerstlauer, A., & Orshansky, M. E. (2018) · IEEE International Symposium on Hardware Oriented Security and Trust (HOST) · doi:10.1109/hst.2018.8383894 · Cited by 64
Kumari, S., Singh, M., Singh, R., & Tewari, H. (2022) · Software Practice and Experience · doi:10.1002/spe.3121 · Cited by 74
“36 One of the main challenge involved in providing security to the connected devices is the resource constrained nature of the IoT environment.”
BackgroundThe Integration of the Internet of Things (IoT) Applications into 5G Networks: A Review and Analysis
Zreikat, A. I., Al-Arnaout, Z., Abadleh, A., Α, E. E., & Mostafa, N. (2025) · Computers · doi:10.3390/computers14070250 · Cited by 74
Anonymous, Zalcman, A., Gidney, C., Broughton, M., Khattar, T., Neven, H., Bergamaschi, T., Drake, J., & Boneh, D. (2026) · PRX Quantum · doi:10.1103/j3xf-bw18 · Cited by 68
New Results for Rank-Based Cryptography
Gaborit, P., Ruatta, O., Schrek, J., & Zémor, G. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06734-6_1 · Cited by 58
Lattice-based key exchange on small integer solution problem
Wang, S., Zhu, Y., Ma, D., & Feng, R. (2014) · Science China Information Sciences · doi:10.1007/s11432-014-5147-z · Cited by 66
Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
del Moral, J. O., iOlius, A. D., Vidal, G., Crespo, P. M., & Martinez, J. E. (2024) · arXiv · doi:10.48550/arxiv.2401.03780 · Cited by 57
Contemporary Quantum Computing Use Cases: Taxonomy, Review and Challenges
Singh, J., & Bhangu, K. S. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09809-5 · Cited by 66
“Researchers have identified different ways to provide functions of public-key encryption and public-key signatures [113].”
BackgroundA comprehensive survey on 6G-security: physical connection and service layers
Saeed, M. M. A., Saeed, R. A., Hasan, M. K., Ali, E. S., Mazha, T., Shahzad, T., Khan, S., & Hamam, H. (2025) · Discover Internet of Things · doi:10.1007/s43926-025-00123-7 · Cited by 66
Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers
Bard, G. V., Courtois, N. T., Nakahara, J., Sepehrdad, P., & Zhang, B. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17401-8_14 · Cited by 61
A Comparative Study of Post-Quantum Cryptosystems for Internet-of-Things Applications
Septien-Hernandez, J.-A., Arellano-Vázquez, M., Contreras-Cruz, M. A., & Ramirez‐Paredes, J. (2022) · Sensors · doi:10.3390/s22020489 · Cited by 55
“…create a quantum-resistant public-key cryptosystem, and considering the time it takes to deploy a new standard, the US National Institue of Standards (NIST) began a process in 2017 [11] to create a new standard for key exchange and digital signatures that could withstand quantum computer attacks.”
The Quantum Governance Stack: Models of Governance for Quantum Information Technologies
Perrier, E. (2022) · Digital Society · doi:10.1007/s44206-022-00019-x · Cited by 73
“Two significant impacts upon communication would include (i) the ability to decrypt certain classically encrypted information Gisin et al. (2002), Bernstein and Lange (2017), and (ii) the ability to encrypt data in a way which could not be (or would be unlikely to be) decrypted classically.”
BackgroundUnderstanding the Excess 1/f Noise in MOSFETs at Cryogenic Temperatures
Asanovski, R., Grill, A., Franco, J., Palestri, P., Beckers, A., Kaczer, B., & Selmi, L. (2023) · IEEE Transactions on Electron Devices · doi:10.1109/ted.2022.3233551 · Cited by 55
“Implementing a system with thousands of logical qubits would greatly advance fields such as cryptography, artificial intelligence, and physics simulations [2], [3],”
BackgroundA Scalable Implementation of Fully Homomorphic Encryption Built on NTRU
Rohloff, K. R., & Cousins, D. B. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44774-1_18 · Cited by 61
Data security in mobile cloud computing paradigm: a survey, taxonomy and open research issues
Bhatia, T., & Verma, A. K. (2017) · The Journal of Supercomputing · doi:10.1007/s11227-016-1945-y · Cited by 55
Isogeny-Based Quantum-Resistant Undeniable Signatures
Jao, D., & Soukharev, V. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_10 · Cited by 54
Hidden Shift Quantum Cryptanalysis and Implications
Bonnetain, X., & Naya‐Plasencia, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03326-2_19 · Cited by 67
Prototyping post-quantum and hybrid key exchange and authentication in TLS and SSH.Preprint
Crockett, E., Paquin, C., & Stebila, D. (2019) · IACR Cryptology ePrint Archive · Cited by 54
BUFFing signature schemes beyond unforgeability and the case of post-quantum signatures
Cremers, C. J. F., Düzlü, S., Fiedler, R., Fischlin, M., & Janson, C. (2021) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp40001.2021.00093 · Cited by 53
Securing Blockchain-Based IoT Systems: A Review
Commey, D., Mai, B., Hounsinou, S. G., & Crosby, G. V. (2024) · IEEE Access · doi:10.1109/access.2024.3428490 · Cited by 60
“For example, a BIoT system should use quantum-resistant cryptographic algorithms to ensure that even with future quantum computing capabilities, the system remains secure [156], [188], [189].”
MethodSecurity and Privacy Issues and Solutions for UAVs in B5G Networks: A Review
Khan, M. A., Kumar, N., Alsamhi, S. H., Barb, G., Żywiołek, J., Ullah, I., Noor, F., Shah, J. A., & Almuhaideb, A. M. (2024) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2024.3487265 · Cited by 66
“In response, PQC [144], [145], [146], [147] emerged as a critical field for developing quantum-proof algorithms.”
A new framework for computing Gröbner bases
Gao, S., Volny, F., & Wang, M. (2015) · Mathematics of Computation · doi:10.1090/mcom/2969 · Cited by 53
Practical Phase-Modulation Stabilization in Quantum Key Distribution via Machine Learning
Liu, J.-Y., Ding, H.-J., Zhang, C., Xie, S.-P., & Wang, Q. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.014059 · Cited by 60
“Quantum key distributions (QKD) [1–4] can provide information-theoretic secure keys between two communicated parties, usually called Alice and Bob, and has attracted extensive attention from the scientific world since the first BB84 protocol was proposed [2].”
BackgroundPradhan, A., Das, S., Piran, M. J., & Han, Z. (2024) · IEEE Access · doi:10.1109/access.2024.3429285 · Cited by 56
“…computing process helps to ensure reliable and low-latency communication in 6G. Thinking about HRLLC in 6G, post-quantum cryptography (PQC) is another emerging security enhancement technique that can provide secure communication to counter quantum-enabled security threats in the future [179].”
BackgroundHoque, S., Aydeger, A., & Zeydan, E. (2024) · doi:10.1145/3659997.3660033 · Cited by 51
“In terms of security level , both lattice-based and code-based algorithms provide a high level of security, i.e., they are resistant to attacks from both classical and quantum computers (see [5] for security foundations of these families).”
BackgroundOrsucci, D., Kleinpaß, P., Meister, J., Marco, I. D., Häusler, S., Strang, T., Walenta, N., & Moll, F. (2025) · International Journal of Satellite Communications and Networking · doi:10.1002/sat.1544 · Cited by 60
The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
Sendrier, N., & Simos, D. E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_14 · Cited by 50
Proof-of-Principle Demonstration of Passive Decoy-State Quantum Digital Signatures Over 200 km
Zhang, C., Zhou, X., Ding, H.-J., Zhang, C., Guo, G., & Wang, Q. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.10.034033 · Cited by 50
Hybrid quantum architecture for smart city security
Barletta, V. S., Caivano, D., Vincentiis, M. D., Pal, A., & Scalera, M. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112161 · Cited by 57
Kermani, M. M., Azarderakhsh, R., & Aghaie, A. (2016) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2930664 · Cited by 49
Threat Modeling and Risk Analysis for Miniaturized Wireless Biomedical Devices
Vakhter, V., Soysal, B., Schaumont, P. R., & Güler, Ü. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3144130 · Cited by 59
Efficient Elliptic Curve Diffie–Hellman Key Exchange for Resource-Constrained IoT Devices
Tanksale, V. (2024) · Electronics · doi:10.3390/electronics13183631 · Cited by 60
On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack
Sakumoto, K., Shirai, T., & Hiwatari, H. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25405-5_5 · Cited by 48
Ultra-long-haul digital coherent PSK Y-00 quantum stream cipher transmission system
Tanizawa, K., & Futami, F. (2021) · Optics Express · doi:10.1364/oe.418302 · Cited by 48
Yunakovsky, S. E., Kot, M., Pozhar, N. O., Nabokov, D., Kudinov, M., Guglya, A. P., Kiktenko, E. O., Kolycheva, E., Borisov, A., & Fedorov, A. K. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00104-z · Cited by 56
“However, not all existing security tools are vulnerable to attacks with quantum computers [7, 8].”
BackgroundEisenträger, K., Hallgren, S., & Lauter, K. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13051-4_11 · Cited by 67
Machine Learning in Chaos-Based Encryption: Theory, Implementations, and Applications
Hwang, J., Kale, G., Patel, P. P., Vishwakarma, R., Aliasgari, M., Hedayatipour, A., Rezaei, A., & Sayadi, H. (2023) · IEEE Access · doi:10.1109/access.2023.3331320 · Cited by 49
“On a theoretical level, Shor’s factoring algorithm [12] can solve the problems in polynomial time, and this heads toward a new area of cryptography, i.e., Post-Quantum Cryptography (PQC) [13] that aims to develop new algorithms and techniques that can resist attacks from quantum computers.”
BackgroundKong, I., Janssen, M., & Bharosa, N. (2023) · Government Information Quarterly · doi:10.1016/j.giq.2023.101884 · Cited by 53
“Due to backward compatibility and interoperability issues, a simple ‘drop-in method ’ of new QS algorithms may not be feasible in the existing infrastructures (Barker, Souppaya, & Newhouse, 2021; Bernstein & Lange, 2017; NIST, 2021).”
Wang, Y., & Ismail, E. S. (2025) · IEEE Access · doi:10.1109/access.2025.3584473 · Cited by 46
Sarkar, S., Shafaei, S., Jones, T., & Totaro, M. W. (2025) · Drones · doi:10.3390/drones9080583 · Cited by 58
Square, a New Multivariate Encryption Scheme
Clough, C., Baena, J. B., Ding, J., Yang, B., & Chen, M.-S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00862-7_17 · Cited by 46
Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing
Laarhoven, T., & de Weger, B. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8_6 · Cited by 59
“its presumed resistance against quantum attacks [8], the existence of lattice-based fully homomorphic encryption schemes [16], and efficient cryptographic primitives like NTRU [18] and LWE [39].”
BackgroundSecurity of Cloud FPGAs: A SurveyPreprint
Jin, C., Gohil, V., Karri, R., & Rajendran, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.04867 · Cited by 51
“These algorithms are the future direction of the cryptography for when quantum computers will be realized [22, 30].”
BackgroundZhang, Y., Tang, Y., Li, C., Zhang, H., & Ahmad, H. (2024) · Sensors · doi:10.3390/s24134188 · Cited by 49
“However, the development of quantum algorithms threatens current classical cryptographic algorithms-based IoT network applications [13].”
BackgroundAn Efficient Lattice Based Multi-stage Secret Sharing Scheme
Pilaram, H., & Eghlidos, T. (2015) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2015.2432800 · Cited by 53
Quantum Computing: Vision and Challenges
Gill, S. S., Cetinkaya, O., Marrone, S., Claudino, D., Haunschild, D., Schlote, L., Wu, H., Ottaviani, C., Liu, X., Machupalli, S. P., et al. (2025) · Quantum Computing · doi:10.1016/b978-0-443-29096-1.00008-8 · Cited by 44
A Lightweight Post-Quantum Lattice-Based RSA for Secure Communications
Mustafa, İ., Khan, I. U., Aslam, S., Sajid, A., Mohsin, S. M., Awais, M., & Qureshi, M. B. (2020) · IEEE Access · doi:10.1109/access.2020.2995801 · Cited by 50
“Such security primitives would become impotent with the advent of quantum computing [16].”
BackgroundTowards Side-Channel Resistant Implementations of QC-MDPC McEliece Encryption on Constrained Devices
von Maurich, I., & Güneysu, T. E. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_16 · Cited by 47
The Cubic Simple Matrix Encryption Scheme
Ding, J., Petzoldt, A., & Wang, L.-C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_5 · Cited by 43
Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
Löndahl, C., Johansson, T., Shooshtari, M. K., Ahmadian‐Attari, M., & Aref, M. R. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0099-x · Cited by 46
Provably Secure Code-Based Threshold Ring Signatures
Dallot, L., & Vergnaud, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10868-6_13 · Cited by 43
Abdul‐Al, M., Kyeremeh, G. K., Qahwaji, R., Ali, N. T., & Abd‐Alhameed, R. A. (2024) · IEEE Access · doi:10.1109/access.2024.3486552 · Cited by 43
“Research has investigated post-quantum cryptography, including lattice-based and code-based cryptography, as a potential method to provide quantum-resistant security in biometric systems [15].”
Practical Power Analysis Attacks on Software Implementations of McEliece
Heyse, S., Moradi, A., & Paar, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_9 · Cited by 42
A Detailed Relevance Analysis of Enabling Technologies for 6G Architectures
Pivoto, D. G. S., Rezende, T. T., Facina, M. S. P., Moreira, R., Silva, F. D. O., Cardoso, K. V., Corrêa, S. L., Araujo, A. V. D., Silva, W. R. S. E., Neto, H. S., et al. (2023) · IEEE Access · doi:10.1109/access.2023.3301811 · Cited by 49
“Post-quantum cryptography, for example, deals with encryption algorithms that are secure even under attack from a quantum computer [232].”
BackgroundMethodA Post-Quantum Compliant Authentication Scheme for IoT Healthcare Systems
Adeli, M., Bagheri, N., Maimani, H. R., Kumari, S., & Rodrigues, J. J. P. C. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3309931 · Cited by 41
“There are five primary classes of PQC algorithms: 1) lattice-based cryptography [6]; 2) code-based cryptography [7]; 3) multivariate-based cryptography [8]; 4) hash-based cryptography [9]; and 5) isogeny-based cryptography [10].”
BackgroundPerfect secrecy cryptography via mixing of chaotic waves in irreversible time-varying silicon chips
Falco, A. D., Mazzone, V., Cruz, A., & Fratalocchi, A. (2019) · Nature Communications · doi:10.1038/s41467-019-13740-y · Cited by 41
“While the progress of QKD in the past decades has been enormous 8 – 12 , there are still critical challenges derived by the limits of quantum communications 13 – 19 .”
BackgroundEfficient Implementations of MQPKS on Constrained Devices
Czypek, P., Heyse, S., & Thomae, E. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33027-8_22 · Cited by 41
A multivariate based threshold ring signature scheme
Petzoldt, A., Bulygin, S., & Buchmann, J. A. (2013) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-013-0190-3 · Cited by 40
Smart Health in the 6G Era: Bringing Security to Future Smart Health Services
Batista, E., López-Aguilar, P., & Solanas, A. (2023) · IEEE Communications Magazine · doi:10.1109/mcom.019.2300122 · Cited by 43
MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals
Mohamed, M. S. E., Cabarcas, D., Ding, J., Buchmann, J. A., & Bulygin, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14423-3_7 · Cited by 39
Forward Secure Signatures on Smart Cards
Hülsing, A., Busold, C., & Buchmann, J. A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35999-6_5 · Cited by 39
Analysis of the likelihood of quantum computing proliferation
Rosch-Grace, D., & Straub, J. (2022) · Technology in Society · doi:10.1016/j.techsoc.2022.101880 · Cited by 42
A comprehensive survey of cryptography key management systems
Rana, S., Parast, F. K., Kelly, B., Wang, Y., & Kent, K. B. (2023) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2023.103607 · Cited by 58
Lightweight and Fault-Resilient Implementations of Binary Ring-LWE for IoT Devices
Ebrahimi, S., & Bayat-Sarmadi, S. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2979318 · Cited by 43
Drozdowski, P., Stockhardt, F., Rathgeb, C., Osorio-Roig, D., & Busch, C. (2021) · IEEE Access · doi:10.1109/access.2021.3118830 · Cited by 42
Degree of Regularity for HFEv and HFEv-
Ding, J., & Yang, B. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_4 · Cited by 45
SCAR: Power Side-Channel Analysis at RTL Level
Srivastava, A., Das, S., Choudhury, N., Psiakis, R., Silva, P. H., Pal, D., & Basu, K. (2024) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2024.3390601 · Cited by 44
“GNNs have have become popular for analyzing and processing graph-structured data in a wide range of tasks, including node classification, link prediction and graph classification [14].”
BackgroundComprehensive Study of IoT Vulnerabilities and Countermeasures
Coston, I., Plotnizky, E., & Nojoumian, M. (2025) · Applied Sciences · doi:10.3390/app15063036 · Cited by 44
Blockchain-based reporting protocols as a collective monitoring mechanism in DAOs
Far, S. B., & Bamakan, S. M. H. (2022) · Data Science and Management · doi:10.1016/j.dsm.2022.03.002 · Cited by 36
Bellante, A., Fioravanti, T., Carminati, M., Zanero, S., & Luongo, A. (2025) · Computers & Security · doi:10.1016/j.cose.2025.104341 · Cited by 42
Bayğın, N., Aydemir, E., Barua, P. D., Bayğın, M., Doğan, Ş., Tuncer, T., Tan, R., & Acharya, U. R. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120306 · Cited by 36
Improved Lattice-Based Threshold Ring Signature Scheme
Bettaieb, S., & Schrek, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_3 · Cited by 35
Rigorous and Efficient Short Lattice Vectors Enumeration
Pujol, X., & Stehlé, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89255-7_24 · Cited by 36
High-performance and Configurable SW/HW Co-design of Post-quantum Signature CRYSTALS-Dilithium
Mao, G., Chen, D., Li, G., Dai, W., Sanka, A. I., Koç, Ç. K., & Cheung, R. C. C. (2022) · ACM Transactions on Reconfigurable Technology and Systems · doi:10.1145/3569456 · Cited by 34
“Post-quantum cryptography (PQC) is a term to describe the set of cryptographic algorithms that are secure against quantum attacks [7, 8].”
Artificial Intelligence and Intellectual Property: Navigating the Complexities of Cyber Law
Ubaydullaeva, A. (2023) · International Journal of Law and Policy · doi:10.59022/ijlp.57 · Cited by 34
PP-PQB: Privacy-Preserving in Post-Quantum Blockchain-Based Systems: A Systematization of Knowledge
Sezer, B. B., Akleylek, S., & Nuriyev, U. G. (2025) · IEEE Access · doi:10.1109/access.2025.3545943 · Cited by 47
“Post-quantum cryptography (PQC) is a cryptography based on the assumption of a quantum computer [15].”
Guidelines for establishing a 3-D printing biofabrication laboratory
Sanicola, H. W., Stewart, C. E., Müller, M., Ahmadi, F., Wang, D., Powell, S. K., Sarkar, K., Cutbush, K., Woodruff, M. A., & Brafman, D. A. (2020) · Biotechnology Advances · doi:10.1016/j.biotechadv.2020.107652 · Cited by 40
“Quantum computers will pose a greater security threat for cryptosystems when they become more common [228].”
Paul, S., Schick, F., & Seedorf, J. (2021) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3465481.3465747 · Cited by 37
“Current PQC schemes can be grouped into five families [6, 7]: 1) code-based, 2) lattice-based, 3) hash-based, 4) multivariate-based, and 5) supersingular elliptic-curve isogeny cryptography.”
BackgroundChaotic Encryption Using Hybrid Evolution Cellular Automata and 4D Modulation for Data Centers
Zeng, W., Zhang, C., Liang, X., Liu, J., Luo, Y., Yang, L., Wang, X., Cai, X., Wen, H., & Qiu, K. (2024) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2024.3476516 · Cited by 33
Spectral physical unclonable functions: downscaling randomness with multi-resonant hybrid particles
Sandomirskii, M., Petrova, E. A., Kustov, P., Chizhov, L., Larin, A. O., Bruyère, S., Yaroshenko, V. V., Игоревич, А. Э., Belov, P. A., & Zuev, D. A. (2025) · Nature Communications · doi:10.1038/s41467-025-60121-9 · Cited by 35
“The rapid innovation transfer from science to industry provides forgers with advanced tools to replicate anti-counterfeit measures 1 , while emerging quantum computing threatens the existing encryption protocols 2,3 .”
Two-Way Covert Quantum Communication in the Microwave Regime
Candia, R. D., Yiğitler, H., Paraoanu, G. S., & Jäntti, R. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020316 · Cited by 39
“The same level of security would be impossible to reach even in the most sophisticated known classical architectures, which rely on the current impossibility of solving efficiently specific problems, such as prime number factorization or finding the solution of systems of multivariate equations [6].”
BackgroundHigh-Speed Hardware Implementation of Rainbow Signature on FPGAs
Tang, S., Yi, H., Ding, J., Chen, H., & Chen, G. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25405-5_15 · Cited by 33
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.