Lattice basis reduction: an introduction to the LLL algorithm and its applications

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 adapte...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Beteilige Person: Bremner, Murray R. (VerfasserIn)
Format: Elektronisch E-Book
Sprache:Englisch
Veröffentlicht: Boca Raton, FL CRC Press 2012
Schriftenreihe:Pure and applied mathematics
Monographs and textbooks in pure and applied mathematics
Schlagwörter:
Links:https://learning.oreilly.com/library/view/-/9781439807040/?ar
Zusammenfassung: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. This book provides an introduction to the theory and applications of lattice basis reduction and the LLL algorithm. With numerous examples and suggested exercises, the text discusses various applications of lattice basis reduction to cryptography, number theory, polynomial.
Beschreibung:Includes bibliographical references and index. - Print version record
Umfang:1 Online-Ressource (xvii, 316 Seiten) illustrations
ISBN:9781439807040
1439807043