Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

The Hardness of Lattice Problems: Worst-case to Average-case Reductions and Security Estimates

Phong Q. Nguyen 1, 2 
2 CRYPT - Cryptanalyse
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01256259
Contributor : Phong Q. Nguyen Connect in order to contact the contributor
Submitted on : Thursday, January 14, 2016 - 3:34:36 PM
Last modification on : Friday, January 21, 2022 - 3:15:41 AM

Identifiers

  • HAL Id : hal-01256259, version 1

Collections

Citation

Phong Q. Nguyen. The Hardness of Lattice Problems: Worst-case to Average-case Reductions and Security Estimates. Mathematics of Lattices and Cybersecurity, Apr 2015, Providence, United States. ⟨hal-01256259⟩

Share

Metrics

Record views

157