Lattice Basis Reduction - Couverture rigide

Bremner, Murray R.

Couverture rigide

ISBN 10 : 1439807027 ISBN 13 : 9781439807026

Editeur : CRC Press, 2011

Synopsis

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.

A propos du livre

À propos de l?auteur

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.

Détails de l'édition

• Éditeur: CRC Press
• Date d'édition: 2011
• Langue: anglais
• ISBN 10: 1439807027
• ISBN 13: 9781439807026
• Reliure: Relié
• Nombre de pages: 334
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible