Skip to content

Back to the catalog

Provable Lattice Reduction in Nearly the Time of QR Factorization
eprint.iacr.orgpaper

Provable Lattice Reduction in Nearly the Time of QR Factorization

Provable Lattice Reduction in Nearly the Time of QR Factorization (IACR ePrint 2026/2541, October 2026) presents a deterministic lattice-reduction algorithm with running time Õ(n^ω(1+log κ_col(B))), free of heuristic assumptions. Its implementation used fewer instructions than flatter (CRYPTO 2023) in all 153 runs on q-ary, NTRU-like, scaled q-ary and Coppersmith inputs. Median flatter-to-new instruction ratios are 1.55 for q-ary and 1.86 for NTRU-like inputs.

TL;DR Presents a deterministic, provable LLL-style lattice reduction algorithm that beats flatter in instruction count on q-ary, NTRU-like and Coppersmith benchmarks.
Open original ↗

Organisations named here

  • Coppersmith
  • LLL

Technologies named here

  • flatter

Techniques named here

  • Iterative precision management within a recursive framework

Related in other