The generalized method of solving ECDLP using quantum annealing

Authors

  • Łukasz Dzierzkowski Faculty of Cybernetics, Military University of Technology, Warsaw, Poland

DOI:

https://doi.org/10.24425/ijet.2025.153544

Abstract

This paper presents a generalization of a method allowing the transformation of the Elliptic Curve Discrete Logarithm Problem (ECDLP) over prime fields to the Quadratic Unconstrained Binary Optimization (QUBO) problem. The original method requires that a given elliptic curve model has complete arithmetic. The new one has no such restriction, which is a breakthrough. Since the mentioned obstacle is no longer a problem, the latest version of the algorithm may be used for any elliptic curve model. As a result, one may use quantum annealing to solve ECDLP on any given model of elliptic curves.

Published

2025-04-07

How to Cite

Dzierzkowski, Łukasz. “The Generalized Method of Solving ECDLP Using Quantum Annealing”. International Journal of Electronics and Telecommunications, vol. 71, no. 1, Apr. 2025, doi:10.24425/ijet.2025.153544.

Issue

Section

Artykuły