Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem

DOI10.1007/978-3-319-76578-5_15zbMath1439.94062OpenAlexW2791408823MaRDI QIDQ1749295

Kenji Kashiwabara, Goichiro Hanaoka, Tadanori Teruya

Publication date: 16 May 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-76578-5_15

zbMATH Keywords

parallelizationshortest vector problemlattice basis reductionSVP challenge

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (6)

Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths

This page was built for publication: Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem