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

MODELING OF A QUANTUM KEY EXCHANGE SCHEME BASED ON ELLIPTIC CURVE CRYPTOGRAPHY

D.T. Muhamediyeva, Farkhad Tagaev

Published Apr 17, 2026• 0 citations
Publisher

Abstract

In this article, the key exchange process based on elliptic curve cryptography (ECC) and its quantum simulation are implemented using the Qiskit environment. Alice and Bob generate their secret and public keys by adding and multiplying points on the elliptic curve. After that, they calculate a common key and check whether this key has the same result. In the article, Hadamard and CNOT quantum gates are used as quantum simulation stages, through which the superposition and entanglement processes in quantum states are modeled. The results show that quantum computing can further improve secure key exchange systems based on ECC.

DOI
10.57033/kfu.jru-2026-00058

Related papers

QUANTUM-RESISTANT ELLIPTIC CURVE-BASED SECURE KEY EXCHANGE

D.T. Muhamediyeva, Tagaev Farkhad Abduvahabovich

In this paper, a secure public key exchange algorithm is proposed, combining classical elliptic curve cryptography (ECC) and quantum algorithms. The algorithm is implemented using Python and the Qiskit library. Public keys are generated by point multiplication on ECC, and quantum superposition and isogeny mapping simulations are performed using Qiskit. The proposed approach can be stable against quantum attacks and can serve as the basis for future quantum-resistant cryptosystems.

•Dec 3, 2025•0 citations

ELLIPTICAL CURVE CRYPTOGRAPHY AND POST-QUANTUM CRYPTOGRAPHIC MODEL BASED ON ISOGENY IN A QUANTUM COMPUTING ENVIRONMENT

Muhamediyeva D. T., Farkhad Tagaev

This paper studies the modeling of elliptic curve cryptography and isogeny-based algorithms in a quantum computing environment, which play an important role in the post-quantum cryptography paradigm. In the study, the operations of adding and doubling points on an elliptic curve are mathematically analyzed and implemented using the Python programming language. In addition, a quantum scheme based on the Qiskit platform was developed to simulate the quantum computing environment. The model describes a simplified view of the isogeny mapping process using quantum superposition and nonlinear transformations. The proposed model was tested on a local quantum simulator and the results were analyzed using a probability distribution. The results obtained demonstrate the possibility of modeling elliptic curve-based cryptographic algorithms in a quantum environment and provide an important theoretical basis for post-quantum cryptography research.

Eureka Journal of Computing Science & Digital Innovation•Mar 30, 2026•0 citations

ELLIPTIK EGRI CHIZIQ ASOSIDA XAVFSIZ KALIT ALMASHINUVI

D.T.Muhamediyeva, Raupova M

This paper proposes a secure public key exchange algorithm combining classicalelliptic curve cryptography (ECC) and quantum algorithms. The algorithm is implemented usingPython and the Qiskit library. Public keys are generated by point multiplication on ECC, andquantum superposition is performed using Qiskit. The proposed approach can be robust againstquantum attacks and can serve as a basis for future quantum-resistant cryptosystems.

MANAGEMENT AND ECONOMICS SCIENTIFIC RESEARCH JOURNAL•Apr 18, 2025•0 citations

SECURE INFORMATION EXCHANGE THROUGH QUANTUM KEY PROVISION METHOD

D.T. Muhamediyeva, Farxad Abduvaxabovich Tagaev

In this article, a model of secure key exchange based on the BB84 protocol of quantum cryptography was developed and simulated. In the study, photons transmitted through a quantum channel between Alice and Bob were encoded in quantum states, and security was ensured by random selection of bases when reading them. An error indicator was calculated to detect Eavesdropping (Eve) interference. After generating the key, a simple ECC encryption algorithm based on XOR was used to transmit data in a protected manner. The results showed that it is possible to effectively maintain information confidentiality using a key formed through the BB84 protocol.

•Apr 17, 2026•0 citations

Quantum-Enhanced Elliptic Curve Cryptography Implementations for IoT: A Comparative Analysis

Rashmi Sahay, Kaushik Sekaran, M. Priyadharshini

The rapid advancements in quantum computation pose significant threats to traditional cryptographic systems, such as those used in the Internet of Things (IoT). RSA and methods like Elliptic Curve Cryptography (ECC) are particularly vulnerable to quantum algorithmic techniques, such as Shor’s and Grover’s algorithms. This paper focuses on the analysis of cryptographic models based on quantum technologies, with special emphasis on IoT security. It examines how both symmetric and public-key cryptography are affected by quantum comput-ing—highlighting vulnerabilities in symmetric schemes to Grover’s algorithm and in public-key systems like ECC to Shor’s algorithm. Significant focus is placed on the advancement of quantum-resistant ECC, with an in-depth evaluation of its effectiveness, security capabilities, and suitability for IoT applications. This work also compares various methods for implementing quantum-enhanced ECC, considering both software and hardware solutions. Furthermore, the paper explores emerging hybrid systems that integrate classical and quantum-resistant encryption to offer enhanced security in transitional scenarios. Lastly, it outlines potential research avenues for developing new techniques to protect future IoT networks from quantum-based attacks.

