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

Solving discrete logarithm problem over prime fields using quantum annealing and $\frac{n^3}{2}$ logical qubits

Micha, Wro, ski

Published Jan 1, 2021• 0 citations
OpenAlex

Related papers

Solving discrete logarithm problem over prime fields using quantum annealing and $\frac{n^3}{2}$ logical qubits.

Michał Wroński

•Jan 1, 2021•1 citation

Practical Solving of Discrete Logarithm Problem over Prime Fields Using Quantum Annealing

Michał Wroński

Lecture notes in computer science•Jan 1, 2022•6 citations

Index Calculus Method for Solving Elliptic Curve Discrete Logarithm Problem Using Quantum Annealing

Michał Wroński

Lecture notes in computer science•Jan 1, 2021•6 citations

Quantum circuits for hyperelliptic curve discrete logarithms over the Mersenne prime fields

Chao Chen, Peidong Guan, Yan Tang Huang +1 more

Quantum Information Processing•Jul 5, 2023•4 citations

Quantum Algorithm for Solving the Discrete Logarithm Problem in the Class Group of an Imaginary Quadratic Field and Security Comparison of Current Cryptosystems at the Beginning of Quantum Computer Age

Arthur Schmidt

Lecture notes in computer science•Jan 1, 2006•6 citations

Transformation of the discrete logarithm problem over F2n to the QUBO problem using normal bases

Michał Wroński, Mateusz Leśniak

Quantum computations are very important branch of modern cryptology. According to the number of working physical qubits available in general-purpose quantum computers and in quantum annealers, there is no coincidence, that nowadays quantum annealers allow to solve larger problems. In this paper we focus on solving discrete logarithm problem (DLP) over binary fields using quantum annealing. It is worth to note, that however solving DLP over prime fields using quantum annealing has been considered before, no author, until now, has considered DLP over binary fields using quantum annealing. Therefore, in this paper, we aim to bridge this gap. We present a polynomial transformation of the discrete logarithm problem over binary fields to the Quadratic Unconstrained Binary Optimization (QUBO) problem, using approximately 3n2 logical variables for the binary field F2n. In our estimations, we assume the existence of an optimal normal base in the given fields. Such a QUBO instance can then be solved using quantum annealing.

International Journal of Electronics and Telecommunications•Apr 7, 2025•0 citations
Solving discrete logarithm problem over prime fields using quantum annealing and n32\frac{n^3}{2}2n3​ logical qubits
Solving discrete logarithm problem over prime fields using quantum annealing and n32\frac{n^3}{2}2n3​ logical qubits.
Quantum computations are very important branch of modern cryptology. According to the number of working physical qubits available in general-purpose quantum computers and in quantum annealers, there is no coincidence, that nowadays quantum annealers allow to solve larger problems. In this paper we focus on solving discrete logarithm problem (DLP) over binary fields using quantum annealing. It is worth to note, that however solving DLP over prime fields using quantum annealing has been considered before, no author, until now, has considered DLP over binary fields using quantum annealing. Therefore, in this paper, we aim to bridge this gap. We present a polynomial transformation of the discrete logarithm problem over binary fields to the Quadratic Unconstrained Binary Optimization (QUBO) problem, using approximately 3n2 logical variables for the binary field F2n. In our estimations, we assume the existence of an optimal normal base in the given fields. Such a QUBO instance can then be solved using quantum annealing.