Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

CALC
2001
Springer

favoriteEmaildiscussreport

161views Cryptology» more CALC 2001»

The Shortest Vector Problem in Lattices with Many Cycles

13 years 10 months ago

The Shortest Vector Problem in Lattices with Many Cycles

Download www.nada.kth.se

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. We also give experimental data that show that the LLL algorithm does not perform signiﬁcantly better on lattices with a high number of cycles.

Mårten Trolin

Real-time Traffic

Additive Group Zn | CALC 2001 | Cryptology | Shortest Vector Problem | Zn /Λ |

claim paper

Related Content

» Lattices with Many Cycles Are Dense

» Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm vi...

» Faster exponential time algorithms for the shortest vector problem

» A sieve algorithm for the shortest lattice vector problem

» Parallel Enumeration of Shortest Lattice Vectors

» Lattice problems and norm embeddings

» WorstCase to AverageCase Reductions Based on Gaussian Measures

» Shortest Lattice Vectors in the Presence of Gaps

» PublicKey Cryptosystems from the WorstCase Shortest Vector Problem

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CALC
Authors	Mårten Trolin

Comments (0)