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 201–300 of 1,003
Overview of the Mceliece Cryptosystem and its Security
Repka, M., & Zajac, P. (2014) · Tatra Mountains Mathematical Publications · doi:10.2478/tmmp-2014-0025 · Cited by 42
Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form
Faugère, J., Perret, L., & de Portzamparc, F. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45611-8_2 · Cited by 38
Post-quantum Cryptography: A Review on Cryptographic Solutions for the Era of Quantum Computing
Singh, M., Sood, S. K., & Bhatia, M. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10412-7 · Cited by 45
Medical IoT Record Security and Blockchain: Systematic Review of Milieu, Milestones, and Momentum
Ajakwe, S. O., Igboanusi, I. S., Ihekoronye, V. U., Nwankwo, O. U., Dini, M. A., Izuazu, U. U., Kim, D., & Lee, J. (2024) · Big Data and Cognitive Computing · doi:10.3390/bdcc8090121 · Cited by 36
Quantum Internet: Technologies, Protocols, and Research Challenges
Kumar, V., Cicconetti, C., Conti, M., & Passarella, A. (2025) · The International journal of networked and distributed computing · doi:10.1007/s44227-025-00060-5 · Cited by 37
“The second solution is the adoption of post-quantum cryptography [33], which employs classical systems designed to be secure against quantum attacks.”
Cryptanalysis of the Square Cryptosystems
Billet, O., & Macario-Rat, G. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10366-7_27 · Cited by 32
Zhang, F., Zhao, X., Guo, S., Wang, T., & Shi, Z. J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40026-1_5 · Cited by 32
Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH
Becker, A., & Laarhoven, T. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-31517-1_1 · Cited by 32
Reparaz, O., Roy, S. S., de Clercq, R., Vercauteren, F., & Verbauwhede, I. M. R. (2016) · Journal of Cryptographic Engineering · doi:10.1007/s13389-016-0126-5 · Cited by 32
“There are three main branches of post-quantum cryptosystems: based on codes, on multivariate quadratic equations or on lattices [2].”
BackgroundA Deception Model Robust to Eavesdropping Over Communication for Social Network Systems
Omolara, A. E., Jantan, A., Abiodun, O. I., Dada, K. V., Arshad, H., & Etuh, E. (2019) · IEEE Access · doi:10.1109/access.2019.2928359 · Cited by 34
“However, they remain work in progress, as their security is yet to be established, proven and standardized [43]–[45].”
BackgroundQuantum Cryptography: An Overview of Quantum Key Distribution
Rusca, D., & Gisin, N. (2024) · Elsevier eBooks · doi:10.1016/b978-0-323-95703-8.00103-8 · Cited by 35
Cryptographic Schemes Based on Isogenies
Stolbunov, A. (2012) · NVA (Nasjonalt vitenarkiv) · doi:10.13140/rg.2.2.20826.44488 · Cited by 71
Kolberg, J., Drozdowski, P., Gomez‐Barrero, M., Rathgeb, C., & Busch, C. (2020) · International Conference on Biometrics · Cited by 31
Authenticated Secure Quantum-Based Communication Scheme in Internet-of-Drones Deployment
Abulkasim, H., Goncalves, B., Mashatan, A., & Ghose, S. (2022) · IEEE Access · doi:10.1109/access.2022.3204793 · Cited by 37
“How-179 ever, securing communication channels in such schemes are based on classical cryptosystems, which are vulnerable to the 181 massive power of a quantum computer or classical computing 182 resources [5], [6].”
BackgroundAn Asymptotically Optimal Structural Attack on the ABC Multivariate Encryption Scheme
Moody, D., Perlner, R. A., & Smith-Tone, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_11 · Cited by 31
The debate over QKD: A rebuttal to the NSA's objectionsPreprint
Renner, R., & Wolf, R. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2307.15116 · Cited by 33
Quantum Computing Technological Design Along with Its Dark Side
Pithawa, D., Nahar, S., Bhardwaj, V., Rawat, R., Dronawat, R., & Rawat, A. (2023) · Wiley eBooks · doi:10.1002/9781394167401.ch18 · Cited by 30
Rana, A., Gautam, D., Kumar, P., & Das, A. K. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3423477 · Cited by 31
“Post-quantum cryptography (PQC) is a discipline devoted to creating novel cryptographic methods that can withstand assaults from quantum computers [227].”
Message-Recovery Laser Fault Injection Attack on the Classic McEliece Cryptosystem
Cayrel, P.-L., Colombier, B., Drăgoi, V., Menu, A., & Bossuet, L. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77886-6_15 · Cited by 34
“These schemes are called post-quantum secure [9].”
A Smart Card Implementation of the McEliece PKC
Strenzke, F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12368-9_4 · Cited by 34
Towards One Cycle per Bit Asymmetric Encryption: Code-Based Cryptography on Reconfigurable Hardware
Heyse, S., & Güneysu, T. E. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33027-8_20 · Cited by 30
Low-Reiter: Niederreiter Encryption Scheme for Embedded Microcontrollers
Heyse, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_13 · Cited by 30
Bardeen, C. J. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5117155 · Cited by 31
Bibliometric Analysis and Visualization of Quantum Engineering Technology
Sood, S. K., & Monika (2023) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2023.3313984 · Cited by 33
Resilience of Post-Quantum Cryptography in Lightweight IoT Protocols: A Systematic Review
Almutairi, M. M., & Sheldon, F. T. (2025) · Eng—Advances in Engineering · doi:10.3390/eng6120346 · Cited by 29
Secure and Anonymous Hybrid Encryption from Coding Theory
Persichetti, E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_12 · Cited by 29
Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes
Cayrel, P.-L., Hoffmann, G., & Persichetti, E. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30057-8_9 · Cited by 29
Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices
Heyse, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25405-5_10 · Cited by 29
The Impact of Quantum Computing on Cybersecurity
Emmanni, P. S. (2023) · Journal of Mathematical & Computer Applications · doi:10.47363/jmca/2023(2)140 · Cited by 31
“These cryptographic systems offer a promising path towards maintaining confidentiality and integrity in the quantum era [14].”
Post-Quantum Secure Blockchain-Based Federated Learning Framework for Healthcare Analytics
Commey, D., Hounsinou, S. G., & Crosby, G. V. (2025) · IEEE Networking Letters · doi:10.1109/lnet.2025.3563434 · Cited by 28
“Post-quantum cryptography (PQC) comprises algorithms designed to resist quantum attacks [8].”
Fast and Secure Routing Algorithms for Quantum Key Distribution Networks
Akhtar, M. S., Krishnakumar, G., Vishnu, B., & Sinha, A. (2023) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2023.3246114 · Cited by 29
“QKD schemes should be contrasted with the ongoing research on Post-Quantum Cryptography (PQC) that, although believed to be secure against attack with quantum computers, lacks formal guarantees for their security properties [10].”
ResultAlgebraic Attack on the MQQ Public Key Cryptosystem
Mohamed, M. S. E., Ding, J., Buchmann, J. A., & Werner, F. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10433-6_26 · Cited by 28
Performance analysis and evaluation of postquantum secure blockchained federated learning
Gurung, D., Pokhrel, S. R., & Li, G. (2024) · Computer Networks · doi:10.1016/j.comnet.2024.110849 · Cited by 35
Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation
Lemus, M., Ramos, M. F., Yadav, P., Silva, N. A., Muga, N. J., Souto, A., Paunković, N., Mateus, P., & Pinto, A. N. (2020) · Applied Sciences · doi:10.3390/app10124080 · Cited by 27
“These research initiatives have been following two paths, one based on the development of more hard-to-break classical cryptographic algorithms [6] and another based on quantum protocols [7].”
MethodInfluentialNoPUF: A Novel PUF Design Framework Toward Modeling Attack Resistant PUFs
Wang, A., Tan, W., Wen, Y., & Lao, Y. (2021) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2021.3067319 · Cited by 27
“Lattice-based post-quantum cryptography [53] can enhance the security but are computationally-intensive [54].”
BackgroundDevice-independent quantum key distribution using random quantum states
Bera, S., Gupta, S., & Majumdar, A. S. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03852-2 · Cited by 27
“There is another approach called postquantum cryptography which uses conventional cryptography to develop alternative public key encryption schemes that are hard even for a quantum computer to break [3].”
BackgroundNested Hash Access With Post Quantum Encryption for Mission-Critical IoT Communications
Xu, D., Liu, L., Zhang, N., Dong, M., Leung, V. C. M., & Ritcey, J. A. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3245360 · Cited by 27
“Besides, cryptographic security might be broken down against quantum attack as quantum computers can break current cryptosystems which are based on the hardness of factoring and discrete logarithm problems, e.g., Rivest– Shamir–Adleman (RSA) and elliptic curve cryptography (ECC) [17].”
BackgroundBlockchain-Enabled IoT for Rural Healthcare: Hybrid-Channel Communication with Digital Twinning
Kerrison, S., Jusak, J., & Huang, T. (2023) · Electronics · doi:10.3390/electronics12092128 · Cited by 29
Toward Legal Recognition of Artificial Intelligence Proposals for Limited Subject of law Status
Xudaybergenov, A. (2023) · International Journal of Law and Policy · doi:10.59022/ijlp.55 · Cited by 33
On the hardnesses of several quantum decoding problems
Kuo, K.-Y., & Lu, C.-C. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02622-8 · Cited by 34
“It is known that quantum stabilizer codes can be related to classical self-orthogonal codes [6–8].”
BackgroundGhost Polarization Communication
Rosskopf, M., Mohr, T., & Elsäßer, W. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.034062 · Cited by 29
Solving Degree and Degree of Regularity for Polynomial Systems over a Finite Fields
Ding, J., & Schmidt, D. S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42001-6_4 · Cited by 27
The Physics of Quantum Information
Sevrin, A. (2023) · doi:10.1142/13369 · Cited by 29
Quantum-machine-assisted drug discovery
Zhou, Y., Chen, J., Cheng, J., Cao, X., Zhang, Y., Karemore, G., Žitnik, M., Chong, F. T., Liu, J., Fu, T., et al. (2026) · npj Drug Discovery. · doi:10.1038/s44386-025-00033-2 · Cited by 33
“The integration of these quantum attack Advanced quantum cryptographic techniques, including blind quantum computing and post-quantum cryptography [180–182], enable secure computations on encrypted data while ensuring long-term protection against future quantum threats [183].”
Barrett-danes, F., & Ahmad, F. B. (2025) · Discover Applied Sciences · doi:10.1007/s42452-025-07322-5 · Cited by 34
“Field experiments by major institutions (e.g., Google’s hybrid TLS deployments) have revealed that PQC integration faces practical obstacles related to latency, memory overhead, and infrastructure compatibility [59].”
Grover on KATAN: Quantum Resource Estimation
Rahman, M., & Paul, G. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3140376 · Cited by 31
Distributed Learning in the IoT–Edge–Cloud Continuum
Arzovs, A., Judvaitis, J., Nesenbergs, K., & Selavo, L. (2024) · Machine Learning and Knowledge Extraction · doi:10.3390/make6010015 · Cited by 36
“For this reason, practitioners should also think ahead and plan their security approaches to be safe against such computing power [12].”
BackgroundQuantum-Computing-Based Channel and Signal Modeling for 6G Wireless Systems
Farouk, A., Abuali, N. A., & Mumtaz, S. (2024) · IEEE Communications Magazine · doi:10.1109/mcom.001.2200362 · Cited by 29
“However, this process will have a huge effect on 6G technology since it is not well understood how these algorithms will impact it, and the standardization migration process of these algorithms is complex [10].”
BackgroundPQSF: post-quantum secure privacy-preserving federated learning
Zhang, X., Deng, H., Wu, R., Ren, J., & Ren, Y. (2024) · Scientific Reports · doi:10.1038/s41598-024-74377-6 · Cited by 39
Braeken, A. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.107634 · Cited by 32
Tan, X., & Zhang, X. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1268-1 · Cited by 25
“However, post-quantum cryptography [33] is studied to resist quantum computers.”
BackgroundPublic-Key Cryptography Based on Tropical Circular Matrices
Huang, H., Li, C., & Deng, L. (2022) · Applied Sciences · doi:10.3390/app12157401 · Cited by 25
Making existing software quantum safe: A case study on IBM Db2
Zhang, L., Miranskyy, A. V., Rjaibi, W., Stager, G., Gray, M., & Peck, J. S. (2023) · Information and Software Technology · doi:10.1016/j.infsof.2023.107249 · Cited by 36
“…approach is post-quantum cryptography (PQC) — the focus of this paper — which is about preparing for the era of quantum computing by updating existing mathematical algorithms and encryption standards with classical cryptographic algorithms that are secure against both QCs and CCs [44, 45, 46].”
BackgroundHigh-Speed Signatures from Standard Lattices
Dagdelen, Ö., Bansarkhani, R. E., Göpfert, F., Güneysu, T. E., Oder, T., Pöppelmann, T., Sánchez, A. H., & Schwabe, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-16295-9_5 · Cited by 25
Ring signature scheme based on multivariate public key cryptosystems
Wang, S., Ma, R., Zhang, Y., & Wang, X. (2011) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2011.09.052 · Cited by 25
Quantum Authentication Evolution: Novel Approaches for Securing Quantum Key Distribution
Termos, H. (2024) · Entropy · doi:10.3390/e26060447 · Cited by 29
Kim, S., Pascuzzi, V. R., Xu, Z., Luo, T., Lee, E., & Suh, I. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01283-2 · Cited by 31
“This transformative technology harnesses the principles of quantum mechanics to process information in fundamentally new ways, revolutionizing various fi elds including cryptography, materials science, and arti fi cial intelligence 5 – 8 .”
PQS-BFL: A post-quantum secure blockchain-based federated learning framework
Commey, D., & Crosby, G. V. (2026) · Expert Systems with Applications · doi:10.1016/j.eswa.2026.131449 · Cited by 35
“Research is ongoing to evaluate PQC performance [27], [28] and integrate these schemes into existing protocols [7], [29].”
Post-Quantum Authentication Against Cyber-Physical Attacks in V2X-Based Autonomous Vehicle Platoon
Xu, D., Yu, K., Liu, L., Chen, G., Kumar, N., Guizani, M., & Ritcey, J. A. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3339787 · Cited by 24
“2) Quantum computers can break current cryptosystems based on the hardness of factoring and discrete log algorithms, e.g., Rivest Shamir Adleman (RSA) and elliptic curve cryptography(ECC) [14].”
BackgroundCheng, T., Liu, Q., Shi, Q., Yang, Z., Wang, C., Zhang, X., & Xu, P. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3384993 · Cited by 23
“However, with the emergence of quantum computing, the security of public-key encryption is compromised, and the security of encryption methods based on public–private keys becomes challenging to ensure [15].”
BackgroundChirp-Permuted AFDM for Quantum-Resilient Physical-Layer Secure Communications
Rou, H. S., & de Abreu, G. T. F. (2025) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2025.3570004 · Cited by 23
“This has motivated the development of post-quantum meth-ods, such as post-quantum cryptography [6] and quantum key encapsulation [7] and distribution [8], which exploit either the quantum entanglement phenomena or complex hash-and multivariate quadratic-based algorithms that remain unbreakable even…”
A quantum key distribution routing scheme for hybrid-trusted QKD network system
Chen, L., Chen, J., Chen, Q.-Y., & Zhao, Y. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03825-x · Cited by 23
“Groover’s algorithm [38] is the foundation for most of the positive applications that have been identified for quantum computing [39].”
BackgroundYang, Z. M., Shi, Q., Cheng, T., Wang, X., Zhang, R., & Yu, L. (2024) · Vehicular Communications · doi:10.1016/j.vehcom.2024.100789 · Cited by 23
Code-based cryptography on reconfigurable hardware: tweaking Niederreiter encryption for performance
Heyse, S., & Güneysu, T. E. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0056-4 · Cited by 23
Lattice-based signcryption with equality test in standard model
Le, H. Q., Duong, D. H., Roy, P. S., Susilo, W., Fukushima, K., & Kiyomoto, S. (2021) · Computer Standards & Interfaces · doi:10.1016/j.csi.2021.103515 · Cited by 23
Schletz, D., Schultz, J., Potapov, P. L., Steiner, A. M., Krehl, J., König, T. A. F., Mayer, M., Lubk, A., & Fery, A. (2021) · Advanced Optical Materials · doi:10.1002/adom.202001983 · Cited by 23
Survey on Lightweight Primitives and Protocols for RFID in Wireless Sensor Networks
Lata, M., & Kumar, A. M. (2022) · International Journal of Communication Networks and Information Security (IJCNIS) · doi:10.17762/ijcnis.v6i1.572 · Cited by 23
Darzi, S., Ahmadi, K., Aghapour, S., Yavuz, A. A., & Kermani, M. M. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2310.12037 · Cited by 27
Efficient unified architecture for post-quantum cryptography: combining Dilithium and Kyber
Dobiáš, P., Malina, L., & Hajný, J. (2025) · PeerJ Computer Science · doi:10.7717/peerj-cs.2746 · Cited by 22
Han, X., Wang, W., Liu, Y. J., Han, H., Shao, R., Wang, Z., Yang, X., Xie, M., & Cui, Y. (2025) · Angewandte Chemie International Edition · doi:10.1002/anie.202510219 · Cited by 22
Lightweight Encryption Algorithms for IoT
Silva, C., Tenório, N., & Bernardino, J. (2025) · Computers · doi:10.3390/computers14120505 · Cited by 23
“The transition to Post-Quantum Cryptography (PQC), which is resistant to quantum attacks, imposes new performance and implementation challenges [7].”
Linked or unlinked: A systematic review of linkable ring signature schemes
Odoom, J., Huang, X., Zhou, Z., Danso, S. A., Zheng, J., & Xiang, Y. (2022) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2022.102786 · Cited by 24
Fedorov, A. K. (2023) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2023.1164428 · Cited by 27
Counterfactual Quantum Byzantine Consensus for Human-Centric Metaverse
Paing, S. N., Setiawan, J. W., Ullah, M. A., Zaman, F., Duong, T. Q., Dobre, O. A., & Shin, H. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3345420 · Cited by 22
“To address these threats, blockchain must be equipped with post-quantum cryptography or transformed into a quantum blockchain [17], [18], [19].”
BackgroundEdge-Computing-Based Scheme for Post-Quantum IoT Security for e-Health
Minhas, N. N., & Mansoor, K. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3418959 · Cited by 23
Linear Recurring Sequences for the UOV Key Generation
Petzoldt, A., Bulygin, S., & Buchmann, J. A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19379-8_21 · Cited by 22
HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
Duc, A., & Vaudenay, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38553-7_6 · Cited by 26
Scaling efficient code-based cryptosystems for embedded platforms
Biasi, F. P., Barreto, P. S. L. M., Misoczki, R., & Ruggiero, W. V. (2014) · Journal of Cryptographic Engineering · doi:10.1007/s13389-014-0070-1 · Cited by 23
Factoring semi-primes with (quantum) SAT-solvers
Mosca, M., & Verschoor, S. R. (2022) · Scientific Reports · doi:10.1038/s41598-022-11687-7 · Cited by 27
“Mitigations for future systems and current systems requiring long-term security are being researched by the field of post-quantum cryptography [8, 12, 13].”
BackgroundSub-Poissonian photon squeezing and entanglement in optical chain second harmonic generation
Julius, R., Ibrahim, A.-B. M. A., Eleuch, H., & Choudhury, P. K. (2019) · Journal of Modern Optics · doi:10.1080/09500340.2019.1603408 · Cited by 22
Revisiting the Hybrid Attack on Sparse Secret LWE and Application to HE Parameters
Son, Y., & Cheon, J. H. (2019) · doi:10.1145/3338469.3358941 · Cited by 22
Towards global quantum key distribution
Zhang, H., Zhu, H.-T., He, R., Zhang, Y. T., Ding, C., Hanzo, L., & Gao, W. (2025) · Nature Reviews Electrical Engineering · doi:10.1038/s44287-025-00238-7 · Cited by 36
The Impact of Quantum Computing on Security in Emerging Technologies
Abuarqoub, A., Abuarqoub, S., Alzu’bi, A., & Muthanna, A. (2021) · International Conference on Future Networks and Distributed Systems (ICFNDS) · doi:10.1145/3508072.3508099 · Cited by 27
“Multivariate-based cryptosystems are based on the complexity of solving systems of multivariate equations, which have been proven to be NP-hard or NP-complete [34].”
BackgroundMulti-Phase Quantum Resistant Framework for Secure Communication in SCADA Systems
Ghosh, S., Zaman, M., Joshi, R., & Sampalli, S. (2024) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2024.3378474 · Cited by 26
Analyzing the research impact in post quantum cryptography through scientometric evaluation
Hanafi, B., & Ali, M. (2025) · Discover Computing · doi:10.1007/s10791-025-09507-3 · Cited by 25
Petzoldt, A., Thomae, E., Bulygin, S., & Wolf, C. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23951-9_31 · Cited by 21
Short Hash-Based Signatures for Wireless Sensor Networks
Dahmen, E., & Krauß, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10433-6_31 · Cited by 21
Cryptographic one-way function based on boson sampling
Nikolopoulos, G. M. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2372-9 · Cited by 27
Experimental relativistic zero-knowledge proofs
Alikhani, P., Brunner, N., Crépeau, C., Designolle, S., Houlmann, R., Shi, W., Yang, N., & Zbinden, H. (2021) · Nature · doi:10.1038/s41586-021-03998-y · Cited by 21
“This aspect is particularly relevant given recent advances on quantum computing [8, 9].”
BackgroundOn the Differential Security of Multivariate Public Key Cryptosystems
Smith-Tone, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25405-5_9 · Cited by 21
Secure Data Transmission Using Quantum Cryptography in Fog Computing
Mangla, C., Rani, S., & Atiglah, H. K. (2022) · Wireless Communications and Mobile Computing · doi:10.1155/2022/3426811 · Cited by 21
“Also, all the classical algorithms are venerable to quantum cryptography [10].”
BackgroundProxy Signature Scheme Based on Isomorphisms of Polynomials
Tang, S., & Xu, L. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34601-9_9 · Cited by 21
Cryptanalysis of Enhanced TTS, STS and All Its Variants, or: Why Cross-Terms Are Important
Thomae, E., & Wolf, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31410-0_12 · Cited by 21
Efficient Lattice-Based Signcryption in Standard Model
Yan, J., Wang, L., Yang, Y., Yang, Y., & Yao, W. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/702539 · Cited by 21
Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems.
Laarhoven, T., Pol, V. D. J., & Weger, D. B. B. (2012) · TU/e Research Portal · Cited by 21
Lattice-Based Threshold Secret Sharing Scheme and Its Applications: A Survey
Chen, J., Deng, H., Su, H., Yuan, M., & Ren, Y. (2024) · Electronics · doi:10.3390/electronics13020287 · Cited by 21
Analysis of Post-Quantum Cryptography in User Equipment in 5G and Beyond
Hoque, S., Aydeger, A., Zeydan, E., & Liyanage, M. (2025) · Conference on Local Computer Networks · doi:10.1109/lcn65610.2025.11146323 · Cited by 24
Adaptively Secure Identity-Based Identification from Lattices without Random Oracles
Rückert, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15317-4_22 · Cited by 20
Differential Properties of the HFE Cryptosystem
Daniels, T., & Smith-Tone, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_4 · Cited by 20
Khmelev, A. V., Duplinsky, A. V., Bakhshaliev, R. M., Ivchenko, E. I., Pismeniuk, L. V., Mayboroda, V., Nesterov, I., Chernov, A. N., Trushechkin, A. S., Kiktenko, E. O., et al. (2024) · Optics Express · doi:10.1364/oe.511772 · Cited by 20
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.