Lattice Reduction by Random Sampling and Birthday Methods

  title={Lattice Reduction by Random Sampling and Birthday Methods},
  author={Claus-Peter Schnorr},
We present a novel practical algorithm that given a lattice basis b1, ..., bn finds in O(n ( k 6 )) average time a shorter vector than b1 provided that b1 is ( k 6 ) times longer than the length of the shortest, nonzero lattice vector. We assume that the given basis b1, ..., bn has an orthogonal basis that is typical for worst case lattice bases. The new reduction method samples short lattice vectors in high dimensional sublattices, it advances in sporadic big jumps. It decreases the… CONTINUE READING
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.
66 Citations
8 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 66 extracted citations

Similar Papers

Loading similar papers…