2 papers
cs.CR2024
A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography
Martin Ekerå, Joel Gärtner
We provide a high-level cost comparison between Regev's quantum algorithm with Ekerå-Gärtner's extensions on the one hand, and existing state-of-the-art quantum algorithms for fact…
cs.CR2023
Extending Regev's factoring algorithm to compute discrete logarithms
Martin Ekerå, Joel Gärtner
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 factorin…