Work

The generalized method of solving ECDLP using quantum annealing

Year: 2025

Type: article

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.

Source: International Journal of Electronics and Telecommunications

DOI: 10.24425/ijet.2025.153544

Author: Łukasz Dzierzkowski

Institution: Military University of Technology in Warsaw

Language: English

Topic: Cryptography and Residue Arithmetic

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $115

OpenAlex ID: W4409211105

FWCI: 1.107

Cites:

Cited by: 1

Related to: 10