1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.SC2025
A Rank 23 Algorithm for Multiplying 3 x 3 Matrices with an Arithmetic Complexity of 59
Erik Mårtensson, Paul Stankovski Wagner, Joshua Stapleton
In 1969 Strassen showed surprisingly that it is possible to multiply two 2 x 2 matrices using seven multiplications and 18 additions, instead of the naive eight multiplications and…
cs.CR2021★ 1 cited
On the Sample Complexity of solving LWE using BKW-Style Algorithms
Qian Guo, Erik Mårtensson, Paul Stankovski Wagner
The Learning with Errors (LWE) problem receives much attention in cryptography, mainly due to its fundamental significance in post-quantum cryptography. Among its solving algorithm…
cs.CR2019
The Asymptotic Complexity of Coded-BKW with Sieving Using Increasing Reduction Factors
Erik Mårtensson
The Learning with Errors problem (LWE) is one of the main candidates for post-quantum cryptography. At Asiacrypt 2017, coded-BKW with sieving, an algorithm combining the Blum-Kalai…