An Efficient LLL Gram Using Buffered Transformations

DOI10.1007/978-3-540-75187-8_4zbMath1141.68667OpenAlexW1491278117MaRDI QIDQ3508468

Susanne Wetzel, Werner Backes

Publication date: 1 July 2008

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75187-8_4

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (3)

Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem ⋮ Thrackles: An Improved Upper Bound ⋮ An experimental comparison of some LLL-type lattice basis reduction algorithms

This page was built for publication: An Efficient LLL Gram Using Buffered Transformations