Self-dual DeepBKZ for finding short lattice vectors
From MaRDI portal
Publication:2191205
DOI10.1515/jmc-2015-0053zbMath1448.94235OpenAlexW3035919600MaRDI QIDQ2191205
Publication date: 24 June 2020
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2015-0053
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (3)
Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation ⋮ Analysis of DeepBKZ reduction for finding short lattice vectors ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge
Uses Software
Cites Work
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Development of a dual version of DeepBKZ and its application to solving the LWE challenge
- Second order statistical behavior of LLL and BKZ
- Estimate all the {LWE, NTRU} schemes!
- Explicit formula for Gram-Schmidt vectors in LLL with deep insertions and its applications
- Practical, Predictable Lattice Basis Reduction
- BKZ 2.0: Better Lattice Security Estimates
- Lattice Enumeration Using Extreme Pruning
- Hermite’s Constant and Lattice Algorithms
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Predicting Lattice Reduction
This page was built for publication: Self-dual DeepBKZ for finding short lattice vectors
