Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Security & Privacy

Postquantum Cryptography, Part 2

Johannes A Buchmann, Kristin Lauter, Michele Mosca

Published Sep 1, 2018• 6 citations
Publisher

Abstract

This is part 2 of IEEE Security & Privacy magazine’s special issue on Postquantum Cryptography. As explained in the introduction to part 1, public-key cryptography is indispensable for the security of open computer networks, particularly the Internet. Because of public-key cryptography’s relevance and quantum computers’ increasingly realistic threat to this technology, it’s necessary to come up with practical and secure postquantum cryptography—that is, public-key cryptography that can be expected to resist quantum computer attacks.

DOI
10.1109/msp.2018.3761714

Related papers

Postquantum Cryptography—State of the Art

Johannes A Buchmann, Kristin Lauter, Michele Mosca

Because of public-key cryptography’s relevance and quantum computers’ increasingly realistic threat to this technology, it’s necessary to come up with practical and secure postquantum cryptography. This special issue aims to present the state of the art and the grand challenges in postquantum cryptography and to discuss the transition of real-world systems to the new technology.

IEEE Security & Privacy•Jan 1, 2017•44 citations

Survey on Quantum-Safe Cryptography for PostQuantum Internet Security

MURALI KRISHNA DARA

The threats are existential to the traditional cryptosystems of public keys, including RSA, Diffie-Hellman, and elliptic curve cryptography (ECC), due to the rapid progress in quantum computing. Such algorithms as the Shor and Grover algorithms prove that as soon as large scale quantum computers are achieved, these classical cryptographic protocols will not provide any privacy and integrity to online communication. This has created an emergency to find post-quantum cryptography (PQC), or quantum-safe cryptography, which will resist attacks by both classical and quantum attackers. The paper is a review of the latest research and development in post-quantum cryptographic algorithms and their implementation in current security systems. We organize quantum-safe methods into significant organizations such as lattice-based, hash-based, multivariate polynomial-based and code-based encrypted communications. Each type has been evaluated critically based on computational efficiency, key sizes, speed of encryption/decryption and security proofs. The survey also examines the current standardization activities happening in the world and especially the U.S. National Institute of Standards and Technology (NIST) PQC competition, which lists candidate algorithms that have advanced to standard adoption. Besides this, the paper addresses hybrid cryptographic designs that use both classical and post-quantum bases in ensuring a seamless migration in the transition phase. Internet security protocols like TLS, VPNs and blockchain consensus as applications of PQC are examined in detail. Lastly, we pinpoint open research issues, which include creating lightweight PQC to support resource-constrained IoT devices, balancing performance and strong security assurances, and interoperability between the new PQC algorithms and existing infrastructures. Through detailed survey we inform the future of researchers, practitioners, and policymakers on the preparation of the post-quantum era of secure digital communications.

International Journal of Engineering Research and Science & Technology•Feb 6, 2024•0 citations

Quantum resistant public key cryptography

Ray A. Perlner, David A. Cooper

Public key cryptography is widely used to secure transactions over the Internet. However, advances in quantum computers threaten to undermine the security assumptions upon which currently used public key cryptographic algorithms are based. In this paper, we provide a survey of some of the public key cryptographic algorithms that have been developed that, while not currently in widespread use, are believed to be resistant to quantum computing based attacks and discuss some of the issues that protocol designers may need to consider if there is a need to deploy these algorithms at some point in the future.

Identity and Trust on the Internet•Apr 14, 2009•137 citations

Classical Solutions for Quantum Challenges: An Introduction to Postquantum Cryptography

Brad Long

Quantum computing has tremendous potential to change the world by solving many previously unsolvable problems. However, with this tremendous computational power comes threats to our existing technologies safeguarding the world's communication channels and data storage. Specifically, it threatens our standardized and widely deployed cryptographic systems that are in use today. These existing cryptosystems are based on mathematical techniques that are difficult (essentially infeasible) for a classical computer to solve. Quantum computing presents a threat since many previously infeasible problems are likely to become feasible or even easy to solve by a quantum computer. This paper briefly reviews quantum computing and its properties before studying related work into postquantum cryptography. The eventuality of quantum computing is discussed based on readily available research and public information, in addition to expert opinion, which then provides insight into the eventuality of postquantum cryptography and the validity of action, or inaction, around this research. Further topics focus on the standardization of postquantum cryptosystems, and future research trends and opportunities in the field of postquantum cryptography.

ACM SIGCAS Computers and Society•Sep 1, 2023•3 citations

Editor's Message to Special Issue of Computer Security Technologies for Quantum-Safe World

Noboru Kunihiro

It is widely known that widely used public-key cryptography, such as RSA cryptography, will be broken when large-scale quantum computing becomes real. Cryptography, security, and privacy technologies are expected to change when such an era arrives. Research and development and standardization for protecting secure communication, storage, and utilization of confidential and personal information are actively conducted worldwide. In this environment, there is a lot of problems to be solved, including the research and development of post-quantum cryptography and the secure migration to them, computer security techniques that do not rely on computational assumptions, and privacy protection techniques.

Journal of Information Processing•Jan 1, 2022•0 citations

Date Science: Post Quantum Safe Cryptography

Євгеній Олегович Маковей

