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 401–500 of 1,003
Hacking Cryptographic Protocols with Advanced Variational Quantum Attacks
Aizpurua, B., Bermejo, P., Martínez, J. E., & Orús, R. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3718349 · Cited by 16
“Public-key cryptography can be employed for establishing the secret key that will be used in a symmetric protocol, the combination of both cryptographic methods often results in establishing more secure communication channels.”
Combined Quantum and Post-Quantum Security for Earth-Satellite Channels
Rani, A., Ai, X., Gupta, A. S., Adhikari, R. S., & Malaney, R. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00055 · Cited by 16
“Alternatively, post-quantum cryptography (PQC) primitives serve as a software-based option to more expensive QKD implementations [13].”
Kim, C., Kim, S.-H., Sohn, K., Son, Y., Kumar, M., & Kim, S. (2025) · Applied Sciences · doi:10.3390/app15147782 · Cited by 16
Rahman, R., Azad, M. S., Hasan, M. R., Shubha, S. E. U., & Mahdy, M. R. C. (2025) · IET Quantum Communication · doi:10.1049/qtc2.70016 · Cited by 13
Sánchez-Solano, S., Camacho-Ruiz, E., Martínez‐Rodríguez, M. C., & Brox, P. (2022) · Sensors · doi:10.3390/s22052057 · Cited by 14
“To deal with this threat, numerous efforts have been made in recent years in the search for algorithms resistant to quantum attacks (the so-called post-quantum algorithms) [27,28].”
BackgroundAdvancing the Security of LDACS
Mäurer, N., Gräupl, T., Schmitt, C., Rodosek, G. D., & Reiser, H. (2022) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2022.3189736 · Cited by 14
“Mainly due to the longevity of aeronautical communications, efficient quantum computers might be available during the life-cycle of LDACS, posing a serious risk for the underlying cryptography [14], [15].”
BackgroundMethodNovel area-efficient and flexible architectures for optimal Ate pairing on FPGA
Azzouzi, O., Anane, M., Koudil, M., Issad, M., & Himeur, Y. (2023) · The Journal of Supercomputing · doi:10.1007/s11227-023-05578-5 · Cited by 14
“This approach, as outlined in [49], allows for a faster computation of pairing.”
Picciariello, F., Vedovato, F., Orsucci, D., Dominguez, P. N., Zechel, T., Avesani, M., Padovan, M., Foletto, G., Calderaro, L., Dequal, D., et al. (2023) · GPS Solutions · doi:10.1007/s10291-023-01580-9 · Cited by 13
“Although new cryptographic algorithms are believed to be resilient to quantum computation attacks (Bernstein and Lange 2017), a more radical and long-term solution is to rely on Quantum Key Distribution (QKD).”
An Improved Threshold Ring Signature Scheme Based on Error Correcting Codes
Cayrel, P.-L., Alaoui, S. M. E. Y., Hoffmann, G., & Véron, P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31662-3_4 · Cited by 14
Verification Logics for Quantum ProgramsPreprint
Rand, R. W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.04304 · Cited by 13
“A number of quantum algorithms have been developed, including the celebrated Shor’s Algorithm (Shor, 1994), which efficiently solves the factorization problem, paving the way for the field of post-quantum cryptography (Bernstein et al., 2008).”
MethodTowards quantum‐secure software defined networks
Nosouhi, M. R., Sood, K., Chamola, V., Jeong, J. J., & Gaddam, A. (2023) · IET Quantum Communication · doi:10.1049/qtc2.12073 · Cited by 13
From Existing Quantum Key Distribution Systems Towards Future Quantum Networks
Noirie, L. (2024) · International Conference on Communications, Circuits and Systems · doi:10.1109/icccas62034.2024.10652815 · Cited by 12
Integrating Post-Quantum Cryptography into CoAP and MQTT-SN Protocols
Blanco-Romero, J., Lorenzo, V., Almenárez, F., Díaz-Sánchez, D., Campo, C., & García-Rubio, C. (2024) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc61673.2024.10733716 · Cited by 12
“To overcome this threat the usage of Post-Quantum Cryptography (PQC) is being proposed [5] and standardised [24]–[26].”
MethodPhotonic Layer Security in High-Speed Optical Communications
Sadot, D., Attia, I., Balasiano, O., Jonas, I., Yalinevich, Y., Alín, G., Keller, E., Shalom, H., & Wohlgemuth, E. (2024) · Journal of Lightwave Technology · doi:10.1109/jlt.2024.3520900 · Cited by 12
Benchmarking Fully Homomorphic Encryption Libraries in IoT Devices
Rahman, T., Osmani, A. M. I. M., Rahman, M. S., Shibly, M. M. A., & Islam, S. (2024) · International Conference on Networking, Systems and Security (NSysS) · doi:10.1145/3704522.3704546 · Cited by 15
Zhang, K., Lee, C. K. M., Tsang, Y. P., & Wu, C. H. (2025) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2025.3568158 · Cited by 16
“Some existing algorithms like Shor’s algorithm can efficiently factor large integers and solve discrete logarithm problems, which renders traditional key distribution schemes vulnerable to attacks [13].”
Quantum Machine Learning and Recent Advancements
Manjunath, T. D., & Bhowmik, B. R. (2023) · International Conference on Artificial Intelligence and Smart Communication (AISC) · doi:10.1109/aisc56616.2023.10085586 · Cited by 13
“This field is known as post-quantum cryptography (PQC) and is currently based on quantum computers’ inability to solve some problems based on Lattices quickly [17].”
MethodGeneric Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Rückert, M., Schneider, M., & Schröder, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13708-2_5 · Cited by 12
A public key cryptosystem based on data complexity under quantum environment
Wu, W., Zhang, H., Wang, H., Mao, S., Jia, J., & Liu, J. (2015) · Science China Information Sciences · doi:10.1007/s11432-015-5408-5 · Cited by 13
Security analysis of the W-OTS$^+$ signature scheme: Updating security bounds
Kudinov, M., Kiktenko, E. O., & Fedorov, A. K. (2021) · Математические вопросы криптографии · doi:10.4213/mvk362 · Cited by 12
A Panorama of Post-quantum Cryptography
Barreto, P. S. L. M., Biasi, F. P., Dahab, R., López-Hernández, J. C., Morais, E., de Oliveira, A. D. S., Pereira, G. C. C. F., & Ricardini, J. E. (2014) · Springer eBooks · doi:10.1007/978-3-319-10683-0_16 · Cited by 16
Quantum and classical oblivious transfer: A comparative analysis
Santos, M. B., Pinto, A. N., & Mateus, P. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12010 · Cited by 12
Díaz, R. D., Hernández–Álvarez, L., Encinas, L. H., & Queiruga‐Dios, A. (2021) · Transactions on computational science and computational intelligence · doi:10.1007/978-3-030-71017-0 · Cited by 12
Emergent Bioanalogous Properties of Blockchain-based Distributed Systems
Abramov, O., Bebell, K. L., & Mojzsis, S. J. (2021) · Origins of Life and Evolution of Biospheres · doi:10.1007/s11084-021-09608-1 · Cited by 16
“The commonly-used SHA-256 hashing algorithm (National Institute of Standards and Technology 2001) is considered resilient to future quantum computers (e.g., Chen et al. 2016; Bernstein and Lange 2017).”
MethodRosch-Grace, D., & Straub, J. (2021) · IEEE Conference on Technologies for Homeland Security (HST) · doi:10.1109/hst53381.2021.9619831 · Cited by 12
Characterizing NTRU-Variants Using Group Ring and Evaluating their Lattice Security.
Yasuda, T., Dahan, X., & Sakurai, K. (2015) · Cited by 12
Recent Progress in Code-Based Cryptography
Cayrel, P.-L., Alaoui, S. M. E. Y., Hoffmann, G., Meziani, M., & Niebuhr, R. (2011) · Communications in computer and information science · doi:10.1007/978-3-642-23141-4_3 · Cited by 12
Secure quantum communication with orthogonal states
Shukla, C., Banerjee, A., Pathak, A., & Srikanth, R. (2016) · International Journal of Quantum Information · doi:10.1142/s0219749916400219 · Cited by 12
Improved code-based identification schemePreprint
Cayrel, P.-L., & Véron, P. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1001.3017 · Cited by 12
Quantum secure two party authentication protocol for mobile devices
Moony, B., Barnwal, A. K., Singh, M., & Mishra, D. (2023) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-023-01534-5 · Cited by 11
Time‐Controlled Authentication Strategies for Molecular Information Transfer
Hu, M., Yang, M., Cheng, X., & Wu, T. (2024) · Small · doi:10.1002/smll.202400261 · Cited by 11
Nonlocal Integrable Equations in Soliton Theory
Ma, W. (2024) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-031-59539-4_11 · Cited by 16
Quantum-classical hybrid algorithm for solving the learning-with-errors problem on NISQ devices
Zheng, M., Zeng, J., Yang, W., Chang, P.-J., Lu, Q., Yan, B., Zhang, H., Wang, M., Wei, S., & Long, G. (2025) · Communications Physics · doi:10.1038/s42005-025-02126-w · Cited by 13
Bio-inspired cryptography based on proteinoid assemblies
Mougkogiannis, P., Ghadafi, E., & Adamatzky, A. (2025) · PLoS ONE · doi:10.1371/journal.pone.0324761 · Cited by 11
“Quantum resistance due to its biological basis [58], 2.”
Quantum-Resistant Blockchain Protocols for Secure Transactions
Puneyani, V., & Vivekananda Bhat, K. (2025) · IEEE Access · doi:10.1109/access.2025.3581955 · Cited by 11
The Power I Know: Zero-Knowledge Proofs and Their Transformative Role in the Future of Cryptography
Sud, E., Agarwal, S., & Upadhyay, L. (2025) · IEEE Access · doi:10.1109/access.2025.3599555 · Cited by 11
“For instance, protocols built on Elliptic Curve Cryptography (ECC) or pairing-based systems, like those used in zk-SNARKs, could be compromised if quantum hardware matures to the point of running Shor’s algorithm efficiently [20].”
Secure Variants of the Square Encryption Scheme
Clough, C., & Ding, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_12 · Cited by 11
Pitfalls of the Sublinear QAOA-Based Factorization Algorithm
Grebnev, S. V., Gavreev, M. A., Kiktenko, E. O., Guglya, A. P., Efimov, A., & Fedorov, A. K. (2023) · IEEE Access · doi:10.1109/access.2023.3336989 · Cited by 13
Gao, H., Dai, K., Wang, K., Li, R., Zhao, L., & Wu, M. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.123792 · Cited by 14
Web 3.0: A Survey on the Architectures, Enabling Technologies, Applications, and Challenges
Cao, B., Xiao, S., Shi, L. X., Wang, T., Chen, J., Wang, J., Ling, X., Xu, H., Zhang, S., & Liu, E. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3589692 · Cited by 25
“To avoid threats, post-quantum cryptography has also been proposed [32].”
A multivariate quadratic challenge toward post-quantum generation cryptography
Yasuda, T., Dahan, X., Huang, Y.-J., Takagi, T., & Sakurai, K. (2015) · ACM communications in computer algebra · doi:10.1145/2850449.2850462 · Cited by 11
“MPKC is thus a candidate for post-quantum cryptography [1].”
BackgroundQuantum exhaustive key search with simplified-DES as a case study
Almazrooie, M., Samsudin, A., Abdullah, R., & Mutter, K. N. (2016) · SpringerPlus · doi:10.1186/s40064-016-3159-4 · Cited by 13
“Consequently, other alternative solutions besides the factoring problem are investigated, such as code-based cryptography and lattice-based cryptography (Bernstein et al. 2008).”
MethodChean, L. T., Ponnusamy, V., & Fati, S. M. (2018) · IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE) · doi:10.1109/iscaie.2018.8405469 · Cited by 11
“Through the sequence, the period is 4, where it would repeat once it goes through this set of 4 number sequence [2, 4, 8, 1].”
BackgroundMethodPaul, S., & Niethammer, M. (2019) · at - Automatisierungstechnik · doi:10.1515/auto-2019-0019 · Cited by 13
A Pragmatic Analysis of Pre- and Post-Quantum Cyber Security Scenarios
Ali, A. (2021) · International Bhurban Conference on Applied Sciences and Technology (IBCAST) · doi:10.1109/ibcast51254.2021.9393278 · Cited by 11
Secure multiparty quantum key agreement against collusive attacks
Abulkasim, H., Mashatan, A., & Ghose, S. (2021) · Scientific Reports · doi:10.1038/s41598-021-88837-w · Cited by 11
Improving Security of Internet of Vehicles Based on Post-quantum Signatures with Systolic Divisions
Yi, H., Chi, R., Huang, X., Cai, X., & Nie, Z. (2022) · ACM Transactions on Internet Technology · doi:10.1145/3410445 · Cited by 11
Burr, J., Parakh, A., & Subramaniam, M. (2022) · Ubiquity · doi:10.1145/3547493 · Cited by 11
“However, these keys must be safely shared, and the security of the current classical key distribution protocols is based on mathematical problems and assumptions around how hard they are to solve with computers [4].”
Design of highly nonlinear confusion component based on entangled points of quantum spin states
Waseem, H. M., & Hwang, S. O. (2023) · Scientific Reports · doi:10.1038/s41598-023-28002-7 · Cited by 13
Capurro, R., Eldred, M., & Nagel, D. (2012) · Acatech-Studie · doi:10.1007/978-3-642-31943-3_2 · Cited by 12
Towards provably secure proxy signature scheme based on Isomorphisms of Polynomials
Tang, S., & Xu, L. (2013) · Future Generation Computer Systems · doi:10.1016/j.future.2013.06.003 · Cited by 11
Strenzke, F. (2011) · Journal of Cryptographic Engineering · doi:10.1007/s13389-011-0020-0 · Cited by 11
An Analysis of Leading Lattice-Based Asymmetric Cryptographic Primitives
Easttom, C. (2019) · IEEE Annual Computing and Communication Workshop and Conference (CCWC) · doi:10.1109/ccwc.2019.8666459 · Cited by 12
Exploring the RISC-V Vector Extension for the Classic McEliece Post-Quantum Cryptosystem
Pircher, S., Geier, J., Zeh, A., & Mueller-Gritschneder, D. (2021) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed51717.2021.9424273 · Cited by 11
“Concurrently, the National Institute of Standards and Technology (NIST) of the United States has already started moving forward with efforts towards standardization[2].”
BackgroundA Post-Quantum Secure Discrete Gaussian Noise Sampler
Agrawal, R., Bu, L., & Kinsy, M. A. (2020) · IEEE International Symposium on Hardware Oriented Security and Trust (HOST) · doi:10.1109/host45689.2020.9300275 · Cited by 12
“With efforts from the National Institute of Standards and Technology (NIST) [3] to standardize new encryption schemes for the post-quantum era, lattice-based cryptography has gained popularity.”
BackgroundLiu, T., Ramachandran, G. S., & Jurdak, R. (2024) · IEEE/ACM International Conference on Internet-of-Things Design and Implementation (IoTDI) · doi:10.1109/iotdi61053.2024.00019 · Cited by 10
“It is noteworthy that the PQC migration also faces challenges, and one significant challenge is that PQC algorithms are generally more complex, with significantly larger key and data sizes which may cause issues with computation and transmission costs [4].”
BackgroundPhysical unclonable functions and QKD-based authentication scheme for IoT devices using blockchain
Cunha, T. B. D., Kiran, M., Ranjan, R., & Vasilakos, A. V. (2024) · Internet of Things · doi:10.1016/j.iot.2024.101404 · Cited by 10
Toward a Common Understanding of Cryptographic Agility: A Systematic Review
Näther, C., Herzinger, D., Steghöfer, J.-P., Gazdag, S.-L., Hirsch, E., & Loebenberger, D. (2026) · IEEE Access · doi:10.1109/access.2026.3728196 · Cited by 18
“Furthermore, interoperability is still most frequently discussed in the context of protocols (e.g., [1], [7], [15], [22], [23], [31]).”
Chaudhry, U. H., Arshad, R., Khalid, A., Ray, I. G., & Hussain, M. (2025) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2025.110089 · Cited by 13
Authentication and security challenges for Unmanned Aerial Vehicles: A survey
Chandolia, L., Singh, P., Pal, O., Misbahuddin, M., Kumar, V., & Prakash, R. (2025) · Ad Hoc Networks · doi:10.1016/j.adhoc.2025.103842 · Cited by 11
An Efficient Quantum Blockchain Framework With Edge Computing for Privacy-Preserving 6G Networks
Singamaneni, K. K., Budati, A. K., Kolandaisamy, R. A. L., Dommeti, V. S., & Katragadda, S. (2025) · IEEE Access · doi:10.1109/access.2025.3592793 · Cited by 11
“Hash-based protocols are commonly used on blockchain due to their efficiency and integrity [28], [29], [30].”
QKD-KEM: Hybrid QKD Integration into TLS with OpenSSL Providers
Blanco-Romero, J., Otero-García, P., Sobral-Blanco, D., Mendoza, F. A., Vilas, A. F., & Redondo, R. P. D. (2025) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc65549.2025.11325973 · Cited by 15
“We propose hybrid approaches combining QKD with post-quantum cryptography (PQC) [4] to address these limitations.”
A simulator of optical coherent-state evolution in quantum key distribution systems
Caputo, C., Simoni, M., Cirillo, G. A., Turvani, G., & Zamboni, M. (2022) · Optical and Quantum Electronics · doi:10.1007/s11082-022-04041-8 · Cited by 12
“For this reason, the exchange of secure data in the quantum era will require the adoption of post-quantum (Bernstein and Lange 2017) algorithms, computationally hard for quantum computers, or symmetric cryptography, which shifts the security requirements from the algorithm to the distribution of…”
BackgroundWei, Z., & Guo, W. (2024) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2024.3369754 · Cited by 10
“However, most of these security algorithms could be compromised by eavesdroppers (Eve) equipped with powerful quantum computers [9], [10].”
BackgroundWang, Z., Yang, Y., Wang, J., Hou, J., Su, Y., & Yang, C. (2024) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2024.3465010 · Cited by 10
“Postquantum cryptography (PQC) aims to remain secure in scenario where the attacker has a large quantum computer [1].”
The Optimal Lattice Quantizer in Nine Dimensions
Allen, B., & Agrell, E. (2021) · Annalen der Physik · doi:10.1002/andp.202100259 · Cited by 10
Quantum algorithm for smoothed particle hydrodynamics
Au-Yeung, R., Williams, A. J., Kendon, V. M., & Lind, S. (2023) · Computer Physics Communications · doi:10.1016/j.cpc.2023.108909 · Cited by 14
“Quantum computers promise a way to perform highly complicated calculations that are infeasible on classical machines.”
A Lightweight Quantum-Safe Security Concept for Wireless Sensor Network Communication
Heigl, M., Schramm, M., & Fiala, D. (2019) · IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) · doi:10.1109/percomw.2019.8730749 · Cited by 10
Cybersecurity in Robotics: Challenges, Quantitative Modeling, and Practice
Zhu, Q., Raß, S., Dieber, B., & Vilches, V. M. (2021) · doi:10.1561/9781680838619 · Cited by 10
Quantum security and 6G critical infrastructure
Hoschek, M. (2021) · Serbian Journal of Engineering Management · doi:10.5937/sjem2101001h · Cited by 10
Designing and Delivering a Post-Quantum Cryptography Course
Borrelli, T. J., Polak, M., & Radziszowski, S. (2024) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/3626252.3630823 · Cited by 9
Maqsood, T. B., Hameed, K., Junaid, M., & Tahir, N. (2025) · International Conference on Advancements in Computational Sciences (ICACS) · doi:10.1109/icacs64902.2025.10937815 · Cited by 10
“Thus, designing and applying PQC solutions in IoT devices is crucial to guarantee that the data and managed networks are secure in the long run [13].”
Post-Quantum Secure Authenticated Key Agreement Scheme for Vehicular Digital Twin
Cui, J., Liu, J., Wei, L., Bolodurina, I. P., Li, J., & Zhong, H. (2025) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2025.3618752 · Cited by 12
“Currently, the techniques for constructing post-quantum cryptosystems [11] are hash-based, code-based, lattice-based, and so on.”
Learning Parity with Physical Noise: Imperfections, Reductions and FPGA Prototype
Bellizia, D., Hoffmann, C., Kamel, D., Liu, H., Méaux, P., Standaert, F., & Yu, Y. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i3.390-417 · Cited by 9
Modular Design of KEM-Based Authenticated Key Exchange
Boyd, C., de Kock, B., & Millerjord, L. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-35486-1_24 · Cited by 9
“The looming threat of quantum computers has brought about an increasingly pressing need to find post-quantum secure replacements for DH, which itself is well known to be broken by Shor’s quantum algorithm for finding discrete logarithms [BL17].”
BackgroundAutomated Issuance of Post-Quantum Certificates: A New Challenge
Giron, A. A., Schardong, F., Perin, L. P., Custódio, R. F., Valle, V. G., & Mateu, V. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-54773-7_1 · Cited by 11
“The cryptographic algorithms that can execute on a classical computer and offer security against attackers with access to a CRQC are called Post-Quantum Cryptography (PQC) [2].”
MethodQiu, T., Deng, L., Yang, Q., Dai, X., Liu, D., & Cheng, M. (2024) · Optics Letters · doi:10.1364/ol.517847 · Cited by 9
Censorship of quantum resources in quantum networks
Pinske, J., & Mølmer, K. (2024) · Physical Review A · doi:10.1103/physreva.110.062404 · Cited by 9
Quantum Blockchain for Internet of Things: A systematic review, proposed solutions and challenges
Chawla, D., Kumari, S., Rathore, R. S., Mehra, P. S., Das, A. K., & Kumar, N. (2025) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2025.110524 · Cited by 10
Cryptanalysis of Cryptosystems Based on Non-commutative Skew Polynomials
Dubois, V., & Kammerer, J.-G. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19379-8_28 · Cited by 9
Strenzke, F. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33383-5_8 · Cited by 9
Trapped-ion entangling gates robust against qubit frequency errors
Lishman, J., & Mintert, F. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033117 · Cited by 12
“A device at this level is proven to have computational capabilities for certain classes of problems which exceed any possible classical computer [1,2] and would have major applications in a broad range of fields spanning all the physical and computational sciences [3–5], making an inherently quantum…”
BackgroundQKD in Support of Secured P2P and P2MP Key Exchange for Low-Latency 5G Connectivity
Ntanos, A., Zavitsanos, D., Giannoulis, G., & Avramopoulos, H. (2020) · IEEE 5G World Forum (5GWF) · doi:10.1109/5gwf49715.2020.9221197 · Cited by 9
A Calibration-Free In-Memory True Random Number Generator Using Voltage-Controlled MRAM
Yang, J., Wu, D., Lee, A., Razavi, S. A., Gupta, P., Wang, K. L., & Pamarti, S. (2021) · European Solid-State Device Research Conference · doi:10.1109/essderc53440.2021.9631784 · Cited by 11
“To prevent security problems in the post-quantum cryptography, much longer keys are required [1].”
BackgroundPilot-Based Key Distribution and Encryption for Secure Coherent Passive Optical Networks
Wang, H., Zhou, J., Lu, Q., Zeng, J., Liao, Y., Liu, W., Yu, C., & Li, Z. (2023) · Journal of Lightwave Technology · doi:10.1109/jlt.2023.3348296 · Cited by 9
“However, post-quantum cryptography faces the challenge of realizing cryptographic usability and flexibility, while maintaining a high level of confidence [19].”
BackgroundExtended Lattice Reduction Experiments using the BKZ Algorithm
Schneider, M., & Buchmann, J. A. (2010) · Cited by 9
Lattice Polly Cracker cryptosystems
Caboara, M., Caruso, F., & Traverso, C. E. (2010) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2010.10.004 · Cited by 9
Improving BDD Cryptosystems in General Lattices
Rose, M., Plantard, T., & Susilo, W. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21031-0_12 · Cited by 9
On the security of MQ cryptographic systems for constructing secure Internet of medical things
Yi, H., & Nie, Z. (2018) · Personal and Ubiquitous Computing · doi:10.1007/s00779-018-1149-y · Cited by 9
Proof of plaintext knowledge for code-based public-key encryption revisited
Hu, R. L., Morozov, K., & Takagi, T. (2013) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2484313.2484385 · Cited by 11
Towards Algebraic Cryptanalysis of HFE Challenge 2
Mohamed, M. S. E., Ding, J., & Buchmann, J. A. (2011) · Communications in computer and information science · doi:10.1007/978-3-642-23141-4_12 · Cited by 9
Key Establishment à la Merkle in a Quantum World
Brassard, G., Høyer, P., Kalach, K., Kaplan, M., Laplante, S., & Salvail, L. (2019) · Journal of Cryptology · doi:10.1007/s00145-019-09317-z · Cited by 10
Critical attacks in code-based cryptography
Cayrel, P.-L., Gueye, C. T., Ndiaye, O. B., & Niebuhr, R. (2015) · International Journal of Information and Coding Theory · doi:10.1504/ijicot.2015.072639 · Cited by 9
Quantum-Machine-Assisted Drug Discovery: Survey and PerspectivePreprint
Zhou, Y., Karemore, G., Li, W., Liang, Z., Žitnik, M., Chong, F. T., Liu, J., & Fu, T. (2024) · Preprints.org · doi:10.20944/preprints202408.1950.v1 · Cited by 11
Quantum Computing: A Concise Introduction
Lund, B. D., & Shahriar, S. (2025) · Encyclopedia · doi:10.3390/encyclopedia5040173 · Cited by 11
The resource cost of large scale quantum computing
Fellous-Asiani, M. (2021) · theses.fr (ABES) · doi:10.70675/d1a944bez79cez43e1zaefcz785bf1e97f74 · Cited by 13
Quantum-safe identity-based designated verifier signature for BIoMT
Li, C., Chen, Y., Dong, M., Li, J., Huang, M., Xin, X., & Ota, K. (2025) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2025.103362 · Cited by 8
Toward a Privacy-Preserving and Secure Smart City: Recent Advances in User-Centric Applications
Momeni, M. R., Jabbari, A., Fung, C., & Boutaba, R. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3607211 · Cited by 9
“A powerful quantum computer, equipped with a sufficient number of qubits and high-quality quantum gates, can not only break numerous asymmetric encryption algorithms but also weaken the security of symmetric encryption algorithms [167].”
Future Digital Identity Management With Quantum Secure Blockchain
Bhoi, S. S., Saini, A., Diro, A. A., Kaisar, S., & Rao, A. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3608794 · Cited by 12
“Increased key sizes and computational requirements of some PQC algorithms could impact performance, and more research is needed to address this, as well as the need for seamless interoperability with existing systems [10], [62], [130].”
Zaheer, A. N., Farhan, M., Naeem, M. R., & Alnfiai, M. M. (2025) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2025.3619556 · Cited by 8
“They use very limited resources on processing power, memory, and energy for the operation of these devices, which makes it unfeasible to implement computationally intensive PQC algorithms [10], [11].”
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.