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 801–900 of 1,003
Häusler, S., Schümann, F., Vollmann, L., Orsucci, D., Godin, P. J., Kuntz, K. B., Bayat, N., Jennewein, T. D., & Moll, F. (2024) · Environmental Effects on Light Propagation and Adaptive Systems · doi:10.1117/12.3033670 · Cited by 2
Development of Quantum Safe Polynomial‐Based Cryptography in Classical and Quantum Framework
Hasija, T., Ramkumar, K. R., & Singh, B. (2024) · Internet Technology Letters · doi:10.1002/itl2.601 · Cited by 2
Szczesny, B., & Gryncewicz, W. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-78468-2_4 · Cited by 2
Quantum-Resistant Lattice-Based Proxy Signature
Luo, J., Zuo, L., & Liu, H. (2025) · Symmetry · doi:10.3390/sym17020261 · Cited by 2
Advancement of the DRPE Encryption Algorithm for Phase CGHs by Random Pixel Shuffling
Blesa, A., & Arbeloa, F. J. S. (2025) · Applied Sciences · doi:10.3390/app15084120 · Cited by 2
Panda, D. K., & Benjamin, C. (2025) · Physical review. E · doi:10.1103/physreve.111.l042103 · Cited by 3
“Position disorder thus generates rich quantum states, which are helpful in quantum cryptography in designing cryptographic keys, as these states will be more challenging to decipher by eaves-droppers as compared to trivial states (product or symmetrically superposed states) [4, 7, 40].”
Full-Stack Quantum Computing and Distributed Systems: A Community-Centric Approach
Feld, S. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-94263-1_1 · Cited by 2
Kumar, A., Shrimal, V. M., & Rubbina, R. (2025) · International Conference on Research Methodologies in Knowledge Management, Artificial Intelligence and Telecommunication Engineering (RMKMATE) · doi:10.1109/rmkmate64874.2025.11042466 · Cited by 2
“Blockchain is an immutable ledger which is decentralized and used for vote storage, also hash and lattice-rooted cryptographic techniques are strong enough to nullify quantum attacks [7].”
Efficient Post-Quantum Cryptographic Hardware for Healthcare Applications
Coulon, S., Bao, T., & Xie, J. (2025) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas56072.2025.11043958 · Cited by 2
Investigating the Impact of Grover's Algorithm on AES S-Box
Irwan, N. F. I. B. A., Zawawi, M. N. A., & Thabit, R. (2024) · International Conference on Knowledge and Systems Engineering/Proceedings · doi:10.1109/kse63888.2024.11063483 · Cited by 2
Zhang, P., Kuang, S., & Jiang, X. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3595757 · Cited by 2
“…the controller can confirm the presence of an eavesdropper in a device-independent way, CQT has also been applied in quantum cryptographic conferencing [11], [12], quantum signature schemes [13], [14] quantum secret sharing [15], [16], and user-controlled quantum information processing [17], [18].”
Ravi, C. (2025) · Springer eBooks · doi:10.1007/978-981-96-4948-8_16 · Cited by 4
A parameter study for LLL and BKZ with application to shortest vector problems
Köppl, T., Zander, R., Henkel, L., & Tcholtchev, N. (2025) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc65549.2025.11326330 · Cited by 2
“In literature, such algorithms are denoted as Post-quantum cryptography (PQC) algorithms [4], [9].”
Navandar, P. (2024) · International Journal of Engineering & Extended Technologies Research · doi:10.15662/ijeetr.2024.0604014 · Cited by 3
Plantard, T., & Susilo, W. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15317-4_21 · Cited by 2
Cryptanalysis of Little Dragon Two multivariate public key cryptosystem
Li, F., Lu, X., Wang, Y., Tian, L., & Bao, W. (2010) · International Conference on Computer Application and System Modeling · doi:10.1109/iccasm.2010.5623032 · Cited by 2
A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions
Preetha Mathew, K., Vasant, S., Venkatesan, S., & Rangan, C. P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29101-2_10 · Cited by 2
Low Complex System for Physical Layer Security Using NLFG and QCLDPC Code
Stuart, C. M., & Deepthi, P. P. (2014) · Communications in computer and information science · doi:10.1007/978-3-662-44966-0_30 · Cited by 2
A Performance Boost for Hash-Based Signatures
Eisenbarth, T., von Maurich, I., Paar, C., & Ye, X. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42001-6_13 · Cited by 4
Public Key Authentication with Memory Tokens
Vuillaume, C., Okeya, K., Dahmen, E., & Buchmann, J. A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00306-6_7 · Cited by 2
Senthilkumar, B., & Rajamani, V. (2014) · Cited by 2
Code-Based Public-Key Encryption
Morozov, K. (2014) · Mathematics for industry · doi:10.1007/978-4-431-55060-0_4 · Cited by 2
Cryptanalysis of a cryptosystem with non-commutative platform groups
Liu, J., Jia, J., Zhang, H., Yu, R., Yu, Y. H., & Wu, W. (2018) · China Communications · doi:10.1109/cc.2018.8300273 · Cited by 2
Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
Mathew, K. P., Vasant, S., & Rangan, C. P. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-12160-4_31 · Cited by 2
Raffaelli, F., Denman, R., Collins, R. B., Faugère, J., Martino, G. D., Shaw, C., Kennard, J., Sibson, P., Perret, L., & Erven, C. (2019) · Advanced Optical Technologies · doi:10.1515/aot-2020-0021 · Cited by 2
“QR algorithms (also called post-quantum cryptography) are based on different mathematical problems than those used in our current security methods which are thought to be secure from a quantum computer [4].”
BackgroundEbbers, F., & Karaboga, M. (2021) · Lecture notes in information systems and organisation · doi:10.1007/978-3-030-86797-3_24 · Cited by 2
“However, (a)synchronous encryption algorithms such as AES or RSA are commonly used to encrypt bulk data [42] and cracking these is very unlikely in practice, as AES-256 and RSA-2048 are considered secure for the next decades [43].”
MethodA Review of Blockchain Based Solutions for Fight Against Pandemics
Capraz, S., & Özsoy, A. (2021) · International Conference on Computer Science and Engineering (UBMK) · doi:10.1109/ubmk52708.2021.9558911 · Cited by 2
Exploiting Redundant Randomness for Resisting Key Exposure in Encrypted Communication Systems
Li, L., Wang, J., Zhang, R., Gao, Y., Li, Y., & Mao, Y. (2022) · IEEE Systems Journal · doi:10.1109/jsyst.2022.3149186 · Cited by 2
“As Bernstein and Lange pointed out [52], simply switching to 256-bit AES keys can resist all known quantum attacks, such as Grover’s algorithm, in the foreseeable future.”
BackgroundWireless Brain-Computer Interface (WBCI) and 6G Technology Security Issues, Safety Mechanisms
Ganesan, S. K., Parthasarathy, V., Arunachalam, M., & M., V. B. A. (2022) · Advances in wireless technologies and telecommunication book series · doi:10.4018/978-1-6684-3804-6.ch013 · Cited by 2
SVAT: Secure outsourcing of variant annotation and genotype aggregation
Kim, M., Wang, S., Jiang, X., & Harmanci, A. O. (2022) · BMC Bioinformatics · doi:10.1186/s12859-022-04959-6 · Cited by 2
de Alwis, C., Pham, Q., & Liyanage, M. (2022) · Wiley eBooks · doi:10.1002/9781119862321.ch10 · Cited by 2
Power-Based Side-Channel Attacks on Program Control Flow with Machine Learning Models
Robins, A., Olguin, S., Brown, J., Carper, C., & Borowczak, M. (2023) · Journal of Cybersecurity and Privacy · doi:10.3390/jcp3030018 · Cited by 2
“Many of the early works in SCA demonstrated various ways to recover secret cryptographic information, either keys or text, to some degree; however, with the advent of post-quantum cryptography, many of the crypto-systems currently employed will become insecure and obsolete [10].”
BackgroundA constant round quantum secure protocol for oblivious polynomial evaluation
Mohanty, T., Srivastava, V., Mesnager, S., & Debnath, S. K. (2023) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2023.103560 · Cited by 2
Mu, J., Tan, H., Chen, S., Cai, M., Ye, J., Li, H., & Li, X. (2023) · Proceedings - Asian Test Symposium/Proceedings · doi:10.1109/ats59501.2023.10318005 · Cited by 2
“W Ith the rapid development of the quantum computers, the existing security systems based on classical cryptographic algorithms will no longer be secure [1], [2].”
BackgroundEFFLUX-F2: A High Performance Hardware Security Evaluation Board
Jati, A., Gupta, N., Chattopadhyay, A., & Sanadhya, S. K. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-57543-3_3 · Cited by 2
“Another recent e(cid:27)ort by [6] in which the authors designed the platform with Kintex Ultrascale FPGA to allow evaluations of larger designs such as Post-quantum cryptographic (PQC) [4,1] implementations.”
Insight into Latchup Risk in 28nm Planar Bulk Technology for Quantum Computing Applications
Serbulova, K., Qiu, Z.-E., Chen, S., Grill, A., Kao, K.-H., Boeck, J. D., & Groeseneken, G. (2024) · IEEE International Reliability Physics Symposium proceedings · doi:10.1109/irps48228.2024.10529388 · Cited by 2
Backdoors to Encryption: Analysing an Intermediary’s Duty to Provide “Technical Assistance”Preprint
Bhandari, V., Bailey, R., & Rahman, F. (2021) · SSRN Electronic Journal · doi:10.2139/ssrn.3805980 · Cited by 2
Survey on Post-Quantum Cryptography by ChatGPTPreprint
Chang, R. S. (2023) · doi:10.31224/2862 · Cited by 2
Lakhan, A. S. (2023) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2023-15755 · Cited by 6
Arukala, H. (2024) · ISU Red - Research and eData (Illinois State University) · doi:10.30707/etd2024.20240618063947766023.999996 · Cited by 2
Multimode Quantum Communications and Hybrid Cryptography
Mazzoncini, F. (2024) · theses.fr (ABES) · doi:10.70675/ac2f8f17z80faz4276za40fzfe7c124fb9fc · Cited by 2
Post-Quantum Key Encapsulation Mechanisms: A Comparative Review of ML-KEM, BIKE, and HQC
Reazaei, P., Rashid, A. S. K., Mand, A. A., & Saberikamarposhti, M. (2026) · 2026 22nd IEEE International Colloquium on Signal Processing & Its Applications (CSPA) · doi:10.1109/cspa68262.2026.11517877 · Cited by 1
“BIKE and HQC rely on QCSD and HQCSD, respectively; the best known attacks are Information Set Decoding (ISD) variants, exponential in the relevant code parameters [15].”
A Reaction Attack against Cryptosystems Based on Quasi–Group MDPC Codes
Vedenev, K., & Kosolapov, Y. V. (2023) · International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY) · doi:10.1109/redundancy59964.2023.10330086 · Cited by 1
“…cryptosystems like RSA and elliptic-curve cryptosystems can be attacked in polynomial time using quantum computers with Shor’s algorithm [1], code-based cryptography has received a lot of attention in recent years as a potential approach that can withstand both classical and quantum attacks [2].”
BackgroundPankov, K. N., & Глухов, М. М. (2024) · Systems of Signals Generating and Processing in the Field of on Board Communications · doi:10.1109/ieeeconf60226.2024.10496715 · Cited by 8
“As already noted in [9], one of the main ways to protect against the quantum threat is the use of post-quantum [14] or quantum-resistant cryptographic systems and protocols.”
BackgroundA Report on The Future Landscape of Cybersecurity
Rajak, R. J., & Verma, P. P. (2024) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-18979 · Cited by 1
Design of Novel Systolic Array based NTT for CRYSTALS-Kyber scheme
Puli, K., & Pudi, V. (2024) · IEEE Asia Pacific Conference on Circuits and Systems (APCCAS) · doi:10.1109/apccas62602.2024.10808929 · Cited by 1
Premi, M. S. G., Susitra, D., Mana, S. C., Velvizhi, R., & Nair, M. C. (2025) · doi:10.47716/978-93-92090-62-2 · Cited by 1
Digital Payment Security : A Developer Framework
Sirigina, P. V. (2023) · International Journal of Scientific Research in Computer Science Engineering and Information Technology · doi:10.32628/cseit23564520 · Cited by 1
Donado, S. A. (2025) · Congresso Ibero-Americano em Engenharia de Software (CIbSE) · doi:10.5753/cibse.2025.35301 · Cited by 1
Kayacı, N., Kiremitler, N. B., Deneme, İ., Kalay, M., Ozbasaran, A., Zorlu, Y., Önses, M. S., & Usta, H. (2025) · Advanced Materials · doi:10.1002/adma.202506067 · Cited by 1
Reusable Fuzzy Extractor from Isogeny-Based Assumptions
Wen, Y., Jin, T., & Li, W. (2025) · Symmetry · doi:10.3390/sym17071065 · Cited by 1
Quantum-resistant SSL/TLS: Preparing for Post-quantum Cryptography
Tuhaise, R., Correia, O., Ocaya, J., Gladino, P., & Ekuri, O. (2025) · East African Journal of Information Technology · doi:10.37284/eajit.8.1.3368 · Cited by 1
Subhadra, H., Madhavaram, H., Sakinam, S., & Pranavanand, S. (2025) · Communications in computer and information science · doi:10.1007/978-3-032-00983-8_17 · Cited by 1
Bedi, P., Das, S., Goyal, S. B., Rajawat, A. S., & Islam, S. M. N. (2025) · Springer eBooks · doi:10.1007/978-981-96-4948-8_10 · Cited by 1
Zhang, R., Liu, X., Wang, J., Li, M., Shen, S., & Fei, S. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500376 · Cited by 1
Yue, H., Chen, Y., Liang, T., Li, X., Kong, X., Jiang, Z., Li, Z., Chen, G., & Lu, H. (2025) · IEICE Electronics Express · doi:10.1587/elex.22.20250422 · Cited by 1
“Over the past decades, post-quantum cryptography (PQC) has attracted considerable attention, leading to the proposal of numerous cryptographic schemes expected to resist potential threats posed by quantum computers [1, 2].”
Advancing On-Chip Continuous-Variable Quantum Key Distribution Solutions
Llanos, E., Sarmiento, S., Tabares, J., Bazzani, E., Lázaro, J. A., Vehmas, T., Vasquez, Y. M., Thomas, G., Forstén, H., Wälchli, B., et al. (2025) · International Conference on Transparent Optical Networks · doi:10.1109/icton67126.2025.11125412 · Cited by 1
“To counteract this risk, post-quantum cryptographic (PQC) algorithms have been proposed, although they still make assumptions about the computational capabilities of an eavesdropper [3].”
Koroma, M., Fofanah, M. S., Sesay, M., & Sawaneh, I. A. (2025) · International Journal of Advanced Research · doi:10.21474/ijar01/21563 · Cited by 1
Post Quantum Cryptography on Intravehicular Networks
Smith, S., Owens, K., & Kozan, K. (2025) · SAE technical papers on CD-ROM/SAE technical paper series · doi:10.4271/2025-01-0451 · Cited by 1
RIGHT: GPU-Optimized Parallel PQC HAETAE for High-Throughput Cryptographic Acceleration
Wu, W., Dong, J., Hou, Y., Liu, M., Li, L., & Dong, Z. (2025) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2025.3613305 · Cited by 1
“Postquan-tum cryptography (PQC) [10] is an essential component of future cryptographic systems and plays a critical role in ensuring the long-term security of the IIoT in the era of quantum computing.”
Class Topper Optimization Algorithm based Optimal Cryptographic Technique
Acharya, D., Ganguly, R., Debnath, B., Hazra, S. K., Chatterjee, S., & Bhattacharyya, A. (2025) · International Conference on Computing, Intelligence, and Application (CIACON) · doi:10.1109/ciacon65473.2025.11189470 · Cited by 1
“7 Post-Quantum Cryptography [19] With the advent of quantum computers, there is a growing interest in cryptographic algorithms that are believed to be secure even against quantum attacks.”
Implementing Post-Quantum Cyber Security in Financial Systems
Voloch, N., & Bloch, N. V. (2025) · International Conference on Advanced Computer Information Technologies (ACIT) · doi:10.1109/acit65614.2025.11185847 · Cited by 1
“Among these, lattice-based cryptographic schemes such as Kyber (for key exchange) and Dilithium/Falcon (for digital signatures) have been selected as part of NIST’s post-quantum cryptographic standardization process [3].”
A dynamic quantum-resistant code-based public key encryption scheme
Raju, P., Chithralekha, T., Singh, K., Ganesan, G., & Rajarajan, M. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04976-3 · Cited by 1
Tarannum, D., Syed, M. A., Biswas, B. K., & Chowdhury, M. R. (2025) · APL Quantum · doi:10.1063/5.0281728 · Cited by 1
Steane and Iceberg Code Implementations on Toffoli Gates
Riffel, C., Robertson, R., Slodov, M., & Hendrickson, P. (2025) · IEEE National Aerospace and Electronics Conference (NAECON) · doi:10.1109/naecon65708.2025.11235387 · Cited by 2
“Quantum computation has the potential to impact many fields, including chemistry [4], space situational awareness [5], grid security [6], finance [7], cryptography [8], and machine learning [9].”
Rajen, K. S., Mandal, D., & Gayathri, M. K. (2025) · International Conference on Next Generation of Green Information and Emerging Technologies (GIET) · doi:10.1109/giet65294.2025.11234787 · Cited by 1
A Quantum Proxy Signature Scheme Without Restrictions on the Identity and Number of Verifiers
Xiong, S. (2025) · Entropy · doi:10.3390/e27111171 · Cited by 1
“The threat posed by quantum computing has catalyzed two distinct cryptographic paradigms: post-quantum cryptography [7–11], which develops classical algorithms resistant to quantum attacks, and quantum cryptography [12–16], which leverages quantum mechanical principles to achieve…”
LEAF: Lightweight and Efficient Hardware Accelerator for Signature Verification of FALCON
Coulon, S., Xiong, J., & Xie, J. (2025) · doi:10.1109/iccad66269.2025.11240686 · Cited by 1
“Given the looming threat of future quantum computers to current cryptographic systems, new quantum-resistant algorithms (namely post-quantum cryptography (PQC)) are being developed in response [1], [2].”
Quantum-Resilient Cryptographic Techniques for AI-Driven 6G Communication
Shah, A. F. M. S., Akhter, A. F. M. S., & Karabulut, M. A. (2025) · IntechOpen eBooks · doi:10.5772/intechopen.1009468 · Cited by 1
Adaptive multi-party quantum key exchange in dynamic networks using GHZ states
Wang, C., Li, M., Wang, B., & Zhang, Y. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-05003-1 · Cited by 1
Somsuk, K. (2025) · IEEE Access · doi:10.1109/access.2025.3638714 · Cited by 1
“Post-Quantum Cryptography (PQC) [23], [24] is a cryptographic methodology designed for digital computers to guarantee information security through encapsulation and decapsulation processes and authentication through digital signatures, and signature validation.”
VDNABDS, A DNA-Based Cryptographic Protocol for Enhancing Cloud Security
Mohapatra, S., Mohanty, S., Dash, B., Mohanty, S. N., Dash, M., & Ray, A. (2025) · Journal of Visualized Experiments · doi:10.3791/68843 · Cited by 1
Quantum Key Distribution in Mobile Networks: Modern Approaches and Prospects
Vatskov, P. Y., Mavrin, E. M., Потапов, В. Г., & Che, P. V. (2025) · Journal of Communications Technology and Electronics · doi:10.1134/s1064226925700287 · Cited by 1
“…have not yet been found: decoding of random linear codes (code-based), search for the shortest vector in a lattice (lattice-based), solving of multivariate quadratic equations (multivariate), construction of hash chains (hash-based), and supersingular isogeny of elliptic curves (isogeny-based) [4].”
Chinnaraju, A. (2025) · JOURNAL OF ADVANCE AND FUTURE RESEARCH · doi:10.56975/jaafr.v3i12.501605 · Cited by 1
Post-Quantum Cryptography on Constrained Networks
Smith, S., Owens, K., & Kozan, K. (2025) · IEEE International Carnahan Conference on Security Technology (ICCST) · doi:10.1109/iccst63435.2025.11293950 · Cited by 1
“A sufficiently powerful quantum computer [4] could change this given a functional implementation of Shor's [5] algorithm, as published in 1994.”
Design and Implementation of a Group Signature Scheme Based on CPK
He, C. (2025) · International Conference on Computer Information Science and Artificial Intelligence (CISAI) · doi:10.1145/3773365.3773608 · Cited by 1
“Lattice-based cryptography has been identified as a promising post-quantum solution [12], with security relying on hard problems such as the Shortest Vector Problem (SVP) and Learning with Errors (LWE).”
Fractional Verkle Trees for Scalable Post-Quantum Signatures
Iavich, M., Kuchukhidze, T., & Bocu, R. (2025) · IEEE Access · doi:10.1109/access.2025.3640288 · Cited by 1
“Sub-sequent improvements, such as HORST [8], attempted to address these issues through tree-based key compression, yet still inheriting similar inefficiencies, which are characteristic to Merkle tree constructions [9].”
Cyberbezpieczeństwo systemu finansowego
Wawrzyniak, D. (2025) · Wroclaw University of Economics and Business eBooks · doi:10.15611/2025.97.9 · Cited by 1
Cha, W., Lee, H. J., Kook, S., Kim, K., & Won, D. (2025) · Sensors · doi:10.3390/s26010217 · Cited by 2
“…designs, including Elliptic Curve Cryptography (ECC), Elliptic Curve Diffie–Hellman (ECDH), and the Elliptic Curve Digital Signature Algorithm (ECDSA), have long been recognized for their compact key sizes and robust mathematical assurances compared with classical RSA schemes [3,4,13].”
Quantum Computing and Blockchain: Advanced Security in the Metaverse
Dalal, A. (2026) · Information systems engineering and management · doi:10.1007/978-3-032-07305-1_5 · Cited by 1
Out-of-Time-Order Correlators as Indicators of Entropy in the Quantum Kicked Rotor
Broto, T. W., Rustad, S., Fanani, A. Z., Winarno, S., & Setiadi, D. R. I. M. (2026) · Computers · doi:10.3390/computers15010023 · Cited by 1
Lightweight Hybrid Post-Quantum Communication VPN Architecture for Building-Wide IoT Systems
Liu, H., Zhang, Z., Zhou, M. M., & Hancke, G. P. (2025) · IEEE International Conference on Industrial Informatics (INDIN) · doi:10.1109/indin64977.2025.11279679 · Cited by 1
“While the long-term security of the underlying private signing key remains important, the immediate impact of a quantum attack on signatures (i.e., forging a signature for an ongoing connection) is arguably less critical in the near term than attacks compromising session keys [15].”
Guerra-Yánez, C., Olmedo, J. G., Marco, I. D., Hristovski, I. R., Ghassemlooy, Z. F., Zvánovec, S., & Moll, F. (2026) · Photonics Research · doi:10.1364/prj.577728 · Cited by 1
NIST-Post Quantum Cryptography Algorithm Optimization and Scarcity
Sharma, A., Prakash, A., Dixit, A., Gupta, A., & Parihar, D. (2025) · International Conference on Computing, Communication and Automation · doi:10.1109/iccca66364.2025.11325571 · Cited by 1
From Classical to Quantum-Safe Security: the Transformative Role of Quantum Technologies
Mobilon, E., Rosolem, J. B., Inga, M., Riveros, L. G. M., Sutili, T., Paixão, A. C. P., Braga, A. M., & Figueiredo, R. C. (2025) · SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC) · doi:10.1109/imoc65414.2025.11365742 · Cited by 2
“The main approaches are [23, 24] • Hash-based Cryptography: algorithms that use hash functions for digital signatures, such as SPHINCS+; • Multivariate Polynomial Cryptography: algorithms based on the difficulty of solving systems of multivariate polynomial equations, such as Rainbow; •…”
Post-quantum Blockchain Transaction Model Based on Dilithium
Xu, G., Guan, Y., & Wang, L. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-6419-4_19 · Cited by 1
Neural cryptography: Synergy and conflict between neural networks and cryptographic systems
Zhong, Y., Gu, J., & Yu, X. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.133084 · Cited by 2
Performance Analysis and Selective Retransmission Optimization For Fragmented Post-Quantum IKEv2
He, X., Han, L., & Jiang, Z. (2025) · International Conference on Blockchain Technology and Information Security (ICBCTIS) · doi:10.1109/icbctis66509.2025.11387151 · Cited by 1
“However, PQC algorithms introduced to counter the threat of quantum computing typically feature large key and signature sizes [9].”
Archaea synthesize heterochiral phospholipid membranes as revealed by chiral analysis of archaeols
Hofmann, W., Palyzová, A., Jansa, J., Pende, N., Rittmann, S. K. ‐. R., & Řezanka, T. (2026) · Journal of Chromatography A · doi:10.1016/j.chroma.2026.466853 · Cited by 1
Sun, C., Mahfuz, N. M., & Wang, Y. (2026) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2026.3674809 · Cited by 1
“Lattice-based cryptography, built on computationally hard problems in lattice theory, is considered the most promising post-quantum cryptographic direction [18], [19], [20].”
Post-quantum Cryptography from Quantum Stabilizer Decoding
Lu, J. Z., Poremba, A., Quek, Y., & Ramkumar, A. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35398-6_6 · Cited by 1
Krishnamoorthy, S. K., Muthupandian, M., Srinadh, V., & Thavasilingam, D. (2026) · International Journal of Systems Assurance Engineering and Management · doi:10.1007/s13198-026-03201-3 · Cited by 1
Post Quantum Secure Access Framework for Course Material Distribution in Campus Networks
Swaminathan, G., & Anantha Babu, A. (2026) · International Conference on Computing, Communication, Control and Cyber-Physical Systems (I5CPS) · doi:10.1109/i5cps67958.2026.11452429 · Cited by 1
Quantum Multi-Party Computation (QMPC) for Enhanced Blockchain Consensus
Chong, H. C., & Law, K. L. E. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00138 · Cited by 1
“Post-quantum cryptography (PQC) replaces vulnerable primitives with schemes believed secure against quantum attacks [6].”
A Symmetric XOR-Based Dynamic Multiple Secret Sharing Visual Cryptography Framework
Sona, G., & Purusothaman, T. (2026) · Symmetry · doi:10.3390/sym18050802 · Cited by 1
Salawu, G. A., & Glen, B. (2026) · Applied Sciences · doi:10.3390/app16104856 · Cited by 1
Design and implementation of a fixed-point FFT/IFFT processor for NTRU lattices
Alshehhi, M., Alsuhli, G. H., Saleh, H. H., Stouraitis, T., & Caullery, F. (2026) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2026.105282 · Cited by 1
Kumar, A., Gupta, U., & Goyal, M. (2026) · International Conference on Intelligent Systems in Engineering, Secured Systems and Cybersecurity (ICISESSC) · doi:10.1109/icisessc68634.2026.11542690 · Cited by 1
A dual-layer vector map encryption scheme using 4D hyperchaos and SM4
Wang, M., Wu, J., Song, Y., Zhang, H., & Zhu, X. (2026) · Scientific Reports · doi:10.1038/s41598-026-55081-z · Cited by 1
Mythos-Class Frontier Models and the Compression of Post-Quantum Cryptography Migration Timelines
Campbell, R. (2026) · Cryptography · doi:10.3390/cryptography10030041 · Cited by 1
“…public-key systems insecure against a large-scale quantum computer [17], and it matured through foundational surveys of the principal post-quantum families [29] and the standardization process initiated by NIST IR 8105 [30] that culminated in the FIPS 203, 204, and 205 standards [1–3].”
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.