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 Journal of Security and Networks

A quantum Diffie-Hellman protocol

Pranav Subramaniam, Abhishek Parakh

Published Jan 1, 2016• 7 citations
Publisher

Abstract

In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key. Additional 'slack' rotations are used to ensure that measurement of the commutative transformations always result in the same bit value, for legitimate party, in the absence of an eavesdropper. The performance of the quantum protocol is evaluated in terms of the number of exchanges needed for a given key size and the probability of detecting an eavesdropper. We also compare the proposed protocol with BB84.

DOI
10.1504/ijsn.2016.079277

Related papers

A quantum Diffie-Hellman protocol using commuting transformations

Pranav Subramaniam, Abhishek Parakh

In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key. Additional "slack" rotations are used to ensure that measurement of the commutative transformations always result in the same bit value, for legitimate party, in the absence of an eavesdropper. The performance of the quantum protocol is evaluated in terms of the number of exchanges needed for a given key size and the probability of detecting an eavesdropper.

IEEE International Conference on Advanced Networks and Telecommunications Systems•Dec 1, 2014•8 citations

A Quantum Diffie-Hellman Protocol

Pranav Subramaniam, Abhishek Parakh

In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations.

IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS)•Oct 1, 2014•5 citations

Implementing Diffie-Hellman key exchange using quantum EPR pairs

Sayonnha Mandal, Abhishek Parakh

This paper implements the concepts of perfect forward secrecy and the Diffie-Hellman key exchange using EPR pairs to establish and share a secret key between two non-authenticated parties and transfer messages between them without the risk of compromise. Current implementations of quantum cryptography are based on the BB84 protocol, which is susceptible to siphoning attacks on the multiple photons emitted by practical laser sources. This makes BB84-based quantum cryptography protocol unsuitable for network computing environments. Diffie-Hellman does not require the two parties to be mutually authenticated to each other, yet it can provide a basis for a number of authenticated protocols, most notably the concept of perfect forward secrecy. The work proposed in this paper provides a new direction in utilizing quantum EPR pairs in quantum key exchange. Although, classical cryptography boasts of efficient and robust protocols like the Diffie-Hellman key exchange, in the current times, with the advent of quantum computing they are very much vulnerable to eavesdropping and cryptanalytic attacks. Using quantum cryptographic principles, however, these classical encryption algorithms show more promise and a more robust and secure structure for applications. The unique properties of quantum EPR pairs also, on the other hand, go a long way in removing attacks like eavesdropping by their inherent nature of one particle of the pair losing its state if a measurement occurs on the other. The concept of perfect forward secrecy is revisited in this paper to attribute tighter security to the proposed protocol.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 21, 2015•7 citations

Quantum Diffie–Hellman key exchange

Georgios M. Nikolopoulos

The Diffie–Hellman key exchange plays a crucial role in conventional cryptography, as it allows two legitimate users to establish a common, usually ephemeral, secret key. Its security relies on the discrete-logarithm problem, which is considered to be a mathematical one-way function, while the final key is formed by random independent actions of the two users. In the present work we investigate the extension of Diffie–Hellman key exchange to the quantum setting, where the two legitimate users exchange independent random quantum states. The proposed protocol relies on the bijective mapping of integers onto a set of symmetric coherent states, and we investigate the regime of parameters for which the map behaves as a quantum one-way function. Its security is analyzed in the framework of minimum-error-discrimination and photon-number-splitting attacks, while its performance and the challenges in a possible realization are also discussed.

arXiv:2501.09568•APL Quantum•Jan 16, 2025•1 citation

An Alternative Diffie-Hellman Protocol

Eric Järpe

The Diffie–Hellman protocol, ingenious in its simplicity, is still the major solution in protocols for generating a shared secret in cryptography for e-trading and many other applications after an impressive number of decades. However, lately, the threat from a future quantum computer has prompted successors resilient to quantum computer-based attacks. Here, an algorithm similar to Diffie–Hellman is presented. In contrast to the classic Diffie–Hellman, it involves floating point numbers of arbitrary size in the generation of a shared secret. This can, in turn, be used for encrypted communication based on symmetric cyphers. The validity of the algorithm is verified by proving that a vital part of the algorithm satisfies a one-way property. The decimal part is deployed for the one-way function in a way that makes the protocol a post-quantum key generation procedure. This is concluded from the fact that there is, as of yet, no quantum computer algorithm reverse engineering the one-way function. An example illustrating the use of the protocol in combination with XOR encryption is given.

Cryptography•Feb 25, 2020•4 citations

Quantum Elgamal Cryptosystem

ADITYA AGRAWAL, Bhaskar Biswas, K.K. Shukla +1 more

