Phong NGUYEN - Recent progress on lattices's computations 2 - INRIA 2 Accéder directement au contenu
Vidéo Année : 2022

Phong NGUYEN - Recent progress on lattices's computations 2

Afficher 

Fanny Bastien

Résumé

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.

Dates et versions

hal-04662960 , version 1 (26-07-2024)

Licence

Identifiants

  • HAL Id : hal-04662960 , version 1

Citer

Phong Q. Nguyen, Fanny Bastien. Phong NGUYEN - Recent progress on lattices's computations 2: Summer School 2022 - Cohomology, Geometry and Explicit Number Theory. 2022. ⟨hal-04662960⟩
0 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More