Martin Ekerå

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 17

Top Topics

Previously Studied

Computational Efficiency

Success Probability

Top Venues

IACR Cryptol. ePrint Arch.

Des. Codes Cryptogr.

Publications

Martin Ekerå, Joel Gärtner
A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography. CoRR (2024)
Martin Ekerå, Joel Gärtner
Extending Regev's Factoring Algorithm to Compute Discrete Logarithms. PQCrypto (2) (2023)
Martin Ekerå, Joel Gärtner
Extending Regev's factoring algorithm to compute discrete logarithms. CoRR (2023)
Martin Ekerå
On the success probability of the quantum algorithm for the short DLP. CoRR (2023)
Martin Ekerå
On the success probability of quantum order finding. CoRR (2022)
Martin Ekerå
On completely factoring any integer efficiently in a single run of an order-finding algorithm. Quantum Inf. Process. 20 (6) (2021)
Martin Ekerå
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs. J. Math. Cryptol. 15 (1) (2021)
Craig Gidney, Martin Ekerå
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5 (2021)
Martin Ekerå
On completely factoring any integer efficiently in a single run of an order finding algorithm. CoRR (2020)
Martin Ekerå
On post-processing in the quantum algorithm for computing short discrete logarithms. Des. Codes Cryptogr. 88 (11) (2020)
Martin Ekerå
Revisiting Shor's quantum algorithm for computing general discrete logarithms. CoRR (2019)
Martin Ekerå
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs. IACR Cryptol. ePrint Arch. 2018 (2018)
Martin Ekerå, Johan Håstad
Quantum algorithms for computing short discrete logarithms and factoring RSA integers. CoRR (2017)
Martin Ekerå
On post-processing in the quantum algorithm for computing short discrete logarithms. IACR Cryptol. ePrint Arch. 2017 (2017)
Martin Ekerå, Johan Håstad
Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers. PQCrypto (2017)
Martin Ekerå, Johan Håstad
Quantum algorithms for computing short discrete logarithms and factoring RSA integers. IACR Cryptol. ePrint Arch. 2017 (2017)
Martin Ekerå
Modifying Shor's algorithm to compute short discrete logarithms. IACR Cryptol. ePrint Arch. 2016 (2016)
Martin Ekerå
Computing information on domain parameters from public keys selected uniformly at random. IACR Cryptol. ePrint Arch. 2015 (2015)
Jean-Pierre Flori, Jérôme Plût, Jean-René Reinhard, Martin Ekerå
Diversity and Transparency for ECC. IACR Cryptol. ePrint Arch. 2015 (2015)