Cantitate/Preț
Produs
Total produse
Vezi coșul
Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications de Murray R. Bremner

Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications: Chapman & Hall Pure and Applied Mathematics

Autor Murray R. Bremner
en Limba Engleză Paperback – 14 oct 2024
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 32694 lei  43-57 zile
  CRC Press – 14 oct 2024 32694 lei  43-57 zile
Hardback (1) 61675 lei  43-57 zile
  CRC Press – 12 aug 2011 61675 lei  43-57 zile

Din seria Chapman & Hall Pure and Applied Mathematics

Preț: 32694 lei

Preț vechi: 47243 lei
-31% Nou

Puncte Express: 490
Preț estimativ în valută:
6258€ • 6522$ • 5209£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781032921822
ISBN-10: 103292182X
Pagini: 334
Ilustrații: 54
Dimensiuni: 156 x 234 mm
Greutate: 0.62 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
Seria Chapman & Hall Pure and Applied Mathematics

Locul publicării:Boca Raton, United States

Public țintă

Academic

Cuprins

Introduction to Lattices. Two-Dimensional Lattices. Gram-Schmidt Orthogonalization. The LLL Algorithm. Deep Insertions. Linearly Dependent Vectors. The Knapsack Problem. Coppersmith’s Algorithm. Diophantine Approximation. The Fincke-Pohst Algorithm. Kannan’s Algorithm. Schnorr’s Algorithm. NP-Completeness. The Hermite Normal Form. Polynomial Factorization.

Notă biografică

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.

Recenzii

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

Descriere

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