Erik Mårtensson
Orcid: 0000-0001-5824-7282
According to our database1,
Erik Mårtensson
authored at least 18 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
4
3
1
1
1
3
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Further improvements of the estimation of key enumeration with applications to solving LWE.
Cryptogr. Commun., September, 2024
The Number of the Beast: Reducing Additions in Fast Matrix Multiplication Algorithms for Dimensions up to 666.
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
The Perils of Limited Key Reuse: Adaptive and Parallel Mismatch Attacks with Post-processing Against Kyber.
IACR Commun. Cryptol., 2024
2023
Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms.
Cryptogr. Commun., March, 2023
Belief Propagation Meets Lattice Reduction: Security Estimates for Error-Tolerant Key Recovery from Decryption Errors.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023
IACR Cryptol. ePrint Arch., 2023
2022
Do Not Bound to a Single Position: Near-Optimal Multi-Positional Mismatch Attacks Against Kyber and Saber.
IACR Cryptol. ePrint Arch., 2022
2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
2019
IEEE Trans. Inf. Theory, 2019
Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving.
IACR Cryptol. ePrint Arch., 2019
Adv. Math. Commun., 2019
The Asymptotic Complexity of Coded-BKW with Sieving Using Increasing Reduction Factors.
Proceedings of the IEEE International Symposium on Information Theory, 2019
2017
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017