Lattice Basis Reduction

Name: Lattice Basis Reduction
Brand: CRC PR INC
Price: 103.75 AUD
Availability: BackOrder

An Introduction to the LLL Algorithm and Its Applications

By: Murray R. Bremner

Write A Review

Paperback | 14 October 2024 | Edition Number 1

At a Glance

Paperback
332 Pages

Dimensions(cm)
23.4 x 15.6

Paperback

RRP $120.00

$103.75

14%OFF

or 4 interest-free payments of $25.94 with

or

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

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

Industry Reviews

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

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.