A lattice reduction algorithm based on sublattice BKZ

DOI10.1007/978-3-030-90402-9_10OpenAlexW3210450395MaRDI QIDQ2697920

Yanbin Pan, Jinzheng Cao, Qingfeng Cheng

Publication date: 13 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90402-9_10

zbMATH Keywords

sublatticeshortest vector problemlattice reductionBKZ algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Uses Software

• BKZ
• fpLLL
• GitHub

Cites Work

• The LLL algorithm. Survey and applications
• 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
• Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
• Slide reduction, revisited -- filling the gaps in SVP approximation
• Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
• Practical, Predictable Lattice Basis Reduction
• BKZ 2.0: Better Lattice Security Estimates
• Sieve algorithms for the shortest vector problem are practical
• Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A lattice reduction algorithm based on sublattice BKZ