Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Lattice Basis Reduction : An Introduction to the LLL Algorithm and Its Applications, Hardback Book

Lattice Basis Reduction : An Introduction to the LLL Algorithm and Its Applications Hardback

Part of the Chapman & Hall Pure and Applied Mathematics series

Hardback

Description

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 factorization, and matrix canonical forms.

Information

Other Formats

£110.00

 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

Also in the Chapman & Hall Pure and Applied Mathematics series  |  View all