![Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications by Murray R. Bremner [Repost]](https://pixhost.icu/avaxhome/1c/35/002d351c_medium.jpeg)
Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications by Murray R. Bremner [Repost]
![Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications by Murray R. Bremner [Repost]](https://pixhost.icu/avaxhome/1c/35/002d351c.jpeg)
Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications by Murray R. Bremner
English | 2011 | ISBN: 1439807027 | 334 pages | PDF | 3 MB
English | 2011 | ISBN: 1439807027 | 334 pages | PDF | 3 MB
First developed in the early 1980s by Lenstra, Lenstra, and Lovász, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients. It very quickly became an essential tool in integer linear programming problems and was later adapted for use in cryptanalysis.