Extending Regev's factoring algorithm to compute discrete logarithms
Cryptography and Security
2024-06-11 v2 Quantum Physics
Abstract
Regev recently introduced a quantum factoring algorithm that may be perceived as a -dimensional variation of Shor's factoring algorithm. In this work, we extend Regev's factoring algorithm to an algorithm for computing discrete logarithms in a natural way. Furthermore, we discuss natural extensions of Regev's factoring algorithm to order finding, and to factoring completely via order finding. For all of these algorithms, we discuss various practical implementation considerations, including in particular the robustness of the post-processing.
Keywords
Cite
@article{arxiv.2311.05545,
title = {Extending Regev's factoring algorithm to compute discrete logarithms},
author = {Martin Ekerå and Joel Gärtner},
journal= {arXiv preprint arXiv:2311.05545},
year = {2024}
}
Comments
A number of improvements have been made, and further details on the robustness of the post-processing and other practical implementation considerations added