Search Sciweavers | Sciweavers

98 search results - page 4 / 20

» Hardness of Approximating the Shortest Vector Problem in Lat...

click to vote

STOC
2003
ACM

116views Algorithms» more STOC 2003»

New lattice based cryptographic constructions

14 years 23 days ago

Download www.cs.tau.ac.il

We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian d...

Oded Regev

claim paper

Read More »

click to vote

SODA
2010
ACM

232views Algorithms» more SODA 2010»

Faster exponential time algorithms for the shortest vector problem

14 years 4 months ago

Download cseweb.ucsd.edu

We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any n-dimensional l...

Daniele Micciancio, Panagiotis Voulgaris

claim paper

Read More »

click to vote

CRYPTO
2008
Springer

134views Cryptology» more CRYPTO 2008»

Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems

13 years 9 months ago

Download people.csail.mit.edu

We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...

Chris Peikert, Vinod Vaikuntanathan

claim paper

Read More »

click to vote

STOC
2003
ACM

103views Algorithms» more STOC 2003»

The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice

14 years 7 months ago