Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
From MaRDI portal
Publication:2231762
DOI10.1016/j.dam.2021.07.035zbMath1473.94121OpenAlexW3187275826MaRDI QIDQ2231762
Masaya Yasuda, Satoshi Nakamura
Publication date: 30 September 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.07.035
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Shortest vector from lattice sieving: a few dimensions for free
- Development of a dual version of DeepBKZ and its application to solving the LWE challenge
- Second order statistical behavior of LLL and BKZ
- Analysis of DeepBKZ reduction for finding short lattice vectors
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Self-dual DeepBKZ for finding short lattice vectors
- The general sieve kernel and new records in lattice reduction
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- Bounding basis reduction properties
- Explicit formula for Gram-Schmidt vectors in LLL with deep insertions and its applications
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- Practical, Predictable Lattice Basis Reduction
- BKZ 2.0: Better Lattice Security Estimates
- Lattice Enumeration Using Extreme Pruning
- Hermite’s Constant and Lattice Algorithms
- Predicting Lattice Reduction
- Observation on the Minimum of a Positive Quadratic Form in Eight Variables
This page was built for publication: Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
