Sciweavers

MOC
2002
71views more  MOC 2002»
13 years 4 months ago
Efficient lattice assessment for LCG and GLP parameter searches
Abstract. In the present paper we show how to speed up lattice parameter searches for Monte Carlo and quasi
Karl Entacher, Thomas Schell, Andreas Uhl
TOC
2008
94views more  TOC 2008»
13 years 4 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
ECCC
2007
185views more  ECCC 2007»
13 years 4 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan