Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.08725 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916433657593856 |
|---|---|
| author | Dzierzkowski, Łukasz |
| author_facet | Dzierzkowski, Łukasz |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_08725 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The generalized method of solving ECDLP using quantum annealing Dzierzkowski, Łukasz Cryptography and Security 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. |
| title | The generalized method of solving ECDLP using quantum annealing |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2410.08725 |