Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors

DOI10.1515/jmc-2016-0008zbMath1391.65099OpenAlexW2588019140MaRDI QIDQ515394

Kazuhiro Yokoyama, Takeshi Shimoyama, Takeshi Koshiba, Masaya Yasuda, Jun Kogure

Publication date: 16 March 2017

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2016-0008

zbMATH Keywords

random samplingLLL algorithmSVP

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) General topics of discrete mathematics in relation to computer science (68R01) Cryptography (94A60)

Related Items (3)

Analysis of DeepBKZ reduction for finding short lattice vectors ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths

Uses Software

• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The LLL algorithm. Survey and applications
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
• Mathematics of Public Key Cryptography
• Lattice Enumeration Using Extreme Pruning
• A sieve algorithm for the shortest lattice vector problem
• Fast Lattice Point Enumeration with Minimal Overhead
• Predicting Lattice Reduction
• Algorithmic Number Theory

This page was built for publication: Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors