|
![]() |
|||
|
||||
OverviewFirst developed in the early 1980s by Lenstra, Lenstra, and Lovasz, 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 factorization, and matrix canonical forms. Full Product DetailsAuthor: Murray R Bremner (University of Saskatchewan, Saskatoon, Canada)Publisher: CRC Press Imprint: CRC Press ISBN: 9781283311502ISBN 10: 128331150 Pages: 330 Publication Date: 01 January 2011 Audience: General/trade , General Format: Undefined Publisher's Status: Active Availability: Available To Order ![]() We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |