default search action
Erik Mårtensson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Alessandro Budroni
, Erik Mårtensson
Further improvements of the estimation of key enumeration with applications to solving LWE. Cryptogr. Commun. 16(5): 1163-1182 (2024) - [j6]Qian Guo
The Perils of Limited Key Reuse: Adaptive and Parallel Mismatch Attacks with Post-processing Against Kyber. IACR Commun. Cryptol. 1(3): 21 (2024) - [i12]Qian Guo, Erik Mårtensson, Adrian Åström:
The Perils of Limited Key Reuse: Adaptive and Parallel Mismatch Attacks with Post-processing Against Kyber. IACR Cryptol. ePrint Arch. 2024: 810 (2024) - [i11]Julius Hermelink, Silvan Streit, Erik Mårtensson, Richard Petri:
A Generic Framework for Side-Channel Attacks against LWE-based Cryptosystems. IACR Cryptol. ePrint Arch. 2024: 1211 (2024) - 2023
- [j5]Qian Guo
Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms. Cryptogr. Commun. 15(2): 331-350 (2023) - [j4]Julius Hermelink, Erik Mårtensson
Belief Propagation Meets Lattice Reduction: Security Estimates for Error-Tolerant Key Recovery from Decryption Errors. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(4): 287-317 (2023) - [c8]Alessandro Budroni
Improved Estimation of Key Enumeration with Applications to Solving LWE. ISIT 2023: 495-500 - [c7]Qian Guo, Erik Mårtensson
Do Not Bound to a Single Position: Near-Optimal Multi-positional Mismatch Attacks Against Kyber and Saber. PQCrypto 2023: 291-320 - [i10]Julius Hermelink, Erik Mårtensson, Simona Samardjiska, Peter Pessl, Gabi Dreo Rodosek:
Belief Propagation Meets Lattice Reduction: Security Estimates for Error-Tolerant Key Recovery from Decryption Errors. IACR Cryptol. ePrint Arch. 2023: 98 (2023) - [i9]Alessandro Budroni, Erik Mårtensson:
Improved Estimation of Key Enumeration with Applications to Solving LWE. IACR Cryptol. ePrint Arch. 2023: 139 (2023) - [i8]Alessandro Budroni, Erik Mårtensson:
Further Improvements of the Estimation of Key Enumeration with Applications to Solving LWE. IACR Cryptol. ePrint Arch. 2023: 1547 (2023) - 2022
- [i7]Qian Guo, Erik Mårtensson:
Do Not Bound to a Single Position: Near-Optimal Multi-Positional Mismatch Attacks Against Kyber and Saber. IACR Cryptol. ePrint Arch. 2022: 983 (2022) - [i6]Qian Guo, Erik Mårtensson, Paul Stankovski Wagner:
Modeling and Simulating the Sample Complexity of solving LWE using BKW-Style Algorithms. IACR Cryptol. ePrint Arch. 2022: 988 (2022) - 2021
- [j3]Alessandro Budroni
Improvements on Making BKW Practical for Solving LWE. Cryptogr. 5(4): 31 (2021) - [c6]Qian Guo
On the Sample Complexity of solving LWE using BKW-Style Algorithms. ISIT 2021: 2405-2410 - [i5]Qian Guo, Erik Mårtensson, Paul Stankovski Wagner:
On the Sample Complexity of solving LWE using BKW-Style Algorithms. CoRR abs/2102.02126 (2021) - 2020
- [b1]Erik Mårtensson:
Some Notes on Post-Quantum Cryptanalysis. Lund University, Sweden, 2020 - [c5]Alessandro Budroni
Making the BKW Algorithm Practical for LWE. INDOCRYPT 2020: 417-439 - [i4]Alessandro Budroni, Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
Making the BKW Algorithm Practical for LWE. IACR Cryptol. ePrint Arch. 2020: 1467 (2020)
2010 – 2019
- 2019
- [j2]Qian Guo
Some cryptanalytic and coding-theoretic applications of a soft stern algorithm. Adv. Math. Commun. 13(4): 559-578 (2019) - [j1]Qian Guo
On the Asymptotics of Solving the LWE Problem Using Coded-BKW With Sieving. IEEE Trans. Inf. Theory 65(8): 5243-5259 (2019) - [c4]Elena Kirshanova
Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving. ASIACRYPT (1) 2019: 521-551 - [c3]Erik Mårtensson
The Asymptotic Complexity of Coded-BKW with Sieving Using Increasing Reduction Factors. ISIT 2019: 2579-2583 - [i3]Erik Mårtensson:
The Asymptotic Complexity of Coded-BKW with Sieving Using Increasing Reduction Factors. CoRR abs/1901.06558 (2019) - [i2]Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
On the Asymptotics of Solving the LWE Problem Using Coded-BKW with Sieving. IACR Cryptol. ePrint Arch. 2019: 9 (2019) - [i1]Elena Kirshanova, Erik Mårtensson, Eamonn W. Postlethwaite, Subhayan Roy Moulik:
Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving. IACR Cryptol. ePrint Arch. 2019: 1016 (2019) - 2017
- [c2]Qian Guo
Coded-BKW with Sieving. ASIACRYPT (1) 2017: 323-346 - [c1]Qian Guo
Information set decoding with soft information and some cryptographic applications. ISIT 2017: 1793-1797
Coauthor Index
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 2024-11-07 20:22 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: