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 901–1,000 of 1,003
Singh, R., & Suseelan, A. D. (2026) · Electronics · doi:10.3390/electronics15132832 · Cited by 1
Bibi, M., Khan, W. Z., & Haq, Q. E. U. (2026) · Scientific Reports · doi:10.1038/s41598-026-59644-y · Cited by 1
“Kyber is considered a leading post-quantum cryptographic primitive due to its strong security guarantees and computational efficiency under both classical and quantum threat models 30,31 .”
Kanakadhurga, D., Chandrakala, K. R. M. V., Başaran, K., & Lăzăroiu, G. C. (2026) · Engineering Science and Technology an International Journal · doi:10.1016/j.jestch.2026.102464 · Cited by 1
Karcz, D., Niemiec, M., Kourtis, M., & Köppl, T. (2026) · PLoS ONE · doi:10.1371/journal.pone.0355179 · Cited by 1
“Post-quantum cryptography introduces cryptographic schemes designed to remain secure against both classical and quantum adversaries [1].”
ТЕХНІЧНИЙ ЗАХИСТ ІНФОРМАЦІЇ. ОСНОВНІ ПРОБЛЕМИ ТА СПОСОБИ ЇХ ВИРІШЕННЯ
Досенко, С. Д. (2021) · Herald of Lviv University of Trade and Economics Technical sciences · doi:10.36477/2522-1221-2021-27-04 · Cited by 1
Cryptanalysis of 2-Layer Nonlinear Piece in Hand Method
Nie, X., Petzoldt, A., & Buchmann, J. A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40588-4_7 · Cited by 1
Private Identification of RFID Tags
Malek, B., & Miri, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27901-0_5 · Cited by 1
An Efficient Decoding of Goppa Codes for the McEliece Cryptosystem
Lim, S., Lee, H.-S., & Choi, M. (2014) · Fundamenta Informaticae · doi:10.3233/fi-2014-1082 · Cited by 1
An Efficient and Secure Coding-Based Authenticated Encryption Scheme
Meziani, M., & Bansarkhani, R. E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35890-6_4 · Cited by 1
Revocation and Non-repudiation: When the First Destroys the Latter
Braun, J., Kiefer, F., & Hülsing, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-53997-8_3 · Cited by 1
High-Speed Dating Privacy-Preserving Attribute Matching for RFID
Batina, L., Hermans, J., Hoepman, J.-H., & Krasnova, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13066-8_2 · Cited by 1
Hierarchical Identity-Based Signature with Short Public Keys
Wu, Q., & Zhang, L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-319-03584-0_20 · Cited by 1
Zero-Knowledge Interactive Proof Systems for New Lattice Problems
Crépeau, C., & Kazmi, R. A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-27239-9_9 · Cited by 1
Recent Developments in Cayley Hash Functions
Sosnovski, B. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96418-8_52 · Cited by 1
Dooley, J. F. (2018) · History of computing · doi:10.1007/978-3-319-90443-6_15 · Cited by 1
Efficient multiplications in finite fields for multivariate signatures
Yi, H., Chi, R., & Nie, Z. (2019) · Journal of Intelligent & Fuzzy Systems · doi:10.3233/jifs-179291 · Cited by 1
Clifford-group-restricted eavesdroppers in quantum key distribution
Govia, L. C. G., Bunandar, D., Lin, J., Englund, D. R., Lütkenhaus, N., & Krovi, H. (2020) · Physical Review A · doi:10.1103/physreva.101.062318 · Cited by 2
Application of Polar Code-Based Scheme in Cloud Secure Storage
Li, Z., Han, Y., & Li, Y. (2020) · Communications in computer and information science · doi:10.1007/978-981-15-7981-3_50 · Cited by 1
Moldovyan, D. N., Al-Majmar, N. A., & Moldovyan, A. A. (2021) · The International Arab Journal of Information Technology · doi:10.34028/iajit/18/3/14 · Cited by 1
“Development of the practical post-quantum public-key cryptoschemes is considered by the cryptographic community as a current challenge in the area of theoretic and applied cryptography [1, 8].”
BackgroundPost-Quantum Hardware Security: Physical Security in Classic vs. Quantum Worlds
Covic, A., Chowdhury, S., Acharya, R. Y., Ganji, F., & Forte, D. J. (2020) · Springer eBooks · doi:10.1007/978-3-030-64448-2_8 · Cited by 3
A Multifunctional Modular Implementation of Grover’s Algorithm
Mina, M.-Z., & Simion, E. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17510-7_16 · Cited by 1
Key Reuse Attacks on Post-quantum Cryptosystems, Revisited
Wang, K., Zhang, Z., Jiang, H., Xie, H., Li, Y., Sun, Y., & Han, L. (2022) · The Computer Journal · doi:10.1093/comjnl/bxac176 · Cited by 1
Implementation of Anti-quantum Communication System using Software-Defined Radio
Yang, H., Xu, J., Wang, H., Wen, C., & Wu, G. (2023) · International Conference on Consumer Electronics · doi:10.1109/icce56470.2023.10043576 · Cited by 1
“In the most existing cryptosystem, there are several cryptographic algorithms that cannot be easily cracked by quantum computers: Symmetric cryptography, Code-based cryptography, Lattice-based cryptography and Multivariate public key cryptography [2].”
MethodKim, C., Kim, Y.-S., & No, J. (2023) · IEEE Communications Letters · doi:10.1109/lcomm.2023.3257136 · Cited by 1
“Therefore, it is crucial to design new alternative cryptosystems resilient to the QC algorithm, an approach referred to as post-quantum cryptography (PQC) [1].”
BackgroundPUBLIC KEY ENCRYPTION SCHEME BASED ON KEYWORD SEARCH
Soroush, A. M. (2023) · Open Journal of Physical Science · doi:10.52417/ojps.v4i1.471 · Cited by 1
“The key pair consists of public and private keys that are generated using cryptographic techniques based on one-way functions (Shirey, 2007; Bernstein & Lange, 2017).”
MethodPrihatno, A. T., Suryanto, N., Larasati, H. T., Oktian, Y. E., Le, T.-T.-H., & Kim, H. (2024) · Lecture notes in computer science · doi:10.1007/978-981-99-8024-6_7 · Cited by 1
Securing Social Well-Being in the Quantum Age: Legal Roadmaps for PQC in Banking to Healthcare
Pratama, D. (2024) · International Journal of Social health · doi:10.58860/ijsh.v2i12.136 · Cited by 1
“They share a secret key ( K enc ) like a whispered password, allowing Juliet to scramble the message (m) with a "symmetric encryption" algorithm (Bernstein & Lange, 2017).”
MethodSecurity and Privacy Mechanisms for 6G Internet of Everything Networks in Banking
Şafak, I., Alagöz, F., & Anarım, E. (2024) · Advances in information quality and management · doi:10.4018/978-1-6684-7366-5.ch076 · Cited by 2
On the decisional problem based on matrix power function defined over non-commutative group
Mihalkovich, A., & Žitkevičius, J. (2024) · Mathematical Models in Engineering · doi:10.21595/mme.2024.24071 · Cited by 1
“In 2016 the National Institute of Standards and Technology (NIST) announced a call for post-quantum algorithms for standardization [4].”
Post-quantum $$\kappa $$-to-1 trapdoor claw-free functions from extrapolated dihedral cosets
Yan, X., Wang, L., Gu, L., Li, Z., & Suo, J. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04387-w · Cited by 1
Photonic Layer Encryption in High Speed Optical Communications
Sadot, D., Wohlgemuth, E., Attia, I., Balasiano, O., Jonas, I., Keller, E., & Shalom, H. (2024) · Optical Fiber Communication Conference · doi:10.1364/ofc.2024.m4f.1 · Cited by 1
“Quantum key distribution (QKD) [2] is considered unconditionally secured, i.e. completely resilient against cryptanalytic attacks.”
BackgroundText Encryption Using Audio with Multiple Chaotic Maps
Singh, A., & Jain, K. (2024) · International Symposium on Digital Forensics and Security (ISDFS) · doi:10.1109/isdfs60797.2024.10527303 · Cited by 1
Practical Privacy-Preserving Ride Sharing Protocol with Symmetric Key
Ramezanian, S., & Gehrmann, C. (2023) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom60117.2023.00234 · Cited by 1
“The encryption schemes of PSA − ZS and PPRS protocols utilize symmetric keys, hence the two protocols are post quantum secure, if the key sizes are long enough [34].”
MethodAnalyses of 6G-Network and Blockchain-Network Application Security: Future Research Prospect
Annas, A. H., Zainuddin, A. A., Ramlee, A. W., Omar, A. S. Y., Saifuddin, M. R. M., Sidik, N. F. I., Sapuan, M. S., Amerolazuam, A. Q., Nizam, M. H. Z. H., Mazlan, F., et al. (2024) · International Journal on Perceptive and Cognitive Computing · doi:10.31436/ijpcc.v10i2.478 · Cited by 2
“Post-quantum cryptographic algorithms, such as lattice-based, hash-based, and multivariate-quadratic-equations-based cryptography, are being developed to secure data against quantum attacks [78] .”
BackgroundSong, G., & Seo, H. (2024) · Electronics · doi:10.3390/electronics13163167 · Cited by 2
The Technological and Societal Landscape
van Daalen, O. (2024) · Information technology and law series/Information technology & law series · doi:10.1007/978-94-6265-635-2_2 · Cited by 1
Redundant multipath PQC key exchange using Shamir's Secret Sharing
Döring, R., & Geitz, M. (2024) · International Conference on Communications, Circuits and Systems · doi:10.1109/icccas62034.2024.10652767 · Cited by 1
“Its foundation lies in mathematical complexity, which current quantum computers are considered incapable of breaching [2].”
BackgroundKaya, M. S., & İInce, K. (2024) · International Artificial Intelligence and Data Processing Symposium (IDAP) · doi:10.1109/idap64064.2024.10710906 · Cited by 1
“The superior computational power of these computers makes classical methods vulnerable; standardized encryption algorithms such as AES can be broken much faster with Grover’s algorithm and quantum computers [2].”
MethodMcEliece Public-Key Cryptosystem Based on Cyclic Codes
Ye, J., Chen, D., Gao, S., Zhang, C., & Chen, Z. (2024) · International Conference on Wireless Communications and Signal Processing (WCSP) · doi:10.1109/wcsp62071.2024.10827328 · Cited by 1
Decoy state quantum secret sharing protocol with collective detection
Xie, Y. M., Liu, B., Li, X., Li, Z., Shao, W., & Huang, W. (2025) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2024-0588 · Cited by 1
Sensor Based IOT Enabled Healthcare Systems and Role of AI and Security
Gupta, S. K., Kapoor, M., & Debnath, S. K. (2025) · Springer eBooks · doi:10.1007/978-3-031-82810-2_2 · Cited by 1
Staat, P., Dörpinghaus, M., Sheikholeslami, A., Paar, C., Fcllwcis, G., & Goeckel, D. (2025) · Conference on Information Sciences and Systems · doi:10.1109/ciss64860.2025.10944740 · Cited by 2
“In turn, researchers proclaimed a race against time to replace the schemes before quantum computing reaches maturity [4].”
Meng, L., Xu, Y., Xu, H., Zhou, X., & Han, Z. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3568796 · Cited by 1
“However, many of these approaches rely on bilinear pairings, which are considered vulnerable in the upcoming quantum era [13], [14].”
Donado, S. A., Pardo, C., & Mazo, R. (2024) · Revista Científica · doi:10.14483/23448350.22581 · Cited by 1
Quantum-Resistant Cryptography: Preparing Digital Assets for the Post-Quantum Era
Maqousi, A. Y. A., & Basu, K. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-1370-2.ch004 · Cited by 1
Preparing for Quantum Transformation: Strategic Implications for Business and Finance in Asia
Narayan, S. (2025) · Springer eBooks · doi:10.1007/978-981-96-3452-1_14 · Cited by 1
Next-Generation Cybersecurity: The Role of AI and Quantum Computing in Threat Detection
Penmetsa, M., Bhumireddy, J. R., Chalasani, R., Tyagadurgam, M. S. V., Gangineni, V. N., & Pabbineedi, S. (2021) · International Journal of Emerging Trends in Computer Science and Information Technology · doi:10.63282/3050-9246.ijetcsit-v2i4p106 · Cited by 1
AI-Augmented Parameter Initialization for QAOA
Nana, J., Li, X., Xie, N., Pu, S., Yu, Y., Guan, Q., Han, X., Xu, S., & Chaudhary, V. (2025) · International Conference on Dependable Systems and Networks workshops · doi:10.1109/dsn-w65791.2025.00064 · Cited by 1
“Researchers are exploring its use in many areas, including optimization, modeling [4], chemistry [5], materials science [6], and cryptography [7].”
Speeding up QUAD.Preprint
Petzoldt, A. (2013) · IACR Cryptology ePrint Archive · Cited by 2
Organizational Adoption of Post-Quantum Cryptography: Drivers, Barriers, and Strategic Implications
Zimmermann, D., Rajsingh, P. V., Cruz, E. D. L., Queiroz, H. J. D. S. D., Rana, S., & Nadella, G. S. (2025) · Cyber Awareness and Research Symposium (CARS) · doi:10.1109/cars67163.2025.11337269 · Cited by 1
“The emergence of cryptographically relevant quantum computers (CRQCs) is expected within the next decade, with government and industry actors urging immediate preparation [12].”
Experimental secure multiparty computation from quantum oblivious transfer with bit commitment
Zhang, K., Huang, A.-J., Tu, K., Li, M.-H., Zhang, C., Qi, W., Wu, Y., & Yu, Y. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01219-w · Cited by 1
Schinianakis, D., & Martín-López, E. (2018) · Bell Labs Technical Journal · doi:10.15325/bltj.2018.2860381 · Cited by 1
Lutsenko, M., Кіян, А., Кузнецова, Т., & Kuznetsov, A. A. (2018) · Radiotekhnika · doi:10.30837/rt.2018.2.193.06 · Cited by 1
Post-Quantum Cryptography trends and perspectives
(2021) · European Scientific e-Journal · doi:10.47451/inn2024-03-01 · Cited by 1
“This branch of cryptography has the potential to ensure absolute security of communications ( Bernstein et al., 2009 ).”
Misoczki, R. (2011) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.3.2011.tde-30112010-154949 · Cited by 1
Projeto de um coprocessador quântico para otimização de algoritmos criptográficos.
Possignolo, R. T. (2012) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.3.2012.tde-21062013-101915 · Cited by 1
Secure Hardware Implementation of Post Quantum Cryptosystems
Nakkar, M. (2017) · Spectrum Research Repository (Concordia University) · Cited by 2
Quantum-Safe Protection for the Tls Protocol Using Wrapped CertificatesPreprint
Giron, A. A., do Nascimento, J. P. A., & Custódio, R. F. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4536384 · Cited by 2
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0003 · Cited by 1
NEUROKEX ПОСТ-КВАНТОВЫЙ ПРОТОКОЛ ОБМЕНА КЛЮЧАМИ РАЗМЕРОМ 8 КБ С ЗАЩИТОЙ ОТ SIDE-CHANNEL АТАКPreprint
Surkova, M. (2026) · doi:10.24108/preprints-3114769 · Cited by 1
NEUROCIPHER: НЕЙРОСЕТЕВОЙ ГЕНЕРАТОР ПСЕВДОСЛУЧАЙНЫХ ПОСЛЕДОВАТЕЛЬНОСТЕЙ РАЗМЕРОМ 8 КБPreprint
Surkova, M. (2026) · doi:10.24108/preprints-3114767 · Cited by 1
NEUROSIGN: НЕЙРОСЕТЕВАЯ СИСТЕМА ЦИФРОВОЙ ПОДПИСИ РАЗМЕРОМ 8 КБPreprint
Surkova, M. (2026) · doi:10.24108/preprints-3114768 · Cited by 1
Hidden Structures and Quantum Cryptanalysis
Bonnetain, X. (2019) · theses.fr (ABES) · doi:10.70675/376c5157z8acez485dzab89z9e1bfa697ee9 · Cited by 7
Kriekouki, I. (2022) · theses.fr (ABES) · doi:10.70675/9fed023fze214z429fzbf66z0d82f6e955c8 · Cited by 5
Rigorous Security Proofs for Practical Quantum Key DistributionPreprint
Tupkary, D. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.21791 · Cited by 1
Singh, P., Hasija, T., Ramkumar, K. R., & Kanika (2026) · Discover Computing · doi:10.1007/s10791-026-10577-0
“Rapid developments have led to more precise calculations that are made by quantum computers to easily convert the ciphered message, which could break current cryptographic systems [17, 18].”
Cryptographic Hash Functions in Groups and Provable Properties
Šarinay, J. (2011) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-5250
Designing and Improving Code-based Cryptosystems
Meziani, M. (2014) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00003972
Improvement of treeless signature schemes implementation by random oracle buffering
Anikeev, M. V. (2015) · International Conference on Security of Information and Networks (SIN) · doi:10.1145/2799979.2800045
“As long as quantum computing implementation is not threatening the areas such as private-key cryptography or hashing nowadays, the primary concern of post-quantum cryptography is public-key schemes including digital signatures [1].”
Background(2009) · Chapman & Hall/CRC cryptography and network security · doi:10.1201/9781420070033.ch13
Zhang, S., Cao, W., Li, A., Dong, W., & Shao, L. (2016) · IEEE International Conference on Communication Software and Networks · doi:10.1109/iccsn.2016.7586588
A pseudorandom number generator based on worst-case lattice problems
Cayrel, P.-L., Meziani, M., Ndiaye, O. B., Lindner, R., & Silva, R. (2017) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-017-0323-1
“For the security level applied in this article, their current state of the art is not strong enough to break our system [5].”
BackgroundPractical Test of a Quantum Key Distribution System
Manninen, T. (2017)
Cryptanalysis on Hash Functions Based on Ramanujan Graphs
趙, 亨. (2017) · Kyushu University Institutional Repository (QIR) (Kyushu University) · doi:10.15017/1806832
Quantum Learning Algorithms and Post-Quantum CryptographyPreprint
Poremba, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.09289 · Cited by 1
“is discovery is oftentimes regarded as the beginning of a new race towards post-quantum cryptography, a security standard for secure classical communication, even in the presence of quantum computers [BL17]. At the same time, modern quantum technology also enables entirely new forms of communication, such as quantum k…”
BackgroundWhy 1.02? The root Hermite factor of LLL and stochastic sandpile models.Preprint
Ding, J., Kim, S., Takagi, T., & Wang, Y. (2018) · arXiv (Cornell University)
Entropic Bounds on Two-Way Assisted Secret-Key Agreement Capacities of Quantum Channels
Davis, N. (2018) · Louisiana State University · doi:10.31390/gradschool_dissertations.4561
Networked Control Systems Secured by Quantum Key DistributionPreprint
Ding, H., Wu, R.-B., & Zhao, Q. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.09015
“Especially, many currently used encryption algorithms (e.g., RSA) can be easily cracked by a quantum computer that is expected to be re-alizable in foreseeable future [14].”
MethodInnovative Eavesdropper Attacks on Quantum Cryptographic Systems
Newton, E. (2018) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)
Towards Scalable Characterization of Noisy, Intermediate-Scale Quantum Information Processors
Scholten, T. L. (2018) · UNM’s Digital Repository (University of New Mexico)
Do cells use passwords in cell-state transitions? Is cell signaling sometimes encrypted?
Root, A. (2020) · Theory in Biosciences · doi:10.1007/s12064-019-00295-1
Analysis of Opportunities of the DS Based on the MQ-Transformation
Kudryashov, I. S., & Malieieva, H. (2019) · Mathematical and computer modelling Series Technical sciences · doi:10.32626/2308-5916.2019-19.69-74
Computer Algebra Tales on Goppa Codes and McEliece Cryptography
Sayols, N., & Xambó-Descamps, S. (2019) · Mathematics in Computer Science · doi:10.1007/s11786-019-00444-1
“It is also worth visiting the page that he publishes with T. Lange, [43], and follow the PQC 2018 conference, focused on achieving a standardization of post-quantum cryptographic protocols and about which you can find information in [42].”
BackgroundSun, Z., Gu, C., & Zheng, Y. (2020) · International Conference on Cryptography, Security and Privacy (CSP) · doi:10.1145/3377644.3377649
“Till now, the Round 2 candidates have been announced and there have been several types of post-quantum cryptosystems [3], including lattice-based cryptosystems, multivariate cryptosystems, code-based cryptosystems, hash-based digital signatures and others.”
BackgroundA NEW APPROACH TO THE CONSTRUCTION OF A POST-QUANTUM ELECTRONIC DIGITAL SIGNATURE SCHEME
Kuznetsov, A. A., Кіян, А., Pushkar’ov, A., Ukraine, A. O. T. S. S. F. S. C. A. I. P. O., & Kuznetsova, T. (2020) · Information systems and technologies security · doi:10.17721/ists.2020.1.23-30
Trapdoor one-way permutations and multivariate polynomials based on random walks on graphs
Klisowski, M. (2015) · Digital Library of the Belarusian State University (Belarusian State University)
The polynomial learning with errors problem and the smearing condition
Babinkostova, L., Chin, A., Kirtland, A., Nazarchuk, V., & Plotnick, E. (2022) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2020-0035
Creating Random Unknown Ciphers as Digital PUFs and their Applications
Mars, A. (2020) · Digitale Bibliothek Braunschweig (Verbundzentrale Göttingen (VZG)) · doi:10.24355/dbbs.084-202008211138-0
de Jager, T. (2014) · Datenschutz und Datensicherheit - DuD · doi:10.1007/s11623-014-0204-8
Consensus Mechanisms and Related Issues
Appelbaum, D. A. (2021) · Emerald Group Publishing Limited eBooks · doi:10.1108/978-1-83982-198-120211010 · Cited by 1
FPGA Implementation of Post-Quantum Cryptography Recommended by NIST
Gao, X. (2021) · Scholarship at UWindsor (University of Windsor)
Post quantum cryptographic constructions
Li, Z. (2020) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/146200
Consideration of the Need for Quantum Grid ComputingPreprint
Rosch-Grace, D., & Straub, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.11341
“Class NP problems (such as the prime factoring used in modern cryptography [1]) can benefit – potentially significantly – from quantum capabilities, but are solvable by classical computers [2].”
BackgroundYesina, M. V., & Shahov, B. S. (2021) · Radiotekhnika · doi:10.30837/rt.2021.1.204.05
Ernst, C., & Schröter, J. (2021) · Springer eBooks · doi:10.1007/978-3-030-80488-6_4
Hoofnagle, C. J., & Garfinkel, S. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108883719.014
Shi, W., & Liu, L. (2021) · Springer eBooks · doi:10.1007/978-3-030-81564-6_9
Signature from the Exponential Hard Lattices
Gu, C., Jixing, G., Zhengjun, J., & Zhiming, Y. (2012) · Advances in intelligent and soft computing · doi:10.1007/978-3-642-25437-6_45
On the Detection of Permutation Polynomials
Gharibah, M. (2014) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-642-55361-5_39
Hoofnagle, C. J., & Garfinkel, S. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108883719.016
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.