Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

61

Voted

STOC
2003
ACM

favoriteEmaildiscussreport

103views Algorithms» more STOC 2003»

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

15 years 11 months ago

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

Download www.csie.nuk.edu.tw

Miklós Ajtai

Real-time Traffic

Algorithms | Shortest Nonzero Vector | STOC 2003 |

claim paper

Related Content

» Optimal lower bounds for the KorkineZolotareff parameters of a lattice and for Schnorrs al...

» PublicKey Cryptosystems from the WorstCase Shortest Vector Problem

» Rankins Constant and Blockwise Lattice Reduction

» Trapdoors for Hard Lattices and New Cryptographic Constructions

» Lattices that admit logarithmic worstcase to averagecase connection factors

» A Faster Lattice Reduction Method Using Quantum Search

» Lattice rule algorithms for multivariate approximation in the average case setting

» Representing hard lattices with On log n bits

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	STOC
Authors	Miklós Ajtai

Comments (0)