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
1 Institute for Advanced Study [Tsinghua]
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 <>
Submitted on : Thursday, January 14, 2016 - 3:34:36 PM
Last modification on : Wednesday, June 2, 2021 - 3:39:52 AM

Identifiers

  • HAL Id : hal-01256259, version 1

Collections

CNRS | INRA | CIRAD | INRIA | LIAMA | INRAE

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

263

 

Contact                    Legal Notice                    Personal Data