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 301–400 of 1,003
Zhang, Y., Tang, Y., Li, C., Dong, M., Huang, M., Zhang, H., & Ota, K. (2024) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2024.3391419 · Cited by 22
“Now, there is a variety of PQC algorithms, such as lattice cryptography, fault-tolerant learning problems (LWE), multivariate cryptography, hashed cryptography, code-based cryptography, and hypersingular elliptic curve homology cryptography [22].”
BackgroundArea and Power Efficient FFT/IFFT Processor for FALCON Post-Quantum Cryptography
Alsuhli, G. H., Saleh, H. H., Al‐Qutayri, M., Mohammad, B. S., & Stouraitis, T. (2024) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2024.3407124 · Cited by 20
“Again, We use this processor as a showcase to use the detailed reported results in [15] 4 in this simplified analysis.”
Joshi, A., Bhalgat, P., Chavan, P. P., Chaudhari, T., & Patil, S. (2024) · Communications in computer and information science · doi:10.1007/978-981-97-9743-1_3 · Cited by 20
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge
Buchmann, J. A., Büscher, N., Göpfert, F., Katzenbeisser, S., Krämer, J., Micciancio, D., Siim, S., van Vredendaal, C., & Walter, M. (2016) · doi:10.1145/2898420.2898422 · Cited by 20
Using Low-Density Parity-Check codes to improve the McEliece cryptosystem
Branco, P. C., Mateus, P., Salema, C., & Souto, A. (2019) · Information Sciences · doi:10.1016/j.ins.2019.09.030 · Cited by 20
Post-Quantum Cryptography in Use: Empirical Analysis of the TLS Handshake Performance
Döring, R., & Geitz, M. (2022) · IEEE/IFIP Network Operations and Management Symposium (NOMS) · doi:10.1109/noms54207.2022.9789913 · Cited by 25
“…cryptography like Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC), the National Institute of Standards and Technology (NIST) is in the process of standardizing so-called Post-Quantum Cryptography (PQC), which is believed to be secure against future quantum computers [3].”
BackgroundA Code-Based Undeniable Signature Scheme
Melchor, C. A., Bettaieb, S., Gaborit, P., & Schrek, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-45239-0_7 · Cited by 20
Hardware design of an NTT-based polynomial multiplier
Renteria-Mejia, C. P., & Velasco-Medina, J. (2014) · Southern Conference on Programmable Logic (SPL) · doi:10.1109/spl.2014.7002209 · Cited by 20
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0002 · Cited by 20
A Hybrid Quantum-Classical Generative Adversarial Network for Near-Term Quantum Processors
Boyle, A. O., & Nikandish, G. (2024) · IEEE Access · doi:10.1109/access.2024.3433383 · Cited by 27
“…editor coordinating the review of this manuscript and approving it for publication was Tony Thomas. machine learning [1], [2], [3], [4], [5], [6], autonomous driving [7], drug discovery and healthcare [8], cryptography and secure communications [9], [10], teleportation [11], and the Internet [12].”
BackgroundLi, Q., Chen, F., Su, J., Yao, Y., Kang, J., Xie, F., Li, M., & Zhang, J. (2024) · Advanced Functional Materials · doi:10.1002/adfm.202416216 · Cited by 21
Enhanced Lightweight Quantum Key Distribution Protocol for Improved Efficiency and Security
Bhatia, A., Bitragunta, S., & Tiwari, K. (2025) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2025.3528718 · Cited by 21
“Anefficient approach for defending against quantum attacks is to use quantum-resistant cryptography, also known as post-quantum cryptography (PQC) [1].”
Faster Hash-Based Signatures with Bounded Leakage
Eisenbarth, T., von Maurich, I., & Ye, X. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43414-7_12 · Cited by 19
Quantum Computer: Hello, Music!
Miranda, E. R. (2021) · Springer eBooks · doi:10.1007/978-3-030-72116-9_34 · Cited by 19
The quantum threat to blockchain: summary and timeline analysis
Schärer, K., & Comuzzi, M. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00105-4 · Cited by 19
“Analyses of the comparative effectiveness of these different systems have been carried out in a general context by Bernstein and Lange (2017) and specifically about blockchain by Fernandez-Carames and Fraga-Lamas (2020).”
BackgroundBiomolecule-Driven Two-Factor Authentication Strategy for Access Control of Molecular Devices
Zhang, X., Liu, Y., Wang, B., Zhou, S., Shi, P., Cao, B., Zheng, Y., Zhang, Q., & Kasabov, N. K. (2023) · ACS Nano · doi:10.1021/acsnano.3c05070 · Cited by 23
Bhatia, A. S., Kais, S., & Alam, M. A. (2025) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2025.3596156 · Cited by 24
The Geometry of Lattice Cryptography
Micciancio, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23082-0_7 · Cited by 19
Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction
Ding, J., Kudo, M., Okumura, S., Takagi, T., & Tao, C. (2018) · Japan Journal of Industrial and Applied Mathematics · doi:10.1007/s13160-018-0316-x · Cited by 19
“Although various cryptosystems expected to be post-quantum cryptosystems (PQC) have been already constructed, see [7,11] for details, sizes of their public keys are large.”
BackgroundA quantum encryption design featuring confusion, diffusion, and mode of operation
Hu, Z., & Kais, S. (2021) · Scientific Reports · doi:10.1038/s41598-021-03241-8 · Cited by 19
“Equation (7) shows that by a single CNOT1→2 all q1 ’s dependences packaged in (a1, a2) are created on q2 .”
BackgroundQuantum Law: Navigating the Legal Challenges and Opportunities in the Age of Quantum Technologies
Gulyamov, S. S. (2023) · Uzbek journal of law and digital policy. · doi:10.59022/ujldp.54 · Cited by 19
Accelerating Lattice Reduction with FPGAs
Detrey, J., Hanrot, G., Pujol, X., & Stehlé, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14712-8_8 · Cited by 19
Quantum-Resistance in Blockchain Networks
López, M. A., León, D. L., Cerón, S., Batista, A. L., Pareja, A., da Silva, M. M., Pardo, A., Jones, D., Worrall, D., Merriman, B., et al. (2021) · doi:10.18235/0003313 · Cited by 20
Module-Lattice-Based Key-Encapsulation Mechanism Performance Measurements
Nagy, N., Alnemer, S., Alshuhail, L. M., Alobiad, H., Almulla, T., Alrumaihi, F. A., Ghadra, N., & Nagy, M. (2025) · Sci · doi:10.3390/sci7030091 · Cited by 19
The future of secure communications: Device independence in quantum key distribution
Ghoreishi, S. A., Scala, G., Renner, R., Tacca, L. L., Bouda, J., Walborn, S. P., & Pawłowski, M. (2025) · Physics Reports · doi:10.1016/j.physrep.2025.09.006 · Cited by 26
Quantum Computers’ threat on Current Cryptographic Measures and Possible Solutions
Niraula, T., Pokharel, A., Phuyal, A., Palikhel, P., & Pokharel, M. (2022) · International Journal of Wireless and Microwave Technologies · doi:10.5815/ijwmt.2022.05.02 · Cited by 18
Cybersecurity Issues and Challenges in Quantum Computing
Rahul, R., Geetha, S., Priyatharsini, S., Mehata, K. M., Perumal, T. S., Ethiraj, N., & Sendilvelan, S. (2024) · Wiley eBooks · doi:10.1002/9781394216147.ch11 · Cited by 21
Lightweight ASIP Design for Lattice-Based Post-quantum Cryptography Algorithms
Akçay, L., & Örs, B. (2024) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-024-08976-w · Cited by 18
“Due to the issue’s importance and urgency, conducted a comprehensive study describing the importance and mathematical background of PQC [11].”
IoT Forensics Readiness - influencing factors
Friedl, S., & Pernul, G. (2024) · Forensic Science International Digital Investigation · doi:10.1016/j.fsidi.2024.301768 · Cited by 18
Maganti, M. R., Mangamma, D., Suri, V. K., Swamy, S. V., Mohammad, A., & Shariff, V. (2024) · IEEE World Conference on Applied Intelligence and Computing (AIC) · doi:10.1109/aic61668.2024.10730910 · Cited by 18
“The calculation uses complex mistake-rectifying codes and multivariate quadratic conditions to develop a cryptosystem that opposes both traditional and quantum assaults [10,11].”
MethodReducing the Key Size of Rainbow Using Non-commutative Rings
Yasuda, T., Sakurai, K., & Takagi, T. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27954-6_5 · Cited by 19
Khan, M. F., Saleem, K., Alshara, M. A., & Bashir, S. (2021) · Scientific Reports · doi:10.1038/s41598-021-93344-z · Cited by 19
“where x ∈ GF(2) and x · X is the dot product of x and X , which is defined as:”
BackgroundA Secure Cell-Attachment Procedure of LDACS
Mäurer, N., Gräupl, T., Gentsch, C., Guggemos, T., Tiepelt, M., Schmitt, C., & Rodosek, G. D. (2021) · IEEE European Symposium on Security and Privacy Workshops (EuroS&PW) · doi:10.1109/eurospw54576.2021.00019 · Cited by 18
“…generation and verification, hence integrity and authenticity protection of messages, and AES-CCM for AEAD remains secure, also with the possible threat of quantum computers [41], on security Level 3-4 only the key establishment and signature algorithms are updated to post-quantum cryptography [41].”
BackgroundAdvances in Near‐Infrared Organic Micro/Nanolasers
Wu, J., Gao, H., Wang, X., Wu, Y., Jiang, L., & Liao, L. (2022) · Advanced Optical Materials · doi:10.1002/adom.202200815 · Cited by 18
He, P., Tu, Y., Xie, J., & Jacinto, H. S. (2023) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2023.3302289 · Cited by 18
Post-quantum cryptography: lattice signatures
Buchmann, J. A., Lindner, R., Rückert, M., & Schneider, M. (2009) · Computing · doi:10.1007/s00607-009-0042-y · Cited by 23
On the unique representation of very strong algebraic geometry codes
Márquez-Corbella, I., Martı́nez-Moro, E., & Pellikaan, R. (2012) · Designs Codes and Cryptography · doi:10.1007/s10623-012-9758-3 · Cited by 18
A Generalization of the Rainbow Band Separation Attack and its Applications to Multivariate Schemes.
Thomae, E. (2012) · Cited by 18
Quantum Key Distribution with Post-Processing Driven by Physical Unclonable Functions
Nikolopoulos, G. M., & Fischlin, M. (2024) · Applied Sciences · doi:10.3390/app14010464 · Cited by 17
Optimizing SIKE for blockchain-based IoT ecosystems with resource constraints
Ismail, N. A., Khadra, S. A., Attiya, G., & Abdulrahman, S. E. S. E. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-024-06906-z · Cited by 18
A Lightweight Public Verifiable Multi Secret Sharing Scheme Using Short Integer Solution
Dehkordi, M. H., & Ghasemi, R. (2016) · Wireless Personal Communications · doi:10.1007/s11277-016-3539-7 · Cited by 17
“Robustness of lattice based cryptography has made it to one of the nominees in post quantum cryptography [20].”
BackgroundQuantum Grover Attack on the Simplified-AES
Almazrooie, M., Abdullah, R., Samsudin, A., & Mutter, K. N. (2018) · International Conference on Software and Computer Applications (ICSCA) · doi:10.1145/3185089.3185122 · Cited by 21
Quantum amplitude-amplification operators
Kwon, H., & Bae, J. (2021) · Physical Review A · doi:10.1103/physreva.104.062438 · Cited by 26
Onuki, K., Cho, K., Horio, Y., & Miyano, T. (2022) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2022.3140762 · Cited by 18
FPGA Accelerated Post-Quantum Cryptography
Li, H., Tang, Y., Que, Z., & Zhang, J. (2022) · IEEE Transactions on Nanotechnology · doi:10.1109/tnano.2022.3217802 · Cited by 17
“Thisareaofresearchiscalledpost-quantumcryptogra-phy[1].”
MethodSecret Key Cryptosystem Based on Non-systematic Polar Codes
Hooshmand, R., Aref, M. R., & Eghlidos, T. (2015) · Wireless Personal Communications · doi:10.1007/s11277-015-2691-9 · Cited by 17
“Moreover, code based cryptosystems are considered as one of the important classes of cryptographic systems which are believed to resist quantum computers [7].”
BackgroundCode-Based Identification and Signature Schemes in Software
Alaoui, S. M. E. Y., Cayrel, P.-L., Bansarkhani, R. E., & Hoffmann, G. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40588-4_9 · Cited by 21
A Linear Algebra Attack on the Non-commuting Cryptography Class Based on Matrix Power Function
Liu, J., Zhang, H., & Jia, J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-54705-3_21 · Cited by 19
Khan, M. A., Noor, F., Javaid, S., & Żywiołek, J. (2025) · Discover Internet of Things · doi:10.1007/s43926-025-00238-x · Cited by 16
Post-Quantum Impacts on V2X Certificates – Already at The End of The Road
Yoshizawa, T., & Preneel, B. (2023) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2023-spring57618.2023.10199793 · Cited by 16
“industries, and academia to research and investigate alternative algorithms that can withstand against the threats and attacks using quantum computers [3].”
BackgroundAnti-Quantum Certificateless Group Authentication for Massive Accessing IoT Devices
Xu, P., Wu, H., Tao, X., Wang, C., Chen, D., & Nan, G. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3353807 · Cited by 17
“Under quantum attacks, traditional public key cryptography is not secure anymore while symmetric cryptography and hash function can still maintain a certain level of security [14].”
BackgroundqTrustNet Virtual Private Network (VPN): Enhancing Security in the Quantum Era
Shim, H., Kang, B., Im, H., Jeon, D., & Kim, S. (2025) · IEEE Access · doi:10.1109/access.2025.3530985 · Cited by 16
“In conclusion, the advent of quantum computing heralds a significant paradigm shift in cybersecurity [5], [6].”
A practical hybrid quantum-safe cryptographic scheme between data centers
Huang, L., Feng, K., & Xie, C. (2020) · Emerging Imaging and Sensing Technologies for Security and Defence; and Advanced Manufacturing Technologies for Micro- and Nanosystems in Security and Defence · doi:10.1117/12.2573558 · Cited by 16
“Post quantum cryptography (PQC), 10,11 on the other hand, is similar to classical cryptography that is algorithm-based, but believed to be able to withstand attacks from powerful quantum computers.”
BackgroundA Compact Full Hardware Implementation of PQC Algorithm NTRU
Qin, Z., Tong, R., Wu, X., Bai, G., Wu, L., & Su, L. (2021) · International Conference on Communications, Information System and Computer Engineering (CISCE) · doi:10.1109/cisce52179.2021.9446042 · Cited by 16
Tanizawa, K., & Futami, F. (2021) · Journal of Lightwave Technology · doi:10.1109/jlt.2021.3119603 · Cited by 16
Pipelined High-Throughput NTT Architecture for Lattice-Based Cryptography
Tan, W., Wang, A., Lao, Y., Zhang, X., & Parhi, K. K. (2021) · Asian Hardware Oriented Security and Trust Symposium (AsianHOST) · doi:10.1109/asianhost53231.2021.9699608 · Cited by 16
Parallel Small Polynomial Multiplication for Dilithium: A Faster Design and Implementation
Zheng, J., He, F., Shen, S., Xue, C., & Zhao, Y. (2022) · Annual Computer Security Applications Conference · doi:10.1145/3564625.3564629 · Cited by 16
Li, X., Pan, D., Long, G., & Hanzo, L. (2023) · IEEE Communications Letters · doi:10.1109/lcomm.2023.3247178 · Cited by 16
“using post-quantum cryptography [3], which relies on specific mathematical problems that cannot be efficiently solved by quantum computers.”
Fast Verification for Improved Versions of the UOV and Rainbow Signature Schemes
Petzoldt, A., Bulygin, S., & Buchmann, J. A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_13 · Cited by 16
Optimum commutative group codes
Torezzan, C., Strapasson, J. E., Costa, S. I. R., & de Siqueira, R. M. (2013) · Designs Codes and Cryptography · doi:10.1007/s10623-013-9867-7 · Cited by 16
Detecting Brute-Force Attacks on Cryptocurrency Wallets
Kiktenko, E. O., Kudinov, M., & Fedorov, A. K. (2019) · Lecture notes in business information processing · doi:10.1007/978-3-030-36691-9_20 · Cited by 18
Quantum cryptography and data protection for medical devices before and after they meet Q-Day
Freyer, O., Ostermann, M., Minssen, T., & Gilbert, S. (2025) · npj Digital Medicine · doi:10.1038/s41746-025-02082-3 · Cited by 16
Machine Learning Method with Applications in Hardware Security of Post-Quantum Cryptography
Yi, H. (2023) · Journal of Grid Computing · doi:10.1007/s10723-023-09643-4 · Cited by 16
Quantum Secure Undeniable Signature for Blockchain-Enabled Cold-Chain Logistics System
Li, C., Shen, H., Shi, X., & Liang, H. (2023) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2023.037796 · Cited by 15
A Comprehensive Analysis of Ecological Law in the Cyber Era
Dariyabayevichc, U. O. (2023) · International Journal of Law and Policy · doi:10.59022/ijlp.58 · Cited by 15
Post-Quantum Cryptography Research Landscape: A Scientometric Perspective
Sharma, P., Gupta, V., & Sood, S. K. (2023) · Journal of Computer Information Systems · doi:10.1080/08874417.2023.2260333 · Cited by 19
“7,8 PQC is the advanced cryptographic technique in the quantum world where encryption algorithms secure confidential data from quantum attacks.”
Manenti, R., & Motta, M. (2023) · doi:10.1093/oso/9780198787488.001.0001 · Cited by 29
Low latency FPGA implementation of NTT for Kyber
Saoudi, M., Kermiche, A., Benhaddad, O. H., Guetmi, N., & Allailou, B. (2024) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2024.105059 · Cited by 15
Phuc, N. T., & Ishizaki, A. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.064301 · Cited by 15
Creating a Challenge for Ideal Lattices.
Plantard, T., & Schneider, M. (2013) · Cited by 15
A prototype of quantum von Neumann architecture
Wang, D. (2022) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ac68d8 · Cited by 21
“The bit-string description of U can be encrypted by a quantum software vendor, and securely communicated using qubits (or even using the post-quantum encryption [56]).”
A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys
Ioannou, L. M., & Mosca, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25405-5_17 · Cited by 15
Open-Source FPGA Implementation of Post-Quantum Cryptographic Hardware Primitives
Agrawal, R., Bu, L., Ehret, A., & Kinsy, M. A. (2019) · International Conference on Field Programmable Logic and Applications (FPL) · doi:10.1109/fpl.2019.00040 · Cited by 18
Cheng, C.-M., Hashimoto, Y., Miura, H., & Takagi, T. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_3 · Cited by 15
Zero-Knowledge Protocols for the McEliece Encryption
Morozov, K., & Takagi, T. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31448-3_14 · Cited by 16
Tuning the Winternitz hash-based digital signature scheme
Perin, L. P., Zambonin, G., Martins, D. M. B., Custódio, R. F., & Martina, J. E. (2018) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2018.8538642 · Cited by 15
“According to [3], code-based cryptographic systems feature impractical key sizes, more security analysis on lattice-based signatures and multivariate”
BackgroundDigitalizing Inventory Systems with Quantum Blockchain and AI
Srinivas, D., Misra, N., Sharma, M., Dimri, A., Udayai, K., & Ahmad, V. (2025) · International Conference on Internet of Things: Smart Innovation and Usages (IoT-SIU) · doi:10.1109/iot-siu65919.2025.11402776 · Cited by 14
Review and analysis of classical algorithms and hash-based post-quantum algorithm
NOEL, M. D., Waziri, V. O., Abdulhamid, S. M., & Ojeniyi, J. A. (2021) · Journal of Reliable Intelligent Environments · doi:10.1007/s40860-021-00155-0 · Cited by 14
A Survey on Consensus Algorithms in Blockchain Based on Post Quantum Cryptosystems
Jose, J. M., & Panchami, V. (2022) · International Conference on Computational Intelligence and Networks (CINE) · doi:10.1109/cine56307.2022.10037353 · Cited by 14
“There are various initiatives for developing post quantum Blockchains going on as well [3].”
BackgroundLossless Data Hiding in NTRU Cryptosystem by Polynomial Encoding and Modulation
Wu, H., Cheung, Y., Tian, Z., Liu, D., Luo, X., & Hu, J. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3362592 · Cited by 14
“As demonstrated in Table I, the efficiency and resistance to quantum-computer attacks [49] makes the NTRU scheme attractive in public-key cryptography, which has been used in applications such as mobile devices and smart cards.”
BackgroundNanowires: Exponential speedup in quantum computing
Mimona, M. A., Mobarak, M. H., Ahmed, E., Kamal, F., & Hasan, M. (2024) · Heliyon · doi:10.1016/j.heliyon.2024.e31940 · Cited by 16
“Encryption decryption process in cryptography [204]. cryptography [201].”
BackgroundTransforming future technology with quantum-based IoT
Khan, H. U., Nasir, A., Ali, F., & Nazir, S. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06251-1 · Cited by 19
“The main problem of post-quantum cryptography is to meet the expectations of cryptographic accessibility and flexibility without compromising security [31].”
Secure and Efficient Cross-Modal Retrieval Over Encrypted Multimodal Data
Yang, L., Zhang, W., Miao, Y., Liang, Y., Li, X., Choo, K. R., & Deng, R. H. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3525614 · Cited by 15
“…algorithms such as Shor’s algorithm, can efficiently solve the difficult problem of discrete logarithm and factorization of large integer [10], [11], which are difficult for classical computers, threatening the security of public-key encryption algorithms that rely on this computational…”
Enhanced Scalability and Security in Blockchain-Based Transportation Systems for Mass Gatherings
Mutahhar, A., Khanzada, T. J. S., & Shahid, M. F. (2025) · Information · doi:10.3390/info16080641 · Cited by 17
SPHINCS+ post-quantum digital signature scheme with Streebog hash function
Kiktenko, E. O., Bulychev, A. A., Karagodin, P. A., Pozhar, N. O., Anufriev, M. N., & Fedorov, A. K. (2020) · AIP conference proceedings · doi:10.1063/5.0011441 · Cited by 14
Post-Quantum Cryptography in Embedded Systems
Marzougui, S., & Krämer, J. (2019) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3339252.3341475 · Cited by 16
Hosoyamada, A., & Yamakawa, T. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64837-4_1 · Cited by 20
Real-World Quantum-Resistant IPsec
Herzinger, D., Gazdag, S.-L., & Loebenberger, D. (2021) · International Conference on Security of Information and Networks (SIN) · doi:10.1109/sin54109.2021.9699255 · Cited by 14
“allow to break all currently prevalent asymmetric cryptography [4].”
BackgroundQuantum Search Approaches to Sampling-Based Motion Planning
Lathrop, P., Boardman, B., & Martínez, S. (2023) · IEEE Access · doi:10.1109/access.2023.3307316 · Cited by 16
“cryptography [10], [11], optimization [12], [13], and machine”
BackgroundPost-quantum Hybrid KEMTLS Performance in Simulated and Real Network Environments
Giron, A. A., do Nascimento, J. P. A., Custódio, R. F., Perin, L. P., & Mateu, V. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-44469-2_15 · Cited by 19
Challenges and Rewards of Implementing and Benchmarking Post-Quantum Cryptography in Hardware
Gaj, K. (2018) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3194554.3194615 · Cited by 14
Chen, X., Wang, K., Shi, B., Liu, T., Chen, R., Zhang, M., Wen, W., Xing, G., & Wu, J. (2021) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.1c08864 · Cited by 14
Chosen-ciphertext lattice-based public key encryption with equality test in standard model
Duong, D. H., Roy, P. S., Susilo, W., Fukushima, K., Kiyomoto, S., & Sipasseuth, A. (2021) · Theoretical Computer Science · doi:10.1016/j.tcs.2021.12.013 · Cited by 14
Verifiably Encrypted Signatures from RSA without NIZKs
Rückert, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10628-6_24 · Cited by 14
Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over $\mathbb{F}_2$
Buchmann, J. A., Cabarcas, D., Ding, J., & Mohamed, M. S. E. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12678-9_5 · Cited by 14
Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function
Koshiba, T., & Odaira, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10698-9_4 · Cited by 14
Zhu, D., & Guan, Y. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3623886 · Cited by 13
“Nevertheless, the above schemes rely on the conjectured hardness of the discrete logarithm or integer factorization problems, making them vulnerable to quantum attacks [15].”
Quantum Resistant Cryptographic Systems for Blockchain Network
Dharani, D., Soorya, R., & Kumari, K. A. (2023) · International Conference on Intelligent Technologies (CONIT) · doi:10.1109/conit59222.2023.10205646 · Cited by 13
“Unlike post-quantum security, here a quantum adversary may interact quantumly with the systems [4].”
BackgroundPhotonic-Assisted Secure Millimeter Wave Communication With Quantum Noise Randomized Stream Cipher
Tanizawa, K., & Futami, F. (2024) · Journal of Lightwave Technology · doi:10.1109/jlt.2024.3387431 · Cited by 13
Advanced Persistent Threats (APTs): Detection Techniques and Mitigation Strategies
Malik, V., Khanna, A., Sharma, N., & Nalluri, S. (2024) · International Journal of Global Innovations and Solutions (IJGIS) · doi:10.21428/e90189c8.91e89a3e · Cited by 13
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.