Dual lattice attacks for bounded distance decoding, revisited

arXiv:2609.37483 · cs.CR, cs.CG, cs.DS, math.MG · Submitted 2026-09-28 · Read on arXiv

cs.CR, cs.CG, cs.DS, math.MG

Submitted: 2026-09-28

Updated: 2026-09-28

Terminology

• Benchmark — 1× in this paper · explained in 2 episodes
• Query Complexity — 1× in this paper · explained in 2 episodes

Sources

• Reduction from sparse LPN to LPN, Dual Attack 3.0
• On the Closest Vector Problem with a Distance Guarantee
• Sieving for closest lattice vectors (with preprocessing)

Related papers

• SoK: AI-Augmented Binary Reversing
• Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM
• Calibration-Family Overfit: Why Trusted Sabotage Monitors Don't Transfer Across Lineages
• Efficient Fuzzy PSI under One-Sided Assumptions
• Sealing the Audit-Runtime Gap for LLM Skills
• Token Composition: A Graph Based on EVM Logs