This is an introduction to the mysterious world of lattice algorithms, which have found many applications in computer science, notably in cryptography. We will explain how lattices are represented by computers. We will present the main hard computational problems on lattices: SVP, CVP and BDD, related to short and close vectors in lattices, and their average version known as SIS and LWE. We will present the celebrated LLL algorithm, Babai’s algorithm and discrete Gaussian sampling. If time allows it, we will also take a look at worst-case to average-case reductions.
De Mehmet Haluk Sengun
De Mehmet Haluk Sengun
De Aurel Page
De Alexander Hulpke
De Alexander Hulpke
De Alexander Hulpke
De Paul Gunnells
De Aurel Page
De Peter Patzt
De Peter Patzt
De Peter Patzt
De Jennifer Wilson
De Jennifer Wilson
De Jennifer Wilson
De Haowen Zhang
De Renaud Coulangeon
De Renaud Coulangeon
De Bill Allombert
De Lewis Combes
De Alexander Hulpke
De Alexander Hulpke
De Paul Gunnells
De Paul Gunnells
De Paul Gunnells
De Paul Gunnells
De Graham Ellis
De Graham Ellis
De Graham Ellis
De Graham Ellis
De Graham Ellis
De Philippe Elbaz-Vincent
De Philippe Elbaz-Vincent
De Philippe Elbaz-Vincent
De Bettina Eick
De Petru Constantinescu
De Angelica Babei
De Alexander, D. Rahm
De Benjamin Brück
De Calista Bernard
De Philippe Elbaz-Vincent
De Bettina Eick
De Bettina Eick
De Bettina Eick
De Bettina Eick
De Herbert Gangl
De Zachary Himes
