Improving the BKZ reduction algorithm by quick reordering technique

DOI10.1007/978-3-319-93638-3_47zbMATH Open1444.94106OpenAlexW2808670899MaRDI QIDQ1784512FDOQ1784512

Authors: Tsuyoshi Takagi, Yun-Tao Wang 

Publication date: 26 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-93638-3_47

Recommendations

• Analyzing blockwise lattice algorithms using dynamical systems
• Analysis of DeepBKZ reduction for finding short lattice vectors
• A new parallel lattice reduction algorithm for BKZ reduced bases
• Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
• Measuring, simulating and exploiting the head concavity phenomenon in BKZ

zbMATH Keywords

latticeGSAenumerationBKZ reductionquick reordering technique

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Cited In (2)

• Improved lattice enumeration algorithms by primal and dual reordering methods
• Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator

This page was built for publication: Improving the BKZ reduction algorithm by quick reordering technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784512)