Abstract In order to solve the issue that traditional secure remote password (SRP) protocols cannot resist the active quantum computing attack, a simple and efficient SRP protocol based on post quantum algorithm Kyber named KSRP is proposed. In the protocol, the asymmetrical key consensus algorithm (AKCN) and post quantum algorithm are used to implement authenticated key exchange. This scheme can resist password recovery, Denning-Sacco’s attack and other attacks after being analyzed, which satisfies provable security under eCK model and indistinguishable game model. Compared with the traditional password authenticated key exchange (PAKE) protocols based on classical hard mathematical problems, this protocol refers to the generation method on the temporary public key and private key in the post quantum public key encryption algorithm Kyber, which enhances the security of process parameters. In addition, the scheme uses compression functions for the transmitted session public key to reduce communication overhead and improve security. After being tested in the LWE tester tool SageMathCell, the security of this protocol can reach 313 bits, which is 2.79 times the traditional SRP protocol, and 3.91 times J-PAKE protocol, also is higher 70.1% than Ding’s RLWE-PAK and RLWE-PPK protocols. The communication overhead in the protocol is only higher about 16% of post-quantum PPK and PAK protocols. This protocol is simple, efficient, and resistant to quantum computing active attacks, which can be applied in remote authenticated key exchange in cloud networks.
Abstract In order to solve the issue that traditional secure remote password (SRP) protocols cannot resist the active quantum computing attack, a simple and efficient SRP protocol based on post quantum algorithm Kyber named KSRP is proposed. In the protocol, the asymmetrical key consensus algorithm (AKCN) and post quantum algorithm are used to implement authenticated key exchange. This scheme can resist password recovery, Denning-Sacco’s attack and other attacks after being analyzed, which satisfies provable security under eCK model and indistinguishable game model. Compared with the traditional password authenticated key exchange (PAKE) protocols based on classical hard mathematical problems, this protocol refers to the generation method on the temporary public key and private key in the post quantum public key encryption algorithm Kyber, which enhances the security of process parameters. In addition, the scheme uses compression functions for the transmitted session public key to reduce communication overhead and improve security. After being tested in the LWE tester tool SageMathCell, the security of this protocol can reach 313 bits, which is 2.79 times the traditional SRP protocol, and 3.91 times J-PAKE protocol, also is higher 70.1% than Ding’s RLWE-PAK and RLWE-PPK protocols. The communication overhead in the protocol is only higher about 16% of post-quantum PPK and PAK protocols. This protocol is simple, efficient, and resistant to quantum computing active attacks, which can be applied in remote authenticated key exchange in cloud networks.
Secure Remote Password (SRP) protocol is an essential password-authenticated key exchange (PAKE) protocol based on the discrete logarithm problem (DLP). The protocol is specifically designed to obtain a session key and it has been widely used in various scenarios due to its attractive security features. In the SRP protocol, the server is not required to save any data directly associated with passwords. And this makes attackers who manage to corrupt the server fail to impersonate the client unless performing a brute-force search for the password. However, the development of quantum computing has potentially made classic DLP-based public-key cryptography schemes not secure, including the SRP protocol. So it is significant to design a quantum-resistant SRP protocol. In this paper, based on the original scheme, we propose a post-quantum SRP protocol from the learning with errors (LWE) problem. And we give rigorous proof and analyses on the correctness and security of the scheme. Besides being resistant to known quantum attacks, it maintains the various secure qualities of the original protocol.
Secure Shell (SSH) is a widely used cryptographic protocol that establishes secure and encrypted communication over potentially untrusted networks, primarily supporting remote login and command-line execution. The SSH Transport Layer Protocol relies on the classical Elliptic Curve Diffie-Hellman (ECDH) key exchange mechanism, which derives its security from the computational hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP). However, with the emergence of quantum computing, the ECDLP can be solved efficiently, making traditional SSH protocols vulnerable to quantum attacks. To mitigate this threat, several approaches combining classical and post-quantum cryptographic techniques have been proposed; however, security analyses have revealed vulnerabilities to critical attacks. In response, we propose a post-quantum key exchange protocol for SSH, utilising the Split-Key Encapsulation Mechanism (KEM). The key generated through this protocol can then be used for subsequent communication tasks, such as authentication. The security of the proposed protocol is formally validated using the Real-Or-Random (ROR) model and the Scyther tool. Furthermore, we perform a comparative evaluation in terms of computational and communication costs to assess execution time and conduct a testbed analysis, demonstrating that the proposed scheme can be efficiently implemented in real-world applications. The comparative analysis reveals that the designed post-quantum secure protocol reduces computational cost by up to 98% compared to its competitors.
The Password-Authenticated Key Exchange (PAKE) protocol is a useful tool for establishing secure remote communication between users, especially given the prevalence of amplifying a human-memorable password into a strong session key in the age of hand-held devices. Recent advances in quantum computing have stimulated interest in quantum-safe cryptographic schemes. Therefore, we propose QSPAK and QSPPK, two post-quantum and efficient PAKE protocols which are parallel extensions of PAK and PPK, but based on the hardness assumption over module lattices. Specifically, we make a comprehensive trade-off among multiple significant performance indicators such as the post-quantum security, the failure rate, the communication cost and the running time to guide optimal parameter choices. This rigorous instantiation has never been seen in previous PAKE papers. Additionally, utilizing the flexibility of module lattices, we provide three parameter sets (#1, #2, and #3) matching different security scenarios. We implement and benchmark QSPAK and QSPPK against other competitive proposals. The performance results indicate that our QSPAK and QSPPK, besides being more efficient, exhibit the flexibility and security advantages over the latter schemes. Furthermore, we construct a post-quantum password-authenticated TLS 1.3 framework, aimed towards provide a further suggestion for IETF standardization of quantum-safe PAKE.
Recent advances in quantum computing threaten key exchange protocols based on problems like prime factorization and discrete logarithms. In response, NIST is standardizing post-quantum cryptographic methods, selecting CRYSTALS-Kyber for its efficiency. However, Kyber’s key exchange protocol assumes prior authenticated communication and requires significant computational overhead. To address these limitations, we propose a NIST-compliant, quantum-resistant, password-authenticated key exchange protocol for mobile devices. Built on Kyber’s encryption primitives, it achieves mutual authentication and perfect forward secrecy. Compared to Kyber’s original protocol, ours reduces communication and computation costs by 46% and 67%, respectively. It also ensures strong anonymity and resists common attacks. Formal proofs and hardware implementation confirm its security and efficiency.
In emerging environments such as cloud computing and the Internet of Things (IoT), secure authentication and key negotiation play a crucial role in protecting data transmitted over public networks. However, many existing authentication protocols are still designed based on classical public-key cryptography primitives, and quantum computing may threaten their security. To address this challenge, we propose a post-quantum authentication and key agreement protocol that uses the lattice-based Kyber key encapsulation mechanism (KEM). Our proposed protocol integrates cryptographic authentication, smart card protection, and post-quantum key encapsulation mechanisms, enabling mutual authentication between users and servers and securely establishing session keys. The security of the protocol is formally analyzed in the Real-or-Random (ROR) model under the random oracle assumption and the IND-CCA security of the underlying KEM scheme. Furthermore, through informal security analysis, we have further demonstrated that the protocol possesses important security properties, including anonymity, untraceability, perfect forward confidentiality, and resistance to known attacks. In addition, the computational cost and communication overhead of the proposed scheme are evaluated and compared with several representative authentication protocols. The results show that the proposed protocol can provide strong security while maintaining low computational cost and communication overhead.
Abstract - In the emerging era of quantum computing, traditional cryptographic algorithms such as RSA and Elliptic Curve Cryptography (ECC) are at risk from quantum-based attacks. These developments pose a significant threat to secure network communication systems that rely on classical key exchange mechanisms. To overcome this challenge, the proposed work introduces a Hybrid Quantum-Resistant Key Exchange Protocol that combines the strengths of both classical andpost-quantum cryptographic algorithms. The hybrid approach integrates Elliptic Curve Dif ie–Hellman (ECDH) with alattice-based post-quantum algorithm, Kyber, to establish a shared session key between communicating entities. This sharedkeyisthen utilized for symmetric encryption using AES to ensure confidentiality and data integrity. The system is implementedusingPython socket programming to demonstrate secure data transmission between client and server. Performance is analyzedinterms of key generation time, encryption and decryption speed, key size, and computational ef iciency. The results validatethatthe proposed hybrid model provides enhanced resistance against quantum attacks while maintaining acceptable performance, making it suitable for future secure communication systems. Keywords - elliptic curve dif ie–hellman, hybrid key exchange, kyber, post-quantum cryptography, quantum computing.