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

International Conference on Computing Methodologies and Communication (ICCMC)

Quantum-Resistant Cryptography: Evaluating Secure Key Exchange Methods

Mohammed Abdul Nayeem

Published Jul 1, 2026• 0 citations
Publisher
DOI
10.1109/iccmc69250.2026.11625195

Related papers

Quantum cryptography beyond key exchange

Jörn Müller‐Quade

Informatik - Forschung und Entwicklung•Sep 15, 2006•4 citations

QT-PAKE: Secure Messaging via Quantum-Safe Threshold PAKE

Zengpeng Li, Hao Zhu, Guangyu Liao +3 more

Password authentication is a prevalent method of user verification across the Internet, and its use extends to scenarios where resources are limited. However, current password authentication protocols primarily rely on traditional password authenticated key exchange (PAKE) protocols (e.g., SRP, OPAQUE), which are vulnerable to attacks by quantum adversaries. To date, no efficient quantum algorithm has been found to solve the common challenges in lattice-based cryptography. Therefore, quantum-resistant PAKE protocols are generally built upon lattice-based cryptography. In this work, we propose a threshold verifiable oblivious pseudorandom function () protocol based on secret sharing. We then integrate it into a PAKE protocol and present an instantiation of a quantum-safe threshold PAKE protocol () based on the Ring Learning with Errors (RLWE) assumption. This integration gives our PAKE protocol resistance to precomputation attacks, similar to OPAQUE. Furthermore, by incorporating thresholding techniques into the PAKE protocol, we mitigate the risk of single points of failure on the server side. Our protocol not only preserves the security guarantees of traditional PAKE schemes but also resists attacks from quantum adversaries. We also provide a comprehensive security analysis and evaluation of, providing valuable insights for its practical implementation.

IEEE Transactions on Consumer Electronics•Sep 18, 2025•0 citations

Secured and Quantum Resistant Key Exchange Cryptography Methods – A Comparison

Smita Bansod, Lata L. Ragha

The field of Cybersecurity methods and algorithms looks like a huge ocean. The selection of suitable methods is a challenging job based on the application. In the light of emerging new technologies, the selected cryptographic algorithm should be compatible with the new technology. This study helps in the selection of the appropriate key exchange cryptography method for a given application which requires secured communication. The strong, efficient, fast and quantum safe method chosen should further be analyzed, tested and verified for providing the desired throughput under heavy load conditions. The vulnerability of major cryptography algorithms to security attacks by Quantum algorithms is discussed in this study. The security level status of a few popular cryptography methods are compared with the post quantum resistant method of cryptography.

Interdisciplinary Research in Technology and Management (IRTM)•Feb 24, 2022•5 citations

Quantum Cryptography: Opportunities and Challenges

Andrzej Grzywak, George Pilch-Kowalczyk

Advances in intelligent and soft computing•Jan 1, 2009•5 citations

Quantum Cryptography: Exploring the Future of Secure Communication

International Research Journal of Modernization in Engineering Technology and Science•Jun 16, 2026•0 citations

A resistant quantum key exchange protocol and its corresponding encryption scheme

Shaowu Mao, Huanguo Zhang, Wanqing Wu +3 more

The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant quantum cryptography very urgent. This motivate us to design a new key exchange protocol and encryption scheme in this paper. Firstly, some acknowledged mathematical problems was introduced, such as ergodic matrix problem and tensor decomposition problem, the two problems have been proved to NPC hard. From the computational complexity prospective, NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them. From the algebraic structures prospective, non-commutative cryptography has been considered to resist quantum. The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures, so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures. Secondly, a new problem was constructed based on the introduced problems in this paper, then a key exchange protocol and a public key encryption scheme were proposed based on it. Finally the security analysis, efficiency, recommended parameters, performance evaluation and etc. were also been given. The two schemes has the following characteristics, provable security, security bits can be scalable, to achieve high efficiency, quantum resistance, and etc.

China Communications•Sep 1, 2014•12 citations
Password authentication is a prevalent method of user verification across the Internet, and its use extends to scenarios where resources are limited. However, current password authentication protocols primarily rely on traditional password authenticated key exchange (PAKE) protocols (e.g., SRP, OPAQUE), which are vulnerable to attacks by quantum adversaries. To date, no efficient quantum algorithm has been found to solve the common challenges in lattice-based cryptography. Therefore, quantum-resistant PAKE protocols are generally built upon lattice-based cryptography. In this work, we propose a threshold verifiable oblivious pseudorandom function () protocol based on secret sharing. We then integrate it into a PAKE protocol and present an instantiation of a quantum-safe threshold PAKE protocol () based on the Ring Learning with Errors (RLWE) assumption. This integration gives our PAKE protocol resistance to precomputation attacks, similar to OPAQUE. Furthermore, by incorporating thresholding techniques into the PAKE protocol, we mitigate the risk of single points of failure on the server side. Our protocol not only preserves the security guarantees of traditional PAKE schemes but also resists attacks from quantum adversaries. We also provide a comprehensive security analysis and evaluation of, providing valuable insights for its practical implementation.
The field of Cybersecurity methods and algorithms looks like a huge ocean. The selection of suitable methods is a challenging job based on the application. In the light of emerging new technologies, the selected cryptographic algorithm should be compatible with the new technology. This study helps in the selection of the appropriate key exchange cryptography method for a given application which requires secured communication. The strong, efficient, fast and quantum safe method chosen should further be analyzed, tested and verified for providing the desired throughput under heavy load conditions. The vulnerability of major cryptography algorithms to security attacks by Quantum algorithms is discussed in this study. The security level status of a few popular cryptography methods are compared with the post quantum resistant method of cryptography.
The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant quantum cryptography very urgent. This motivate us to design a new key exchange protocol and encryption scheme in this paper. Firstly, some acknowledged mathematical problems was introduced, such as ergodic matrix problem and tensor decomposition problem, the two problems have been proved to NPC hard. From the computational complexity prospective, NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them. From the algebraic structures prospective, non-commutative cryptography has been considered to resist quantum. The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures, so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures. Secondly, a new problem was constructed based on the introduced problems in this paper, then a key exchange protocol and a public key encryption scheme were proposed based on it. Finally the security analysis, efficiency, recommended parameters, performance evaluation and etc. were also been given. The two schemes has the following characteristics, provable security, security bits can be scalable, to achieve high efficiency, quantum resistance, and etc.