eprint.iacr.orgpaperFaster Matrix Multiplication Leads to Faster Lattice Sieving
Gao and Hu's IACR ePrint 2026/2622 shows that if the matrix multiplication exponent satisfies ω ≤ 9/4 − η, heuristic lattice sieving runs in (3/2 − δ)^(n/2+o(n)) time under the spherical heuristic from the BDGL analysis. It builds on OpenAI's recent result that ω ≤ 9/4. With known matrix multiplication algorithms, the method already gives subquadratic search inside BDGL buckets. Only the abstract is available, so concrete parameters are not shown.
TL;DR Shows that faster matrix multiplication (ω ≤ 9/4 − η) yields asymptotically faster heuristic lattice sieving, with subquadratic bucket search in BDGL.
Organisations named here
- BDGL
- matrix multiplication exponent
- spherical heuristic
Technologies named here
- Heuristic lattice sieving
- Lattice-based cryptography
- Matrix multiplication algorithms
Techniques named here
- Cryptanalysis
- Cited result
Related in other
eprint.iacr.orgpaperRerandomizable Garbling for Arithmetic Circuits
aseemshrey.inarticle