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

QUANTUM-RESISTANT ELLIPTIC CURVE-BASED SECURE KEY EXCHANGE

D.T. Muhamediyeva, Tagaev Farkhad Abduvahabovich

Published Dec 3, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.17801929

Related papers

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

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

D.T. Muhamediyeva, Farkhad Tagaev

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.

•Apr 17, 2026•0 citations

Design and implementation of ECC combined with OPT encryption algorithm

Xiaotian Yang, Ran Ma, Fei Gao

Abstract 【Objective】 Combining ECC and OPT, a novel elliptic curve algorithm was proposed, which can effectively resist the reverse calculation of quantum computer and ensure the security of private key. 【Method】 On the basis of elliptic curve encryption algorithm, OPT algorithm was introduced to protect the private key. 【Result】 The signature and verification of messages can be successfully completed by the repeated algorithm on Python platform. Finally, the algorithm is proved to be safe under Shor algorithm and quantum computer attack through algorithm theory. 【Conclusion】 ECC combined with OPT encryption algorithm can effectively resist reversible computation of functional quantum devices, prevent eavesdroppers from forging signatures, and ensure the security of modern public key cryptosystems.

Journal of Physics Conference Series•Nov 1, 2022•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

Hybrid Quantum-Resistant Key Exchange Protocol for Secure Network Communication

Angamuthu G , Marikkannan M

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.

•Nov 2, 2025•0 citations

QUANTUM-RESISTANT CRYPTOGRAPHIC ALGORITHMS FOR SECURE COMMUNICATION

Vijay S, S. Shanmuga Priya, C. N. Harshavardhana +1 more

With the rise of quantum computing, traditional cryptographic algorithms, such as the Elliptic Curve Digital Signature Algorithm (ECDSA), face potential vulnerabilities. Quantum computers could efficiently solve problems that are currently computationally infeasible for classical computers, thus threatening the security of cryptographic systems. As a result, there is a pressing need to develop quantum- resistant cryptographic algorithms to ensure secure communication in a future where quantum computing is prevalent. ECDSA, widely used for securing digital communications, relies on elliptic curve cryptography to provide robust security through digital signatures. However, the advent of quantum computing poses a significant threat to ECDSA's security, as quantum algorithms such as Shor's algorithm could break the elliptic curve-based encryption by efficiently solving discrete logarithm problems. To address this issue, we propose a quantum-resistant cryptographic algorithm based on lattice-based cryptography. Our approach utilizes the Learning With Errors (LWE) problem, known for its resistance to quantum attacks. We implement the proposed algorithm and compare its performance with ECDSA in terms of key generation time, signing time, and verification time. The algorithm's security is analyzed against quantum attacks using theoretical and empirical methods. The experimental results demonstrate that the quantum-resistant algorithm provides a comparable level of security to ECDSA while offering significant advantages in the context of quantum resistance. Specifically, our quantum-resistant algorithm achieved key generation times of 120 ms, signing times of 150 ms, and verification times of 100 ms. In comparison, ECDSA showed key generation times of 80 ms, signing times of 90 ms, and verification times of 70 ms. Despite these performance trade-offs, the quantum resistance of the proposed algorithm ensures future-proof security for digital communications.

ICTACT Journal on Communication Technology•Sep 1, 2024•2 citations
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.
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.
Abstract 【Objective】 Combining ECC and OPT, a novel elliptic curve algorithm was proposed, which can effectively resist the reverse calculation of quantum computer and ensure the security of private key. 【Method】 On the basis of elliptic curve encryption algorithm, OPT algorithm was introduced to protect the private key. 【Result】 The signature and verification of messages can be successfully completed by the repeated algorithm on Python platform. Finally, the algorithm is proved to be safe under Shor algorithm and quantum computer attack through algorithm theory. 【Conclusion】 ECC combined with OPT encryption algorithm can effectively resist reversible computation of functional quantum devices, prevent eavesdroppers from forging signatures, and ensure the security of modern public key cryptosystems.
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.
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.
With the rise of quantum computing, traditional cryptographic algorithms, such as the Elliptic Curve Digital Signature Algorithm (ECDSA), face potential vulnerabilities. Quantum computers could efficiently solve problems that are currently computationally infeasible for classical computers, thus threatening the security of cryptographic systems. As a result, there is a pressing need to develop quantum- resistant cryptographic algorithms to ensure secure communication in a future where quantum computing is prevalent. ECDSA, widely used for securing digital communications, relies on elliptic curve cryptography to provide robust security through digital signatures. However, the advent of quantum computing poses a significant threat to ECDSA's security, as quantum algorithms such as Shor's algorithm could break the elliptic curve-based encryption by efficiently solving discrete logarithm problems. To address this issue, we propose a quantum-resistant cryptographic algorithm based on lattice-based cryptography. Our approach utilizes the Learning With Errors (LWE) problem, known for its resistance to quantum attacks. We implement the proposed algorithm and compare its performance with ECDSA in terms of key generation time, signing time, and verification time. The algorithm's security is analyzed against quantum attacks using theoretical and empirical methods. The experimental results demonstrate that the quantum-resistant algorithm provides a comparable level of security to ECDSA while offering significant advantages in the context of quantum resistance. Specifically, our quantum-resistant algorithm achieved key generation times of 120 ms, signing times of 150 ms, and verification times of 100 ms. In comparison, ECDSA showed key generation times of 80 ms, signing times of 90 ms, and verification times of 70 ms. Despite these performance trade-offs, the quantum resistance of the proposed algorithm ensures future-proof security for digital communications.