Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors
DOI10.1515/JMC-2016-0008zbMATH Open1391.65099OpenAlexW2588019140MaRDI QIDQ515394FDOQ515394
Authors: Masaya Yasuda, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, Takeshi Koshiba 
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
Recommendations
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Analysis of DeepBKZ reduction for finding short lattice vectors
- scientific article; zbMATH DE number 1962809
- scientific article; zbMATH DE number 3972987
- Random sampling revisited: lattice enumeration with discrete pruning
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Cryptography (94A60) General topics of discrete mathematics in relation to computer science (68R01)
Cites Work
- Title not available (Why is that?)
- A sieve algorithm for the shortest lattice vector problem
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Mathematics of public key cryptography.
- Predicting Lattice Reduction
- Title not available (Why is that?)
- Lattice basis reduction. An introduction to the LLL algorithm and its applications
- The LLL algorithm. Survey and applications
- Title not available (Why is that?)
- Lattice enumeration using extreme pruning
- The shortest vector in a lattice is hard to approximate to within some constant
- Title not available (Why is that?)
- Fast lattice point enumeration with minimal overhead
- Algorithmic Number Theory
Cited In (3)
Uses Software
This page was built for publication: Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515394)
