Conference Proceeding

Some Sieving Algorithms for Lattice Problems.

01/2008; DOI:10.4230/LIPIcs.FSTTCS.2008.1738 In proceeding of: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, December 9-11, 2008, Bangalore, India
Source: OAI

ABSTRACT We study the algorithmic complexity of lattice problems based on the sieving technique due to Ajtai, Kumar, and Sivakumar (AKS01). Given a k-dimensional subspace M ⊆ Rn and a full rank integer lattice L ⊆ Qn, the subspace avoiding problem SAP, defined by Bl¨

0 0