Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k1/(2k) Time kk/8+o(k)

Ask about this paper

Ask your agent about it.

Lune has read the top-tier papers around this one, so every answer names the papers it rests on.

Cited by top-tier papers4

• On Bounded Distance Decoding with Predicate: Breaking the "Lattice Barrier" for the Hidden Number ProblemMartin R. Albrecht, Nadia HeningerEUROCRYPT 2021 · 31 citations
• Lattice Reduction with Approximate Enumeration Oracles - Practical Algorithms and Concrete PerformanceMartin R. Albrecht, Shi Bai, Jianwei Li, Joe RowellCRYPTO 2021 · 29 citations
• Towards Faster Polynomial-Time Lattice ReductionPaul Kirchner, Thomas Espitau, Pierre-Alain FouqueCRYPTO 2021 · 9 citations
• Quantum Lattice Enumeration in Limited DepthNina Bindel, Xavier Bonnetain, Marcel Tiepelt, Fernando VirdiaCRYPTO 2024 · 7 citations

Related papers

• Fast Reduction of Algebraic Lattices over Cyclotomic FieldsPaul Kirchner, Thomas Espitau, Pierre-Alain FouqueCRYPTO 2020 · 12 citations
• Towards Large-Scale Lattice Attack: New Lattice Records by Disk-Based SievingZiyu Zhao, Jintai DingEUROCRYPT 2026
• Refined Attack on LWE with Hints: Constructing Lattice via Gaussian EliminationJinzheng Cao, Haodong Jiang, Qingfeng ChengCRYPTO 2025 · 3 citations
• A 2n/2-Time Algorithm for $\sqrt{n}$-SVP and $\sqrt{n}$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVPDivesh Aggarwal, Zeyong Li, Noah Stephens-DavidowitzEUROCRYPT 2021 · 9 citations
• Fast Practical Lattice Reduction Through Iterated CompressionKeegan Ryan, Nadia HeningerCRYPTO 2023 · 28 citations