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

Advances in Applied Mathematics

An Efficient Authentication Protocol for QKD Classical Channels Based on Elliptic Curve Cryptography

鑫 金

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.12677/aam.2026.151040

Related papers

Authenticated-Encryption in the Quantum Key Distribution Classical Channel Using Post-Quantum Cryptography

Avani Prakasan, Kurunandan Jain, Prabhakar Krishnan

Quantum computers are much faster than traditional computers and can easily break all Asymmetric Cryptographic Algorithms like RSA, Diffie-Hellman, elliptic curve, etc. For the secure transition of data in the future, we should use Quantum Cryptography, which is an emerging cryptographic technique that can be used for the secure transmission of data in a quantum world. Quantum Cryptography provides unconditional security to the data which were transmitted. Quantum Cryptography uses two channels for communication - a classical channel and a quantum channel. However, authentication in the classical channel is currently done by the classical cryptographic algorithms that are not efficient and quantum-safe. In addition to that, the existing QKD schemes do not ensure confidentiality to the data transmitted through the classical channel. PostQuantum Cryptography(PQC) is a computational-security based cryptographic technique that is quantum-resistant. So, as a solution to the authentication and encryption inefficiencies in the classical channel, PQC can be used. Here we are proposing an Authenticated-Encryption Scheme in the classical channel using the PQC algorithms Falcon and NTRU that are Quantum safe.

International Conference on Intelligent Computing and Control Systems (ICICCS)•May 25, 2022•41 citations

Multiparameter QKD authentication protocol design over optical quantum channel

Nemanja N. Miljkovic, Aleksandar D. Stojanovic

Optical and Quantum Electronics•Aug 1, 2018•4 citations

Implementation of Quantum Key Distribution with Elliptic Curve Cryptography

H. P. Asha, Issac Diana Jeba Jingle

Lecture notes in networks and systems•Jan 1, 2026•0 citations

An Improvement on A Three-Party Authentication Key Exchange Protocol Using Elliptic Curve Cryptography

Zuowen Tan

The authentication key exchange protocol enables communication participants to authenticate each other and agree on the session key over an insecure public network. Recently, a three-party authentication key exchange protocol based on Elliptic curve cryptograph is proposed. In this paper, we improve the three-party encrypted key exchange protocol by bilinear maps. The proposed threeparty authentication key exchange protocol is provable secure under Computational Diffie-Hellman assumptions in the standard model. Furthermore, the novel protocol is more efficient.

Journal of Convergence Information Technology•Jun 30, 2010•13 citations

Post-Quantum Elliptic Curve Cryptography

Vladimir Soukharev

We propose and develop new schemes for post-quantum cryptography based on isogenies over elliptic curves. First we show that ordinary elliptic curves are have less than exponential security against quantum computers. These results were used as the motivation for De Feo, Jao and Pl\\^ut's construction of public key cryptosystems using supersingular elliptic curve isogenies. We extend their construction and show that isogenies between supersingular elliptic curves can be used as the underlying hard mathematical problem for other quantum-resistant schemes. For our second contribution, we propose is an undeniable signature scheme based on elliptic curve isogenies. We prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. This proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption. Finally, we also propose a security model for evaluating the security of authenticated encryption schemes in the post-quantum setting. Our model is based on a combination of the classical Bellare-Namprempre security model for authenticated encryption together with modifications from Boneh and Zhandry to handle message authentication against quantum adversaries. We give a generic construction based on Bellare-Namprempre for producing an authenticated encryption protocol from any quantum-resistant symmetric-key encryption scheme together with any digital signature scheme or MAC admitting any classical security reduction to a quantum-computationally hard problem. We apply the results and show how we can explicitly construct authenticated encryption schemes based on isogenies.

•May 16, 2016•1 citation

QKD Protocols Security Between Theory and Engineering Implementation

Hicham Amellal, Abdelmajid Meslouhi, Abderrahim El Allati +1 more

Springer eBooks•Dec 31, 2019•1 citation
Quantum computers are much faster than traditional computers and can easily break all Asymmetric Cryptographic Algorithms like RSA, Diffie-Hellman, elliptic curve, etc. For the secure transition of data in the future, we should use Quantum Cryptography, which is an emerging cryptographic technique that can be used for the secure transmission of data in a quantum world. Quantum Cryptography provides unconditional security to the data which were transmitted. Quantum Cryptography uses two channels for communication - a classical channel and a quantum channel. However, authentication in the classical channel is currently done by the classical cryptographic algorithms that are not efficient and quantum-safe. In addition to that, the existing QKD schemes do not ensure confidentiality to the data transmitted through the classical channel. PostQuantum Cryptography(PQC) is a computational-security based cryptographic technique that is quantum-resistant. So, as a solution to the authentication and encryption inefficiencies in the classical channel, PQC can be used. Here we are proposing an Authenticated-Encryption Scheme in the classical channel using the PQC algorithms Falcon and NTRU that are Quantum safe.
The authentication key exchange protocol enables communication participants to authenticate each other and agree on the session key over an insecure public network. Recently, a three-party authentication key exchange protocol based on Elliptic curve cryptograph is proposed. In this paper, we improve the three-party encrypted key exchange protocol by bilinear maps. The proposed threeparty authentication key exchange protocol is provable secure under Computational Diffie-Hellman assumptions in the standard model. Furthermore, the novel protocol is more efficient.
We propose and develop new schemes for post-quantum cryptography based on isogenies over elliptic curves. First we show that ordinary elliptic curves are have less than exponential security against quantum computers. These results were used as the motivation for De Feo, Jao and Pl\\^ut's construction of public key cryptosystems using supersingular elliptic curve isogenies. We extend their construction and show that isogenies between supersingular elliptic curves can be used as the underlying hard mathematical problem for other quantum-resistant schemes. For our second contribution, we propose is an undeniable signature scheme based on elliptic curve isogenies. We prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. This proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption. Finally, we also propose a security model for evaluating the security of authenticated encryption schemes in the post-quantum setting. Our model is based on a combination of the classical Bellare-Namprempre security model for authenticated encryption together with modifications from Boneh and Zhandry to handle message authentication against quantum adversaries. We give a generic construction based on Bellare-Namprempre for producing an authenticated encryption protocol from any quantum-resistant symmetric-key encryption scheme together with any digital signature scheme or MAC admitting any classical security reduction to a quantum-computationally hard problem. We apply the results and show how we can explicitly construct authenticated encryption schemes based on isogenies.