- New Arrivals
Fiction- Historical FictionCrime & ThrillersMysteryScience-FictionFantasyPoetryRomanceChildren’s BooksYoung Adult
- Biographies & MemoirsHistoryCurrent AffairsTech & ScienceBusinessSelf-DevelopmentTravelThe ArtsFood & WineReligion & SpiritualitySportsHumor
Children’s BooksListsBlogGift CardsMy ListsGames- About & Help
- About Tertulia
- Membership & Co-Ownership
- Shipping & Delivery
- Orders & Payments
- Contact Support
- Send App Feedback
- Follow us
- Download the app
The co-op bookstore for avid readers
Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications
First realized in the 1980s by Lenstra, Lenstra, and Lovasz, the LLL algorithm was originally intended to factor polynomials with rational coefficients. It improved upon the existing lattice reduction algorithm in order to solve integer linear programming problems and was later adapted for use in crypanalysis. 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 polynomial factorization, cryptography, number theory, and matrix canonical forms.
Book Details
- Publisher: CRC Press
- Publish Date: Aug 12nd, 2011
- Pages: 332
- Language: English
- Edition: undefined - undefined
- Dimensions: 8.60in - 5.60in - 0.60in - 0.75lb
- EAN: 9781439807026
- Categories: • Security - General• Number Theory• Programming - Algorithms
About the Author
Murray R. Bremner received a Bachelor of Science from the University of Saskatchewan in 1981, a Master of Computer Science from Concordia University in Montreal in 1984, and a Doctorate in Mathematics from Yale University in 1989. He spent one year as a Postdoctoral Fellow at the Mathematical Sciences Research Institute in Berkeley, and three years as an Assistant Professor in the Department of Mathematics at the University of Toronto. He returned to the Department of Mathematics and Statistics at the University of Saskatchewan in 1993 and was promoted to Professor in 2002. His research interests focus on the application of computational methods to problems in the theory of linear nonassociative algebras, and he has had more than 50 papers published or accepted by refereed journals in this area.
Praise for this book
the book succeeds in making accessible to nonspecialists the area of lattice algorithms, which is remarkable because some of the most important results in the field are fairly recent.
--M. Zimand, Computing Reviews, March 2012
This text is meant as a survey of lattice basis reduction at a level suitable for students and interested researchers with a solid background in undergraduate linear algebra. ... The writing is clear and quite concise.
--Zentralblatt MATH 1237