37 search results - page 2 / 8 » Some Sieving Algorithms for Lattice Problems |
CODCRY
2011
Springer
12 years 8 months ago
2011
Springer
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
IACR
2011
12 years 4 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...