Lower bounds of shortest vector lengths in random NTRU lattices

DOI10.1016/J.TCS.2014.10.011zbMATH Open1304.46004OpenAlexW2236597804MaRDI QIDQ477183FDOQ477183

Authors: Jingguo Bi, Qi Cheng 

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.011

Recommendations

• Lower bounds of shortest vector lengths in random NTRU lattices
• On the distribution of lengths of short vectors in a random lattice
• Estimates of lengths of shortest nonzero vectors in some lattices. I
• Estimates of lengths of shortest nonzero vectors in some lattices. II
• Long shortest vectors in low dimensional lattices
• On polynomial approximations to the shortest lattice vector length
• Minimal condition for shortest vectors in lattices of low dimension
• scientific article; zbMATH DE number 3870586
• Random Lattice Vectors in a Set of Size O(n)
• On the distribution of angles between the \(N\) shortest vectors in a random lattice

zbMATH Keywords

Kolmogorov complexityshortest vector problemGaussian heuristicNTRU latticesrandom lattices

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Ordered topological linear spaces, vector lattices (46A40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A mean value theorem in geometry of numbers
• Title not available (Why is that?)
• Solving low-density subset sum problems
• Improved low-density subset sum algorithms
• The Rank of Circulant Matrices
• Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
• Lattice points in high-dimensional spheres
• The shortest vector in a lattice is hard to approximate to within some constant
• Lower bounds of shortest vector lengths in random NTRU lattices
• Title not available (Why is that?)
• Topics in Cryptology – CT-RSA 2005
• New Chosen-Ciphertext Attacks on NTRU

Cited In (4)

• Lower bounds of shortest vector lengths in random NTRU lattices
• On the smoothing parameter and last minimum of random orthogonal lattices
• Long shortest vectors in low dimensional lattices
• On the non-existence of short vectors in random module lattices

Uses Software

• NTRU

This page was built for publication: Lower bounds of shortest vector lengths in random NTRU lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477183)