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 701–800 of 1,003
Pióro, Ł., Kanciak, K., & Zieliński, Z. (2026) · Electronics · doi:10.3390/electronics15030697 · Cited by 3
“The emergence of practical quantum computing poses a catastrophic threat to widely used public key cryptographic algorithms, such as RSA and ECC [30].”
Algorithm-Empowered Photocontrolled DNA Origami Nanostructures for Information Encryption
Sun, M., Kou, B., Xie, M., Zhang, B., Ding, Y., Wang, L., Fan, C., & Chao, J. (2026) · Journal of the American Chemical Society · doi:10.1021/jacs.5c19690 · Cited by 3
Okafor, C. I., Ahakonye, L. A. C., Kim, D., & Lee, J. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3686364 · Cited by 3
“Furthermore, the advent of large-scale, fault-tolerant quantum computers poses an existential threat to currently deployed public-key cryptography, including RSA and elliptic curve cryptography (ECC), which underpin most secure communication protocols today [16], [18], [19].”
Practical quantum key distribution networks: a mini-review
Tippmann, M., Kaltwasser, J., Mengler, M., Liebmann, T., & Walther, T. (2026) · The European Physical Journal Special Topics · doi:10.1140/epjs/s11734-026-02316-9 · Cited by 3
A 1.96mm2 low-latency multi-mode crypto-coprocessor for PKC-based IoT security protocols
Tsai, C.-R., Hsiao, M.-C., Shen, W.-C., Wu, A.-Y. A., & Cheng, C.-M. (2015) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2015.7168763 · Cited by 3
Strenzke, F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17650-0_4 · Cited by 3
Pankov, K. N., & Глухов, М. М. (2023) · Systems of Signals Generating and Processing in the Field of on Board Communications · doi:10.1109/ieeeconf56737.2023.10092118 · Cited by 3
“C ONCLUSION Since, according to [2], the use of quantum-resistant algorithms is the primary way to guarantee the information security of the IoT and on-board systems in the presence of a quantum hazard, the task of studying such algorithms continues to be relevant.”
BackgroundMethodInfluentialImplementing CRYSTALS Kyber and Dilithium in Intel SGX Secure Enclaves
Pratiwi, N., Firmansyah, M., & Ezerman, M. F. (2023) · IEEE International Conference on Cryptography, Informatics, and Cybersecurity (ICoCICs) · doi:10.1109/icocics58778.2023.10277539 · Cited by 3
“More details have been given, e.g. , by Chen and Moody in [6], by Bernstein and Lange in [4], and by Moody and Robinson in [7].”
BackgroundMethodOn Accuracy of Testing Decryption Failure Rate for Encryption Schemes under the LWE Assumption
Wang, L., Wang, Y., & Jia, H. (2024) · IET Information Security · doi:10.1049/2024/2786399 · Cited by 3
“Much research has been carried out to construct robust cryptography in the quantum era, referring to a survey [9].”
BackgroundCan, F., Üstün, A., Örs, B., Alaybeyoğlu, E., & Savaş, E. (2024) · Panhellenic Conference on Electronics & Telecommunications (PACET) · doi:10.1109/pacet60398.2024.10497033 · Cited by 3
“The National Institute of Standards and Technology (NIST) and other crypto research groups play a pivotal role in stan-dardizing PQC algorithms [5].”
BackgroundA Matrix Multiplication Approach to Quantum-Safe Cryptographic Systems
Lizama-Pérez, L. A. (2024) · Cryptography · doi:10.3390/cryptography8040056 · Cited by 3
Cloud-based semi-quantum money
Zhang, Y., Jin, S., Huang, Y., Zeng, B., & Shao, Q. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04669-x · Cited by 3
PQS-BC: Comparative Analysis of NIST Post-quantum Signatures for Blockchain
Wong, W. K., Dong, N., & Dinh, C. M. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-3531-3_17 · Cited by 4
Data Encryption for the TLS Protocol Against Quantum Adversaries
Giron, A. A. (2025) · Engineering cyber-physical systems and critical infrastructures · doi:10.1007/978-3-031-83149-2_4 · Cited by 3
Challenge Response Protocol using Multivariate Polynomial Cryptography
Jaiswal, C. K., Sharma, A., & Chaturvedi, A. (2025) · IEEE International Students' Conference on Electrical, Electronics and Computer Science (SCEECS) · doi:10.1109/sceecs64059.2025.10940858 · Cited by 3
Quantum-Ready Mobile Communications: Cryptographic Agility for Mobile Networks in the Quantum Era
Sanon, S. P., & Schotten, H. D. (2025) · IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) · doi:10.1109/wowmom65615.2025.00056 · Cited by 3
“As quantum computing draws closer to becoming a reality, the transition to Post-Quantum Cryptographic (PQC) algorithms, designed to resist quantum attacks, has become an urgent necessity [3].”
Post-Quantum and Blockchain-Based Attestation for Trusted FPGAs in B5G Networks
Papalamprou, I., Fotos, N., Chatzivasileiadis, N., Angelogianni, A., Masouros, D., & Soudris, D. (2025) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas56072.2025.11043710 · Cited by 3
“If quantum computers achieve their anticipated performance, they could potentially break widely used cryptographic algorithms such as the Rivest-Shamir-Adleman (RSA) system and Elliptic Curve Cryptography (ECC) schemes [13], both of which underpin many secure configuration mechanisms today.”
Authentication scheme resistant to machine learning based on obfuscation of multiple PUF responses
Ni, T., Wu, H., Li, F., Nie, M., Liu, Y., Hu, A., & Bian, J. (2025) · Microelectronics Journal · doi:10.1016/j.mejo.2025.106867 · Cited by 4
Kamiura, Y., Iwamoto, S., Mikami, Y., & Kato, K. (2025) · Electronics · doi:10.3390/electronics14193762 · Cited by 5
Code-Based Public-Key Encryption Resistant to Key Leakage
Persichetti, E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40588-4_4 · Cited by 3
Formal Verification of NTRUEncrypt Scheme
Moghissi, G. R., & Payandeh, A. (2016) · International Journal of Computer Network and Information Security · doi:10.5815/ijcnis.2016.04.06 · Cited by 3
“the above condition and every values of , ( ) become 0 (although lower bound not mentioned in the [2], the proof not be affected for other more exact bounds of from valid references, since in this proof, the selected parameter set be assumed with lowest effect on the proof process).”
BackgroundMethodInfluentialKey-Establishment Protocols for Constrained Cyber-Physical Systems
Lara-Nino, C. A., Díaz-Pérez, A., & Morales‐Sandoval, M. (2021) · Studies in systems, decision and control · doi:10.1007/978-3-030-67361-1_2 · Cited by 3
Quantum Secure Multiparty Computation of Phylogenetic Trees of SARS-CoV-2 Genome
Santos, M. B., Gomes, A. C., Pinto, A. N., & Mateus, P. (2021) · Telecoms Conference (ConfTELE) · doi:10.1109/conftele50222.2021.9435479 · Cited by 3
“From a security perspective, it is important to note that most symmetric encryption schemes are believed to be secure against quantum attacks [15], [16] and, in particular, the information-theoretic one-time pad has perfect security against any computationally unbounded adversary.”
BackgroundDecoding of (Interleaved) Generalized Goppa Codes
Liu, H., Pircher, S., Zeh, A., & Wachter-Zeh, A. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517785 · Cited by 3
Mielke, D. M., Mäurer, N., Gräupl, T., & Bellido-Manganell, M. A. (2021) · Digitale Welt · doi:10.1007/s42354-021-0401-1 · Cited by 3
Tightly Secure PKE Combiner in the Quantum Random Oracle Model
Goncalves, B., & Mashatan, A. (2022) · Cryptography · doi:10.3390/cryptography6020015 · Cited by 3
Quantum Guess and Determine Attack on Stream Ciphers
Ding, L., Wu, Z., Zhang, G., & Shi, T. (2022) · The Computer Journal · doi:10.1093/comjnl/bxac174 · Cited by 3
Routing Performance Based On Software Defined Quantum Key Distribution Network
Monita, V., Munadi, R., & Irawati, I. D. (2022) · IEEE Asia Pacific Conference on Wireless and Mobile (APWiMob) · doi:10.1109/apwimob56856.2022.10014161 · Cited by 3
“Since the crypto-system consists of code-based, latticebased, and multivariate systems that are secure against attacks, the post-quantum channel requires compatibility with [4].”
BackgroundKey-Recovery by Side-Channel Information on the Matrix-Vector Product in Code-Based Cryptosystems
Seck, B., Cayrel, P.-L., Diop, I., Drăgoi, V., Couzon, K., Colombier, B., & Grosso, V. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-29371-9_11 · Cited by 3
Barbeau, M. (2023) · F1000Research · doi:10.12688/f1000research.140027.1 · Cited by 3
Raikwar, M., & Wu, S. (2023) · Advances in information security · doi:10.1007/978-3-031-32146-7_2 · Cited by 3
Samunnisa, K., Gaddam, S. V. K., & Madhavi, K. R. (2024) · International Journal of Electrical and Electronics Engineering · doi:10.14445/23488379/ijeee-v11i7p101 · Cited by 3
“Bernstein et al. (2009) [7] provide a comprehensive overview of post-quantum cryptographic methods in their edited volume “Post-Quantum Cryptography.””
Design of Technology for Secure File Storage Based on Hybrid Cryptography Methods: Short Overview
Abitova, G., Manap, A., Kulniyaziva, K., & Nikulin, V. V. (2024) · IEEE International Conference on Smart Information Systems and Technologies (SIST) · doi:10.1109/sist61555.2024.10629334 · Cited by 3
“The paper examines various post-quantum cryptographic algorithms and discusses their potential applications and challenges [4].”
BackgroundCoding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information
Tarnopolsky, S., & Cohen, A. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619109 · Cited by 3
“We aim to ensure: 1) reliable communication between Alice and Bob, 2) information-theoretic security against IT-Eve, and 3) PQ computational cryptographic security against Crypto-Eve [4].”
A perspective on quantum Fintech
Fiore, U., Gioia, F., & Zanetti, P. (2024) · Decisions in Economics and Finance · doi:10.1007/s10203-024-00497-3 · Cited by 3
Architectural Tradeoffs for Long Polynomial Modular Multiplication
Chiu, S.-W., & Parhi, K. K. (2024) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf60004.2024.10942651 · Cited by 3
“The significance of Ring-LWE lies in its resistance to attacks from both classical and quantum computers, making it a crucial component in the emerging field of post-quantum cryptography [2].”
Lattice-Based Post Quantum Cryptography Using Variations of Learning with Error (LWE)
Shah, P. D., Prajapati, P., & Patel, D. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-88039-1_5 · Cited by 3
Cryptanalysis of two post-quantum authenticated key agreement protocols
Abri, M., & Mala, H. (2025) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-025-00557-1 · Cited by 3
“Post-quantumcryptographyrefers tocryptographicsystemsthatremainsecureevenifanattacker possessesaquantumcomputer[3].”
Extensible Post Quantum Cryptography-Based Authentication
Riva-Cambrin, H. A., Singh, R., Lama, S., & Sutherland, G. R. (2026) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2026.3705933 · Cited by 5
“Classical cryptographic methods that secure these networks, such as elliptic curve cryptography [10] and RSA, are threatened [7], [11] as they can be broken with Shor’s algorithm [12].”
A Security Analysis of Uniformly-Layered Rainbow
Yasuda, T., & Sakurai, K. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25405-5_18 · Cited by 3
Statistical Decoding of Codes over $\mathbb{F}_q$
Niebuhr, R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25405-5_14 · Cited by 3
Identity Based Threshold Ring Signature from Lattices
Wei, B., Du, Y., Zhang, H., Zhang, F., Tian, H., & Gao, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11698-3_18 · Cited by 3
An Open-Source, Efficient, and Parameterizable Hardware Implementation of the AES Algorithm
Nacci, A. A., Rana, V., Sciuto, D., & Santambrogio, M. D. (2014) · IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) · doi:10.1109/ispa.2014.20 · Cited by 3
Peretz, Y. (2016) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2016.01.002 · Cited by 3
How to implement the public Key Operations in Code-based Cryptography on Memory-constrained Devices.
Strenzke, F. (2010) · Cited by 3
Cryptanalysis of an ElGamal-Like Cryptosystem Based on Matrices Over Group Rings
Jia, J., Wang, H., Zhang, H., Wang, S., & Liu, J. (2019) · Communications in computer and information science · doi:10.1007/978-981-13-5913-2_16 · Cited by 3
Weaknesses in Two RFID Authentication Protocols
Chikouche, N., Cherif, F., Cayrel, P.-L., & Benmohammed, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-18681-8_13 · Cited by 3
Instruction Extension of an Open Source RV32IMC Core for NTRU Cryptosystem
Isman, E. N., Topal, C., Akçay, L., & Örs, B. (2020) · European Conference on Circuit Theory and Design · doi:10.1109/ecctd49232.2020.9218372 · Cited by 3
“For this reason, post-quantum cryptography algorithms are developed [4].”
MethodZavala, M., & Baran, B. (2021) · Latin American Computer Conference (CLEI) · doi:10.1109/clei53233.2021.9639932 · Cited by 4
Analysis of Adversarial Jamming From a Quantum Game Theoretic Perspective
Borah, S. K., Anand, S., Agarwal, R. V., & Bitragunta, S. (2022) · IEEE Systems Journal · doi:10.1109/jsyst.2022.3184297 · Cited by 3
“Such cryptographic schemes make use of quantum superposition to guarantee privacy and security in a postquantum world [10].”
BackgroundAttacking and Defending Code-based Cryptosystems
Niebuhr, R. (2012) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00003031 · Cited by 7
Efficiency and Implementation Security of Code-based Cryptosystems
Strenzke, F. (2013) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00003690 · Cited by 3
Breaking the Unbreakable: Exploiting Loopholes in Bell’s Theorem to Hack Quantum Cryptography
Jogenfors, J. (2017) · doi:10.3384/diss.diva-140912 · Cited by 3
LLL and stochastic sandpile modelsPreprint
Ding, J., Kim, S., Takagi, T., & Wang, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.03285 · Cited by 3
ARXIV-PQC-ALGEBRAIC EXTENSION RING v3 (IEEE)Preprint
Hecht, P. (2020) · arXiv (Cornell University) · doi:10.13140/rg.2.2.34977.84329 · Cited by 3
Two-way covert quantum communication in the microwave regimePreprint
Candia, R. D., Yiğitler, H., Paraoanu, G. S., & Jäntti, R. (2020) · doi:10.21203/rs.3.rs-93750/v1 · Cited by 3
DeFi Security: Turning The Weakest Link Into The Strongest AttractionPreprint
Kashyap, R. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4528793 · Cited by 4
Motion Planning Algorithms for Safety and Quantum Computing Efficiency
Lathrop, P., & (NNSA), U. N. N. S. A. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2229652 · Cited by 3
The Impact of Quantum Computing on Present CryptographyPreprint
Gangwar, S., Pachnanda, V., & Pundir, T. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5017957 · Cited by 3
Ethical Challenges in the Current Digital Landscape: AI, Robotics and Quantum ComputingPreprint
Luís-Ferreira, F., & Loureiro-Rodrigues, C. (2025) · Preprints.org · doi:10.20944/preprints202505.0507.v1 · Cited by 4
Post-quantum XML and SAML Single Sign-On
Müller, J., & Oupický, J. (2024) · Proceedings on Privacy Enhancing Technologies · doi:10.56553/popets-2024-0128 · Cited by 2
“These algorithms are referred to as post-quantum [8].”
BackgroundDESIGN OF TECHNOLOGY FOR SECURE FILE STORAGE BASED ON HYBRID CRYPTOGRAPHY METHODS: SHORT OVERVIEW
Manap, A., Abitova, G., Uskenbayeva, G., & Shaikhanova, A. K. (2023) · Вестник КазАТК · doi:10.52167/1609-1817-2023-129-6-205-215 · Cited by 2
Quantum Computing: Predictions and Challenges
Kulik, S. P. (2023) · Bulletin of the Lebedev Physics Institute · doi:10.3103/s1068335623602273 · Cited by 2
The Legal Frontier of E-sports: Analyzing Regulatory Challenges and Solutions in the Cyber-Arena
Sanat, E. (2023) · Uzbek journal of law and digital policy. · doi:10.59022/ujldp.76 · Cited by 2
Hybrid Post-Quantum Cryptography in Network Protocols
Giron, A. A., & Custódio, R. F. (2024) · Simpósio Brasileiro de Cibersegurança (SBSeg) · doi:10.5753/sbseg_estendido.2024.241384 · Cited by 2
Breakthrough Solutions for Post-Quantum Security with QC-MDPC Codes
Latif, M. (2024) · IEEE Women in Technology Conference (WINTECHCON) · doi:10.1109/wintechcon61988.2024.10838010 · Cited by 2
“PKC is an encryption technique which incorporates two distinct keys: a public key and a private key for encryption and decryption [1].”
Ansari, N. M., Tariq, T., Iqbal, R., Abbas, A., Abbas, H., & Zohaib, M. M. (2025) · Kashf Journal of Multidisciplinary Research · doi:10.71146/kjmr259 · Cited by 4
Testing the Impact of Encryption on Network Performance
Singh, A. P. (2022) · INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT · doi:10.55041/ijsrem16483 · Cited by 2
Neutral atom quantum computers for the applications in condensed matter physics
Shweta, Kaur, I., Singh, N., Kanjilal, S., & Santra, B. (2025) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/adbb9b · Cited by 3
“The threat posed by Shor’s algorithm is driving research into post quantum cryptography—cryptographic algorithms designed to resist both classical and quantum attacks [12].”
Schmidt, M., Kole, A., Wichette, L., Drechsler, R., Kirchner, F., & Mounzer, E. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3610800 · Cited by 2
“Shor’s algorithm [1] offers an exponential speedup for integer factorization, presenting a substantial threat to RSA-based cryptographic security [2], [3], [4], [5].”
Balancing Quantum and Classical Security: Side-Channel Challenges in NIST PQC Finalist
Thenmozhi, A., & Usha, G. (2025) · International Conference on Sustainable Computing and Data Communication Systems (ICSCDS) · doi:10.1109/icscds65426.2025.11167157 · Cited by 3
“NIST specifies five security categories, and encompasses a number of other properties which are desirable (e.g., resistance against side-channel, multi-key attacks) [13].”
Modern Quantum Computing: Languages, Simulators, Architectures and Future Directions
Karhan, D., Çimen, S., & Güllü, M. (2025) · International Conference on Artificial Intelligence, Computer, Data Sciences and Applications (ACDSA) · doi:10.1109/acdsa65407.2025.11165857 · Cited by 2
“The prospective threat posed by QCs executing Shor’s algorithm against contemporary cryptographic systems has necessitated the development and standardization of quantum-resistant cryptography (QRC) algorithms [75].”
Quantum-Resistant Cryptography for Military Communications
Sachin, U., Gudodagi, R., & Madan, H. T. (2025) · IEEE Space, Aerospace and Defence Conference (SPACE) · doi:10.1109/space65882.2025.11170996 · Cited by 2
Benchmarking Quantum Solvers in Noisy Digital Simulations for Financial Portfolio Optimization
Shen, R., Hao, Z., & Lee, C. H. (2026) · Entropy · doi:10.3390/e28080916 · Cited by 4
Quantum-Resistant Cryptographic Architecture for Secure Payments and IoT-Driven Banking Ecosystems
Tumma, C., Ayyamgari, S., Sannapu, R., Sribhashyam, A. S., & Kadari, S. (2025) · Conference of Open Innovations Association (FRUCT) · doi:10.23919/fruct67853.2025.11239185 · Cited by 2
SRAM based Gaussian noise generation for post quantum cryptography
Kim, M., Jeon, S., & Kim, S. (2025) · Scientific Reports · doi:10.1038/s41598-025-27929-3 · Cited by 2
Cryptanalysis of a LINE cryptosystem
Khalimov, G., Kotukh, Y. V., Khalimova, S., Korobchynskyi, M., Podlipaiev, V., & Зайцев, О. (2025) · International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME) · doi:10.1109/iceccme64568.2025.11277439 · Cited by 2
“…primitives are considered quantum-safe, including code-based encryption schemes like McEliece [14] and lattice-based systems such as NTRU [15,16], these alternatives, despite their resilience to both classical and quantum attacks, present significant challenges in terms of efficiency and…”
A security-enhanced three-party authentication and key agreement scheme for smart grid communication
Yuan, Q., He, Z., Cheng, X., Xia, Y., & Shao, Y. (2025) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2025.104254 · Cited by 2
Lattice-based homomorphic encryption for distributed privacy protection
Zhao, Z., Zhang, C., Liu, Z., Jiang, L., Li, P., & Zhang, F. (2025) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2025.108223 · Cited by 2
Mishra, D., & Sharma, R. R. (2025) · Computer Science Review · doi:10.1016/j.cosrev.2025.100865 · Cited by 3
D’Onghia, G., & Lioy, A. (2025) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc65549.2025.11326490 · Cited by 6
“The best-known quantum attack does not significantly improve over the classical birthday attack, which halves the security strength [19].”
Li, J., Lei, H., Luo, X., Zhang, L., Shen, P., Huang, T., & Cheng, J. (2026) · Information Processing & Management · doi:10.1016/j.ipm.2026.104652 · Cited by 2
Quantum-Secure Privacy-Preserving Profile Matching for Proximity-Based Mobile Social Networks
Huang, X., Zhang, W., Zhang, S., & Khan, M. K. (2026) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2026.3666093 · Cited by 2
“Significant research focus has shifted to post-quantum cryptography (PQC) [31] and quantum cryptography.”
TTEA: designing a quantum-ready and energy-conscious encryption model for secure IoT environments
Abdelaal, M. A., Moustafa, A. I., Saleh, H., & Afifi, M. Y. I. (2026) · Scientific Reports · doi:10.1038/s41598-026-36998-x · Cited by 2
“To maintain robust security margins in the face of such quantum advancements, it suffices to double the secret key length; for example, adopting 256-bit keys is considered an adequate precaution 14 .”
Ishchukova, E., Sajadi, F. S., Petrenko, S., Petrenko, A., & Nekrasov, A. (2026) · Computers · doi:10.3390/computers15080495 · Cited by 4
Горбенко, І. Д., Качко, О. Г., Oleksijchuk, O. M., Kuznetsov, A. A., Gorbenko, Y. I., Onoprienko, V. V., Yesina, M. V., & Kandii, S. (2019) · Radiotekhnika · doi:10.30837/rt.2019.3.198.01 · Cited by 3
Code-based Pseudorandom Generator for the Post-Quantum Period
Kuznetsov, A. A., Кіян, А., Gorbenko, Y., Smirnov, O. A., Череп, О., & Bekhter, L. (2019) · IEEE International Conference on Advanced Trends in Information Theory (ATIT) · doi:10.1109/atit49449.2019.9030493 · Cited by 57
“An important direction in the development of postquantum methods of information protection is a code-based cryptography [1-12].”
BackgroundCommitment schemes and diophantine equations
AAAVoloch, J. F. (2020) · The Open Book Series · doi:10.2140/obs.2020.4.1 · Cited by 2
Improved Multi-party Quantum Key Agreement with Four-qubit Cluster States
Abulkasim, H., Alabdulkreem, E. A., & Hamad, S. H. (2022) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2022.025727 · Cited by 2
Leveraging the hardness of dihedral coset problem for quantum cryptography
Yan, X., Gu, L., Suo, J., & Wang, L. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03592-9 · Cited by 2
“…the most significant branches of post-quantum mechanisms are quantum cryptography (QC) [1–4] based on the principles of quantum physics, and post-quantum cryptography (PQC) [5–7] based on the presumed post-quantum hardness of hard mathematical problems, especially for lattice-based cryptography [8].”
BackgroundDesign and Implementation of Intelligent Key Cryptography using Time and Tamil Unicode
Rojasree, V., & Jayanthi, J. G. (2023) · Indian Journal of Science and Technology · doi:10.17485/ijst/v16i2.1917 · Cited by 2
VPN Protection with QKD-Derived Keys Using Standard Interfaces
Buruaga, J. S., Brunner, H. H., Fung, F., Peev, M., Pastor, A., Lopez, D. R., Ortíz, L., Martín, V., & Brito, J. P. (2023) · International Conference on Transparent Optical Networks · doi:10.1109/icton59386.2023.10207212 · Cited by 2
“It implements classical key exchange and digital signature mechanisms resistant to Shor’s algorithm [14], [15].”
MethodA Stable Hash Function Based on Parity-Dependent Quantum Walks With Memory (August 2023)
Zhou, Q., Tang, X., Lu, S., & Yang, H. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3368073 · Cited by 2
High-security multi-constellation shaping modulation with asymmetric encryption
Jiang, L., Liu, B., Ren, J., Wu, X., Ullah, R., Mao, Y., Chen, S., Ma, Y., Zhao, L., & Tian, F. (2024) · Chinese Optics Letters · doi:10.3788/col202422.040602 · Cited by 2
Software defined networking flow admission and routing under minimal security constraints
López, J., Chatzinakis, C., Cartigny, M., & Poletti, C. (2023) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom60117.2023.00368 · Cited by 2
“PQC is considered to be an end-to-end encryption scheme [3], [4], however, PQC can be used in a per-link encapsulation basis, specially for transit networks, operators, or meta-operators.”
BackgroundMethodVehicular Communication and Networking Technologies
Lu, S., & Shi, W. (2024) · Springer eBooks · doi:10.1007/978-3-031-59963-7_3 · Cited by 4
Muga, N. J., Mantey, S. T., Cruz, D., Rocha, A. M., Silva, N. A., Fernandes, M. A., Fernandes, G. M., Guiomar, F. P., Monteiro, P. P., & Pinto, A. N. (2024) · International Conference on Transparent Optical Networks · doi:10.1109/icton62926.2024.10647645 · Cited by 2
“In this context, QKD is an essential element of the future quantum-safe communication infrastructure (fiber and free space optics), comprising both quantum-resistant classical algorithms [12], and quantum cryptography [13].”
BackgroundNew Paradigm For Fiber Optics Communication
Laurent, V., Deogun, J. S., & Alexander, D. R. (2024) · International Conference on Communications · doi:10.1109/icc51166.2024.10622260 · Cited by 2
“In a broader context, post-quantum cryptography presents a versatile solution to mitigate threats [32].”
BackgroundGulyamov, S. S., & Abdikhakimov, I. (2024) · jurisprudence · doi:10.51788/tsul.jurisprudence.4.2./xotj9919 · Cited by 2
Mem‐Transistor‐Based Gaussian Error–Generating Hardware for Post‐Quantum Cryptography Applications
Kim, M., Rehman, S., Khan, M. F., & Kim, S. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400394 · Cited by 2
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.