A Gentle Introduction to Lattice Cryptanalysis (Q32a)
Before the Internet fully adopts lattice-based cryptography, it’s crucial to examine past, current, and potential future methods for attacking its foundations. This talk will offer an overview of lattice basis reduction, its significance in analyzing early versions of NTRU, recent developments by Henninger and Ryan, and twenty-first-century ideas of lattice “sieving.” Insights into how Shor’s algorithm relates to other quantum algorithms and possible applications to solving lattice problems will also be discussed. The talk concludes with considerations for migrating to quantum-safe cryptography, emphasizing defense-in-depth, crypto-agility, and how standards organizations like NIST might prepare for unanticipated breakthroughs.