IEEE International Conference on Advanced Networks and Telecommunications Systems•Dec 15, 2024•1 citation

Quantum Cryptoanalysis of Elliptic Curve Systems

Juan Manuel García‐Chamizo, Rolando Menchaca

THE SECURITY OF ELLIPTIC CURVE CRYPTOSYSTEMS IS BASED IN THE INTRACTABILITY OF THE ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM. THE BEST CLASSICAL ALGORITHM KNOWN UNTIL DQTE TO SOLVE THIS PROBLEM IS FULLY EXPONENTIAL IN TIME. THIS IS THE REASON WHY THE ELLIPTIC CURVE PUBLIC KEY CRYPTOGRAPHY IS CONSIDERED THE MOST SECURE KNOWN UNTIL DATE. WE PRESENT IN THIS PAPER AN ALGORITHM THAT RUNNING ON A QUANTUM COMPUTER, CAN SOLVE IN POLYNOMIAL TIME THE ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM. THEN, IF A FUNCTIONAL QUANTUM COMPUTER ISEVER BUILD, ALL THE ELLIPTIC CURVE CRYPTOSYSTEMS WOULD BECOME INSECURE.

Computación y Sistemas•Dec 31, 2001•0 citations
In this article, the key exchange process based on elliptic curve cryptography (ECC) and its quantum simulation are implemented using the Qiskit environment. Alice and Bob generate their secret and public keys by adding and multiplying points on the elliptic curve. After that, they calculate a common key and check whether this key has the same result. In the article, Hadamard and CNOT quantum gates are used as quantum simulation stages, through which the superposition and entanglement processes in quantum states are modeled. The results show that quantum computing can further improve secure key exchange systems based on ECC.
This paper studies the modeling of elliptic curve cryptography and isogeny-based algorithms in a quantum computing environment, which play an important role in the post-quantum cryptography paradigm. In the study, the operations of adding and doubling points on an elliptic curve are mathematically analyzed and implemented using the Python programming language. In addition, a quantum scheme based on the Qiskit platform was developed to simulate the quantum computing environment. The model describes a simplified view of the isogeny mapping process using quantum superposition and nonlinear transformations. The proposed model was tested on a local quantum simulator and the results were analyzed using a probability distribution. The results obtained demonstrate the possibility of modeling elliptic curve-based cryptographic algorithms in a quantum environment and provide an important theoretical basis for post-quantum cryptography research.
In this article, a model of secure key exchange based on the BB84 protocol of quantum cryptography was developed and simulated. In the study, photons transmitted through a quantum channel between Alice and Bob were encoded in quantum states, and security was ensured by random selection of bases when reading them. An error indicator was calculated to detect Eavesdropping (Eve) interference. After generating the key, a simple ECC encryption algorithm based on XOR was used to transmit data in a protected manner. The results showed that it is possible to effectively maintain information confidentiality using a key formed through the BB84 protocol.
The rapid advancements in quantum computation pose significant threats to traditional cryptographic systems, such as those used in the Internet of Things (IoT). RSA and methods like Elliptic Curve Cryptography (ECC) are particularly vulnerable to quantum algorithmic techniques, such as Shor’s and Grover’s algorithms. This paper focuses on the analysis of cryptographic models based on quantum technologies, with special emphasis on IoT security. It examines how both symmetric and public-key cryptography are affected by quantum comput-ing—highlighting vulnerabilities in symmetric schemes to Grover’s algorithm and in public-key systems like ECC to Shor’s algorithm. Significant focus is placed on the advancement of quantum-resistant ECC, with an in-depth evaluation of its effectiveness, security capabilities, and suitability for IoT applications. This work also compares various methods for implementing quantum-enhanced ECC, considering both software and hardware solutions. Furthermore, the paper explores emerging hybrid systems that integrate classical and quantum-resistant encryption to offer enhanced security in transitional scenarios. Lastly, it outlines potential research avenues for developing new techniques to protect future IoT networks from quantum-based attacks.
THE SECURITY OF ELLIPTIC CURVE CRYPTOSYSTEMS IS BASED IN THE INTRACTABILITY OF THE ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM. THE BEST CLASSICAL ALGORITHM KNOWN UNTIL DQTE TO SOLVE THIS PROBLEM IS FULLY EXPONENTIAL IN TIME. THIS IS THE REASON WHY THE ELLIPTIC CURVE PUBLIC KEY CRYPTOGRAPHY IS CONSIDERED THE MOST SECURE KNOWN UNTIL DATE. WE PRESENT IN THIS PAPER AN ALGORITHM THAT RUNNING ON A QUANTUM COMPUTER, CAN SOLVE IN POLYNOMIAL TIME THE ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM. THEN, IF A FUNCTIONAL QUANTUM COMPUTER ISEVER BUILD, ALL THE ELLIPTIC CURVE CRYPTOSYSTEMS WOULD BECOME INSECURE.