The generalized method of solving ECDLP using quantum annealing
Cryptography and Security
2024-10-14 v1
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.
Keywords
Cite
@article{arxiv.2410.08725,
title = {The generalized method of solving ECDLP using quantum annealing},
author = {Łukasz Dzierzkowski},
journal= {arXiv preprint arXiv:2410.08725},
year = {2024}
}
Comments
13 pages, 4 figures, 2 tables