New cryptographic techniques have emerged in recent decades that do provide protection against quantum threats. These techniques are termed “postquantum cryptography” and consist of techniques based on quantum properties of light that prevent interception of messages, as well as classic computational techniques, all of which were designed to resist quantum attacks emerging from the rapidly accelerating research field of quantum computation. This paper provides background information on post-quantum security. It explores the security threats against communication security and particularly against key exchange that are enabled by the development of quantum computers. The applied and theoretical aspects of quantum-cryptographic technologies are considered, which is designed to be a reference for those operating in the ICT space in fields other than information security and postquantum cryptography. The interrelated elements that make up the concept and content determined by the application of quantum cryptography are analyzed. The systematic analysis of quantum algorithms, quantum cryptography and quantum hashing are presented. The proper concept vehicle over is brought, in particular the concepts of singularity and supersingularity are determined for elliptic curves and theoretical positions, lyings in their basis, are examined. Terms which must be taken into account at the selection of elliptic curves for cryptographic applications are determined.

•May 1, 2019•0 citations
This is part 2 of IEEE Security & Privacy magazine’s special issue on Postquantum Cryptography. As explained in the introduction to part 1, public-key cryptography is indispensable for the security of open computer networks, particularly the Internet. Because of public-key cryptography’s relevance and quantum computers’ increasingly realistic threat to this technology, it’s necessary to come up with practical and secure postquantum cryptography—that is, public-key cryptography that can be expected to resist quantum computer attacks.
The threats are existential to the traditional cryptosystems of public keys, including RSA, Diffie-Hellman, and elliptic curve cryptography (ECC), due to the rapid progress in quantum computing. Such algorithms as the Shor and Grover algorithms prove that as soon as large scale quantum computers are achieved, these classical cryptographic protocols will not provide any privacy and integrity to online communication. This has created an emergency to find post-quantum cryptography (PQC), or quantum-safe cryptography, which will resist attacks by both classical and quantum attackers. The paper is a review of the latest research and development in post-quantum cryptographic algorithms and their implementation in current security systems. We organize quantum-safe methods into significant organizations such as lattice-based, hash-based, multivariate polynomial-based and code-based encrypted communications. Each type has been evaluated critically based on computational efficiency, key sizes, speed of encryption/decryption and security proofs. The survey also examines the current standardization activities happening in the world and especially the U.S. National Institute of Standards and Technology (NIST) PQC competition, which lists candidate algorithms that have advanced to standard adoption. Besides this, the paper addresses hybrid cryptographic designs that use both classical and post-quantum bases in ensuring a seamless migration in the transition phase. Internet security protocols like TLS, VPNs and blockchain consensus as applications of PQC are examined in detail. Lastly, we pinpoint open research issues, which include creating lightweight PQC to support resource-constrained IoT devices, balancing performance and strong security assurances, and interoperability between the new PQC algorithms and existing infrastructures. Through detailed survey we inform the future of researchers, practitioners, and policymakers on the preparation of the post-quantum era of secure digital communications.
Public key cryptography is widely used to secure transactions over the Internet. However, advances in quantum computers threaten to undermine the security assumptions upon which currently used public key cryptographic algorithms are based. In this paper, we provide a survey of some of the public key cryptographic algorithms that have been developed that, while not currently in widespread use, are believed to be resistant to quantum computing based attacks and discuss some of the issues that protocol designers may need to consider if there is a need to deploy these algorithms at some point in the future.
Quantum computing has tremendous potential to change the world by solving many previously unsolvable problems. However, with this tremendous computational power comes threats to our existing technologies safeguarding the world's communication channels and data storage. Specifically, it threatens our standardized and widely deployed cryptographic systems that are in use today. These existing cryptosystems are based on mathematical techniques that are difficult (essentially infeasible) for a classical computer to solve. Quantum computing presents a threat since many previously infeasible problems are likely to become feasible or even easy to solve by a quantum computer. This paper briefly reviews quantum computing and its properties before studying related work into postquantum cryptography. The eventuality of quantum computing is discussed based on readily available research and public information, in addition to expert opinion, which then provides insight into the eventuality of postquantum cryptography and the validity of action, or inaction, around this research. Further topics focus on the standardization of postquantum cryptosystems, and future research trends and opportunities in the field of postquantum cryptography.
It is widely known that widely used public-key cryptography, such as RSA cryptography, will be broken when large-scale quantum computing becomes real. Cryptography, security, and privacy technologies are expected to change when such an era arrives. Research and development and standardization for protecting secure communication, storage, and utilization of confidential and personal information are actively conducted worldwide. In this environment, there is a lot of problems to be solved, including the research and development of post-quantum cryptography and the secure migration to them, computer security techniques that do not rely on computational assumptions, and privacy protection techniques.
New cryptographic techniques have emerged in recent decades that do provide protection against quantum threats. These techniques are termed “postquantum cryptography” and consist of techniques based on quantum properties of light that prevent interception of messages, as well as classic computational techniques, all of which were designed to resist quantum attacks emerging from the rapidly accelerating research field of quantum computation. This paper provides background information on post-quantum security. It explores the security threats against communication security and particularly against key exchange that are enabled by the development of quantum computers. The applied and theoretical aspects of quantum-cryptographic technologies are considered, which is designed to be a reference for those operating in the ICT space in fields other than information security and postquantum cryptography. The interrelated elements that make up the concept and content determined by the application of quantum cryptography are analyzed. The systematic analysis of quantum algorithms, quantum cryptography and quantum hashing are presented. The proper concept vehicle over is brought, in particular the concepts of singularity and supersingularity are determined for elliptic curves and theoretical positions, lyings in their basis, are examined. Terms which must be taken into account at the selection of elliptic curves for cryptographic applications are determined.