Cryptography 9: Applications of Lattice Reduction and Lattice-based Problems
In this 9th installment of the Cryptography series, we explore the powerful applications of lattice reduction in both algebra and cryptanalysis. Specifically, we demonstrate how modeling problems as finding short vectors in a lattice allows us to efficiently solve the Minimal Polynomial reconstruction, Coppersmith’s method for finding small roots, Low-density Subset Sum problems (Knapsack), and the Hidden Number Problem (HNP).
[Read More]