Results 251 to 260 of about 6,692,580 (276)

A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices

Lecture Notes in Computer Science, 2011
The security of lattice based cryptography can be considered to be based on the hardness of the shortest vector problem (SVP) in lattices. Sieving algorithms can be used to solve this problem, at least in small dimensions. The most promising among the sieving algorithms is GaussSieve.
Benjamin Milde, Michael Schneider 0002
exaly   +2 more sources

Hardness of Approximating the Shortest Vector Problem in Lattices

45th Annual IEEE Symposium on Foundations of Computer Science, 2004
Let p > 1 be any fixed real. We show that assuming NP ⊈ RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in ℓ p norm within a constant factor. Under the stronger assumption NP ⊈ RTIME(2 poly
openaire   +1 more source

An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem

2001
We present an overview of a randomized 2g(n) time algorithm to compute a shortest non-zero vector in an n-dimensional rational lattice. The complete details of this algorithm can be found in [2].
Miklós Ajtai, Ravi Kumar 0001, D. Sivakumar 0001   +2 more
openaire   +2 more sources

The Shortest Vector Problem in Lattices with Many Cycles

2001
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn/Λ. We give a proof that the shortest vector problem is NP-complete in the max-norm for n-dimensional lattices Λ where Zn/Λ has n-1 cycles.
openaire   +1 more source

Metropolis algorithm for solving shortest lattice vector problem (SVP)

2011 11th International Conference on Hybrid Intelligent Systems (HIS), 2011
In this paper we study the suitability of the Metropolis Algorithm and its generalization for solving the shortest lattice vector problem (SVP). SVP has numerous applications spanning from robotics to computational number theory, viz., polynomial factorization. At the same time, SVP is a notoriously hard problem.
Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur   +2 more
openaire   +2 more sources

Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices

2011
Lattice based cryptography is gaining more and more importance in the cryptographic community. The security of lattice based cryptosystems can be proven to be as hard as worst case lattice problems. The most important underlying hard problem is the shortest vector problem.
openaire   +2 more sources

Shortest Vector Problem

2008
openaire   +1 more source

Hardness of Approximating the Shortest Vector Problem in Lattices

Journal of the ACM, 2005
Subhash Khot
exaly  

Meta-Heuristic Approaches to Solve Shortest Lattice Vector Problem

Journal of Discrete Mathematical Sciences and Cryptography, 2021
exaly  

Hardness of Approximating the Shortest Vector Problem in High ℓp Norms

Journal of Computer and System Sciences, 2006
Subhash Khot
exaly