Title: An Algorithmic Reduction Theory for Binary Codes: LLL and more
Joint work with Thomas Debris-Alazard and Wessel van WoerdenSpeaker: Léo Ducas Affiliation: Centrum Wiskunde & Informatica (CWI) Zoom: Please email Emma Watson
Lattice reduction is the task of finding a basis of short and somewhat orthogonal vectors of a given lattice. In 1985 Lenstra, Lenstra and Lovasz proposed a polynomial time algorithm for this task, with an application to factoring rational polynomials. Since then, the LLL algorithm has found countless application in algorithmic number theory and in cryptanalysis.