Extending Regev's factoring algorithm to compute discrete logarithms

9 November 2023

Papers citing "Extending Regev's factoring algorithm to compute discrete logarithms"

3 / 3 papers shown

Title
$Transformation of the discrete logarithm problem over $\mathbb F_{2^n}$ to the QUBO problem using normal bases$ Transformation of the discrete logarithm problem over $\mathbb F_{2^n}$ to the QUBO problem using normal bases Michał Wroński Mateusz Leśniak 21 0 0 27 Sep 2024
A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography Martin Ekerå Joel Gärtner 22 3 0 23 May 2024
Quantum Complexity for Discrete Logarithms and Related Problems Minki Hhan Takashi Yamakawa Aaram Yun 28 7 0 06 Jul 2023