Public key cryptography is extensively used for encryption, signing contracts and secure exchanges over the unreliable network.The findings of Shor in 1994, of a powerful algorithm which was based on quantum mechanics for computing discrete logarithms and factoring large integers sabotaged the security presumptions upon which the currently used public key cryptographic protocols are based, like ElGamal, RSA and ECC.However, few cryptosystems, known as post quantum cryptosystems, while not currently in wide use are considered to be resistant to such attacks.In this paper, a quantum version of ElGamal Cryptosystem is proposed whose security relies on the commutative rotation transformations and measurements in computational basis of qubits.An understanding of the new scheme over the quantum channels is provided.The proposed cryptosystem allows the party to send messages in the form of qubits over a quantum channel.Also the proposed protocol provides an opportunity for two parties to exchange keys which is considered as one of the major concerns while developing post quantum cryptosystems.

International Conference on Advances in Computing, Control and Networking (ACCN)•Feb 26, 2017•0 citations
In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key. Additional 'slack' rotations are used to ensure that measurement of the commutative transformations always result in the same bit value, for legitimate party, in the absence of an eavesdropper. The performance of the quantum protocol is evaluated in terms of the number of exchanges needed for a given key size and the probability of detecting an eavesdropper. We also compare the proposed protocol with BB84.
In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key. Additional "slack" rotations are used to ensure that measurement of the commutative transformations always result in the same bit value, for legitimate party, in the absence of an eavesdropper. The performance of the quantum protocol is evaluated in terms of the number of exchanges needed for a given key size and the probability of detecting an eavesdropper.
This paper implements the concepts of perfect forward secrecy and the Diffie-Hellman key exchange using EPR pairs to establish and share a secret key between two non-authenticated parties and transfer messages between them without the risk of compromise. Current implementations of quantum cryptography are based on the BB84 protocol, which is susceptible to siphoning attacks on the multiple photons emitted by practical laser sources. This makes BB84-based quantum cryptography protocol unsuitable for network computing environments. Diffie-Hellman does not require the two parties to be mutually authenticated to each other, yet it can provide a basis for a number of authenticated protocols, most notably the concept of perfect forward secrecy. The work proposed in this paper provides a new direction in utilizing quantum EPR pairs in quantum key exchange. Although, classical cryptography boasts of efficient and robust protocols like the Diffie-Hellman key exchange, in the current times, with the advent of quantum computing they are very much vulnerable to eavesdropping and cryptanalytic attacks. Using quantum cryptographic principles, however, these classical encryption algorithms show more promise and a more robust and secure structure for applications. The unique properties of quantum EPR pairs also, on the other hand, go a long way in removing attacks like eavesdropping by their inherent nature of one particle of the pair losing its state if a measurement occurs on the other. The concept of perfect forward secrecy is revisited in this paper to attribute tighter security to the proposed protocol.
The Diffie–Hellman key exchange plays a crucial role in conventional cryptography, as it allows two legitimate users to establish a common, usually ephemeral, secret key. Its security relies on the discrete-logarithm problem, which is considered to be a mathematical one-way function, while the final key is formed by random independent actions of the two users. In the present work we investigate the extension of Diffie–Hellman key exchange to the quantum setting, where the two legitimate users exchange independent random quantum states. The proposed protocol relies on the bijective mapping of integers onto a set of symmetric coherent states, and we investigate the regime of parameters for which the map behaves as a quantum one-way function. Its security is analyzed in the framework of minimum-error-discrimination and photon-number-splitting attacks, while its performance and the challenges in a possible realization are also discussed.
The Diffie–Hellman protocol, ingenious in its simplicity, is still the major solution in protocols for generating a shared secret in cryptography for e-trading and many other applications after an impressive number of decades. However, lately, the threat from a future quantum computer has prompted successors resilient to quantum computer-based attacks. Here, an algorithm similar to Diffie–Hellman is presented. In contrast to the classic Diffie–Hellman, it involves floating point numbers of arbitrary size in the generation of a shared secret. This can, in turn, be used for encrypted communication based on symmetric cyphers. The validity of the algorithm is verified by proving that a vital part of the algorithm satisfies a one-way property. The decimal part is deployed for the one-way function in a way that makes the protocol a post-quantum key generation procedure. This is concluded from the fact that there is, as of yet, no quantum computer algorithm reverse engineering the one-way function. An example illustrating the use of the protocol in combination with XOR encryption is given.
Public key cryptography is extensively used for encryption, signing contracts and secure exchanges over the unreliable network.The findings of Shor in 1994, of a powerful algorithm which was based on quantum mechanics for computing discrete logarithms and factoring large integers sabotaged the security presumptions upon which the currently used public key cryptographic protocols are based, like ElGamal, RSA and ECC.However, few cryptosystems, known as post quantum cryptosystems, while not currently in wide use are considered to be resistant to such attacks.In this paper, a quantum version of ElGamal Cryptosystem is proposed whose security relies on the commutative rotation transformations and measurements in computational basis of qubits.An understanding of the new scheme over the quantum channels is provided.The proposed cryptosystem allows the party to send messages in the form of qubits over a quantum channel.Also the proposed protocol provides an opportunity for two parties to exchange keys which is considered as one of the major concerns while developing post quantum cryptosystems.