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

A Survey on Post-Quantum Key Exchange

Sitnikov, Konstantin

Published Oct 1, 2017• 0 citations
OpenAlex

Related papers

Post-Quantum Cryptography and Quantum Key Distribution: An In-Depth Survey of Techniques, Comparative Study, and Future Trends

Ginni Garg, Arti Garg

•Jan 1, 2025•1 citation

On the Theory and Design of Post-Quantum Authenticated Key-Exchange, Encryption and Signatures

Cyprien Delpech de Saint Guilhem

key exchange protocol. . .

•Mar 1, 2021•0 citations

A Comprehensive Survey of Post-Quantum Cryptography and Its Implications

Bharat S. Rawal, Anjan Biswas

Cryptography has been in existence since before the advent of computers. It encompasses a variety of techniques designed to secure information, whether it is at rest or in transit. Symmetric key cryptography includes symmetric keys, which serve the dual purpose of encrypting and decoding communications. Descriptions have been provided for public/private key pairs, also known as asymmetric keys. Such pairs may be categorized as secret/public key pairs, where the private key remains confidential, while the public key is accessible to all relevant parties for communication and information exchange. The realm of private and public key cryptography is diverse. Recently, the National Institute of Standards and Technology (NIST) endorsed four post-quantum cryptography systems. This paper presents a comprehensive survey of cryptography, examining the implications of intricate cryptographic systems on our existing networks.

Engineering Science & Technology•Mar 25, 2024•10 citations

Multi-party post-quantum key exchange schemes

Xuejun Fan, Fei Zhao, Xiu Ping Xu

Journal of Information Security and Applications•Oct 28, 2025•0 citations

A survey on NIST PQ signatures

Nicola Di Chiano, Riccardo Longo, Alessio Meneghetti +1 more

Shor's shockingly fast quantum algorithm for solving the period-finding problem is a threat for the most common public-key primitives, as it can be efficiently applied to solve both the Integer Factorisation Problem and the Discrete Logarithm Problem. In other words, many once-secure protocols have to be replaced by still-secure alternatives. Instead of relying, for example, on the RSA protocol, the Diffie-Hellman key-exchange or the (Elliptic Curve) Digital Signature Algorithm, many researchers moved their attention to the design and analysis of primitives which are yet to be broken by quantum algorithms. The urgency of the threat imposed by quantum computers led the U.S. National Institute of Standards and Technology (NIST) to open calls for both Post-Quantum Public-Keys Exchange Algorithms and Post-Quantum Digital Signature Algorithms. In this brief survey we focus on the round 3 finalists and alternate candidates for Digital Signatures: CRYSTALS-DILITHIUM, FALCON, Rainbow, SPHINCS+, GeMSS, Picnic.

arXiv:2107.11082•Jul 23, 2021•4 citations

Post-quantum hybrid key exchange: a systematic mapping study

Alexandre Augusto Giron, Ricardo Felipe Custódio, Francisco Rodríguez‐Henríquez

Journal of Cryptographic Engineering•Apr 11, 2022•34 citations
Cryptography has been in existence since before the advent of computers. It encompasses a variety of techniques designed to secure information, whether it is at rest or in transit. Symmetric key cryptography includes symmetric keys, which serve the dual purpose of encrypting and decoding communications. Descriptions have been provided for public/private key pairs, also known as asymmetric keys. Such pairs may be categorized as secret/public key pairs, where the private key remains confidential, while the public key is accessible to all relevant parties for communication and information exchange. The realm of private and public key cryptography is diverse. Recently, the National Institute of Standards and Technology (NIST) endorsed four post-quantum cryptography systems. This paper presents a comprehensive survey of cryptography, examining the implications of intricate cryptographic systems on our existing networks.
Shor's shockingly fast quantum algorithm for solving the period-finding problem is a threat for the most common public-key primitives, as it can be efficiently applied to solve both the Integer Factorisation Problem and the Discrete Logarithm Problem. In other words, many once-secure protocols have to be replaced by still-secure alternatives. Instead of relying, for example, on the RSA protocol, the Diffie-Hellman key-exchange or the (Elliptic Curve) Digital Signature Algorithm, many researchers moved their attention to the design and analysis of primitives which are yet to be broken by quantum algorithms. The urgency of the threat imposed by quantum computers led the U.S. National Institute of Standards and Technology (NIST) to open calls for both Post-Quantum Public-Keys Exchange Algorithms and Post-Quantum Digital Signature Algorithms. In this brief survey we focus on the round 3 finalists and alternate candidates for Digital Signatures: CRYSTALS-DILITHIUM, FALCON, Rainbow, SPHINCS+, GeMSS, Picnic.