Sciweavers

Share
42 search results - page 1 / 9
» Some Sieving Algorithms for Lattice Problems
Sort
View
FSTTCS
2008
Springer
9 years 2 months ago
Some Sieving Algorithms for Lattice Problems
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
Vikraman Arvind, Pushkar S. Joglekar
STOC
2001
ACM
160views Algorithms» more  STOC 2001»
10 years 1 months ago
A sieve algorithm for the shortest lattice vector problem
Miklós Ajtai, Ravi Kumar, D. Sivakumar
CHES
2007
Springer
136views Cryptology» more  CHES 2007»
9 years 7 months ago
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
Tetsuya Izu, Jun Kogure, Takeshi Shimoyama
SODA
2016
ACM
66views Algorithms» more  SODA 2016»
3 years 9 months ago
New directions in nearest neighbor searching with applications to lattice sieving
To solve the approximate nearest neighbor search problem (NNS) on the sphere, we propose a method using locality-sensitive filters (LSF), with the property that nearby vectors ha...
Anja Becker, Léo Ducas, Nicolas Gama, Thijs...
CORR
2010
Springer
178views Education» more  CORR 2010»
8 years 12 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
books