default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Ekerå
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c2]Martin Ekerå
, Joel Gärtner:
Extending Regev's Factoring Algorithm to Compute Discrete Logarithms. PQCrypto (2) 2024: 211-242- [i13]Martin Ekerå, Joel Gärtner:
A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography. CoRR abs/2405.14381 (2024) - 2023
- [i12]Martin Ekerå:
On the success probability of the quantum algorithm for the short DLP. CoRR abs/2309.01754 (2023) - [i11]Martin Ekerå, Joel Gärtner:
Extending Regev's factoring algorithm to compute discrete logarithms. CoRR abs/2311.05545 (2023) - 2022
- [i10]Martin Ekerå:
On the success probability of quantum order finding. CoRR abs/2201.07791 (2022) - 2021
- [j4]Martin Ekerå:
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs. J. Math. Cryptol. 15(1): 359-407 (2021) - [j3]Martin Ekerå:
On completely factoring any integer efficiently in a single run of an order-finding algorithm. Quantum Inf. Process. 20(6): 205 (2021) - [j2]Craig Gidney, Martin Ekerå:
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5: 433 (2021) - 2020
- [j1]Martin Ekerå:
On post-processing in the quantum algorithm for computing short discrete logarithms. Des. Codes Cryptogr. 88(11): 2313-2335 (2020) - [i9]Martin Ekerå:
On completely factoring any integer efficiently in a single run of an order finding algorithm. CoRR abs/2007.10044 (2020)
2010 – 2019
- 2019
- [i8]Martin Ekerå:
Revisiting Shor's quantum algorithm for computing general discrete logarithms. CoRR abs/1905.09084 (2019) - 2018
- [i7]Martin Ekerå:
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs. IACR Cryptol. ePrint Arch. 2018: 797 (2018) - 2017
- [c1]Martin Ekerå, Johan Håstad:
Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers. PQCrypto 2017: 347-363 - [i6]Martin Ekerå, Johan Håstad:
Quantum algorithms for computing short discrete logarithms and factoring RSA integers. CoRR abs/1702.00249 (2017) - [i5]Martin Ekerå, Johan Håstad:
Quantum algorithms for computing short discrete logarithms and factoring RSA integers. IACR Cryptol. ePrint Arch. 2017: 77 (2017) - [i4]Martin Ekerå:
On post-processing in the quantum algorithm for computing short discrete logarithms. IACR Cryptol. ePrint Arch. 2017: 1122 (2017) - 2016
- [i3]Martin Ekerå:
Modifying Shor's algorithm to compute short discrete logarithms. IACR Cryptol. ePrint Arch. 2016: 1128 (2016) - 2015
- [i2]Jean-Pierre Flori, Jérôme Plût, Jean-René Reinhard, Martin Ekerå:
Diversity and Transparency for ECC. IACR Cryptol. ePrint Arch. 2015: 659 (2015) - [i1]Martin Ekerå:
Computing information on domain parameters from public keys selected uniformly at random. IACR Cryptol. ePrint Arch. 2015: 879 (2015)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
