Ekerå, Martin

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

Gidney, C., & Ekerå, M. (2021) · Quantum

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 830

Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers

Ekerå, M., & Håstad, J. (2017) · Lecture Notes in Computer Science

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 62

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

Ekerå, M. (2020) · Designs, Codes and Cryptography

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 23

Revisiting Shor's quantum algorithm for computing general discrete logarithms

Ekerå, M. (2019) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 9

Quantum algorithms for computing general discrete logarithms and orders with tradeoffs

Ekerå, M. (2021) · Journal of Mathematical Cryptology

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 3