Computing information on domain parameters from public keys selected uniformly at random. - Martin Ekerå (IACR Cryptol. ePrint Arch., 2015)

Diversity and Transparency for ECC. - Jean-Pierre Flori; Jérôme Plût; Jean-René Reinhard; Martin Ekerå (IACR Cryptol. ePrint Arch., 2015)

Modifying Shor's algorithm to compute short discrete logarithms. - Martin Ekerå (IACR Cryptol. ePrint Arch., 2016)

Quantum algorithms for computing short discrete logarithms and factoring RSA integers. - Martin Ekerå; Johan Håstad (IACR Cryptol. ePrint Arch., 2017)

Revisiting Shor's quantum algorithm for computing general discrete logarithms. - Martin Ekerå (CoRR, 2019)

On post-processing in the quantum algorithm for computing short discrete logarithms. - Martin Ekerå (Des. Codes Cryptogr., 2020)

Quantum algorithms for computing general discrete logarithms and orders with tradeoffs. - Martin Ekerå (J. Math. Cryptol., 2021)

On completely factoring any integer efficiently in a single run of an order-finding algorithm. - Martin Ekerå (Quantum Inf. Process., 2021)

How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. - Craig Gidney; Martin Ekerå (Quantum, 2021)

On the success probability of quantum order finding. - Martin Ekerå (CoRR, 2022)

On the success probability of the quantum algorithm for the short DLP. - Martin Ekerå (CoRR, 2023)

Extending Regev's Factoring Algorithm to Compute Discrete Logarithms. - Martin Ekerå; Joel Gärtner (PQCrypto (2), 2024)

A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography. - Martin Ekerå; Joel Gärtner (IACR Commun. Cryptol., 2025)