3 citations · 5 across the 2 of their papers we have counts for
3 papers
cs.CR2026★ 3 cited
On the success probability of the quantum algorithm for the short DLP
Martin Ekerå
EkerÃ¥ and HÃ¥stad have introduced a variation of Shor's algorithm for the discrete logarithm problem (DLP). Unlike Shor's original algorithm, EkerÃ¥-HÃ¥stad's algorithm solves the…
cs.CR2026★ 2 cited
Revisiting Shor's quantum algorithm for computing general discrete logarithms
Martin Ekerå
We heuristically show that Shor's algorithm for computing general discrete logarithms achieves an expected success probability of approximately 60% to 82% in a single run when modi…
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 fa…