Generating shorter bases for hard random lattices

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 75-86

  Alwen, Joël ^a   Peikert, Chris ^b  

^a NEW YORK UNIVERSITY   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

Average case hardness; Cryptography; Hermite normal form; Lattices; Random; Short basis

Indexed keywords

AVERAGE-CASE HARDNESS; COMPLEXITY ASSUMPTIONS; CRYPTOGRAPHIC SCHEMES; HERMITE NORMAL FORM; RANDOM; RANDOM LATTICE; SHORT BASIS; SHORT VECTORS;

COMPUTER SCIENCE; CRYSTAL LATTICES;

CRYPTOGRAPHY;

EID: 84880234544     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Miklós Ajtai. Generating hard instances of the short basis problem. In ICALP, pages 1-9, 1999.
2. Miklós Ajtai. Generating hard instances of lattice problems. Quaderni di Matematica, 13:1-32, 2004. Preliminary version in STOC 1996.
3. Oded Goldreich, Shafi Goldwasser, and Shai Halevi. Collision-free hashing from lattice problems. Electronic Colloquium on Computational Complexity (ECCC), 3(42), 1996.
4. Oded Goldreich, Shafi Goldwasser, and Shai Halevi. Public-key cryptosystems from lattice reduction problems. In CRYPTO, pages 112-131, 1997.
5. Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In STOC, pages 197-206, 2008.
6. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
7. Daniele Micciancio. Improving lattice based cryptosystems using the Hermite normal form. In CaLC, pages 126-145, 2001.
8. Daniele Micciancio and Oded Regev. Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput., 37(1):267-302, 2007. Preliminary version in FOCS 2004.
9. Daniele Micciancio and Salil P. Vadhan. Statistical zero-knowledge proofs with efficient provers: Lattice problems and more. In CRYPTO, pages 282-298, 2003.
10. Daniele Micciancio and Bogdan Warinschi. A linear space algorithm for computing the Hermite normal form. In ISSAC, pages 231-236, 2001.
11. Phong Q. Nguyen. Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from Crypto '97. In CRYPTO, pages 288-304, 1999.
12. Phong Q. Nguyen and Oded Regev. Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures. In EUROCRYPT, pages 271-288, 2006.
13. Chris Peikert. Public key cryptosystems from the worst-case shortest vector problem. In submission, 2008.
14. Chris Peikert and Vinod Vaikuntanathan. Noninteractive statistical zero-knowledge proofs for lattice problems. In CRYPTO, pages 536-553, 2008.
15. Chris Peikert, Vinod Vaikuntanathan, and Brent Waters. A framework for efficient and composable oblivious transfer. In CRYPTO, pages 554-571, 2008.
16. Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC, pages 84-93, 2005.