Martin Ekerå

According to our database, Martin Ekerå authored at least 13 papers between 2015 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

On the success probability of the quantum algorithm for the short DLP.

Martin Ekerå

IACR Commun. Cryptol., 2026

2025

A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography.

Martin Ekerå, Joel Gärtner

IACR Commun. Cryptol., 2025

2024

On the Success Probability of Quantum Order Finding.

Martin Ekerå

ACM Trans. Quantum Comput., June, 2024

Extending Regev's Factoring Algorithm to Compute Discrete Logarithms.

Martin Ekerå, Joel Gärtner

Proceedings of the Post-Quantum Cryptography - 15th International Workshop, 2024

2021

How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits.

Craig Gidney, Martin Ekerå

Quantum, 2021

On completely factoring any integer efficiently in a single run of an order-finding algorithm.

Martin Ekerå

Quantum Inf. Process., 2021

2019

Revisiting Shor's quantum algorithm for computing general discrete logarithms.

Martin Ekerå

CoRR, 2019

2018

Quantum algorithms for computing general discrete logarithms and orders with tradeoffs.

Martin Ekerå

IACR Cryptol. ePrint Arch., 2018

2017

On post-processing in the quantum algorithm for computing short discrete logarithms.

Martin Ekerå

IACR Cryptol. ePrint Arch., 2017

Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers.

Martin Ekerå, Johan Håstad

Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

2016

Modifying Shor's algorithm to compute short discrete logarithms.

Martin Ekerå

IACR Cryptol. ePrint Arch., 2016

2015

Diversity and Transparency for ECC.

Jean-Pierre Flori, Jérôme Plût, Jean-René Reinhard, Martin Ekerå

IACR Cryptol. ePrint Arch., 2015

Computing information on domain parameters from public keys selected uniformly at random.

Martin Ekerå

IACR Cryptol. ePrint Arch., 2015