702 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
9 papers
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…
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…
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 sho…
Extending GCC-PHAT using Shift Equivariant Neural Networks
Axel Berg, Mark O'Connor, Kalle Åström +1
Speaker localization using microphone arrays depends on accurate time delay estimation techniques. For decades, methods based on the generalized cross correlation with phase transf…
On the success probability of quantum order finding
Martin Ekerå
We prove a lower bound on the probability of Shor's order-finding algorithm successfully recovering the order in a single run. The bound implies that by performing two limited…
A dataset for multi-sensor drone detection
Fredrik Svanström, Fernando Alonso-Fernandez, Cristofer Englund
The use of small and remotely controlled unmanned aerial vehicles (UAVs), or drones, has increased in recent years. This goes in parallel with misuse episodes, with an evident thre…
On completely factoring any integer efficiently in a single run of an order finding algorithm
Martin Ekerå
We show that given the order of a single element selected uniformly at random from , we can with very high probability, and for any integer , efficiently find the…
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Craig Gidney, Martin Ekerå
We significantly reduce the cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Ni…
Quantum algorithms for computing short discrete logarithms and factoring RSA integers
Martin Ekerå, Johan Håstad
In this paper we generalize the quantum algorithm for computing short discrete logarithms previously introduced by Ekerå so as to allow for various tradeoffs between the number of…