Cantitate/Preț
Produs

The LLL Algorithm: Survey and Applications: Information Security and Cryptography

Editat de Phong Q. Nguyen, Brigitte Vallée
en Limba Engleză Paperback – 14 mar 2012

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 145294 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 14 mar 2012 145294 lei  6-8 săpt.
Hardback (1) 145772 lei  3-5 săpt.
  Springer Berlin, Heidelberg – 30 noi 2009 145772 lei  3-5 săpt.

Din seria Information Security and Cryptography

Preț: 145294 lei

Preț vechi: 181617 lei
-20% Nou

Puncte Express: 2179

Preț estimativ în valută:
27805 28992$ 23109£

Carte tipărită la comandă

Livrare economică 20 martie-03 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642261640
ISBN-10: 3642261647
Pagini: 512
Ilustrații: XIV, 496 p. 42 illus.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.71 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Information Security and Cryptography

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

The History of the LLL-Algorithm.- Hermite#x2019;s Constant and Lattice Algorithms.- Probabilistic Analyses of Lattice Reduction Algorithms.- Progress on LLL and Lattice Reduction.- Floating-Point LLL: Theoretical and Practical Aspects.- LLL: A Tool for Effective Diophantine Approximation.- Selected Applications of LLL in Number Theory.- The van Hoeij Algorithm for Factoring Polynomials.- The LLL Algorithm and Integer Programming.- Using LLL-Reduction for Solving RSA and Factorization Problems.- Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign.- The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance.- Cryptographic Functions from Worst-Case Complexity Assumptions.- Inapproximability Results for Computational Problems on Lattices.- On the Complexity of Lattice Problems with Polynomial Approximation Factors.

Recenzii

From the reviews:
 
“Tells the history of the LLL algorithm and paper. … this helpful and useful volume is a welcome reference book that covers nearly all applications of lattice reduction.”
[Samuel S. Wagstaff, Jr., Mathematical Reviews, Issue 2011 m]
 
“This book is a compilation of survey-cum-expository articles contributed by leading experts ... The LLL algorithm embodies the power of lattice reduction on a wide range of problems in pure and applied fields [... and] the success of LLL attests to the triumph of theory in computer science. This book provides a broad survey of the developments in various fields of mathematics and computer science emanating from the LLL algorithm. As well-known researchers in their areas, the authors present an invaluable perspective on the topics by sharing their insights and understanding. The book is an exemplar of the unity of computer science in bringing a broad array of concepts, tools and techniques to the study of lattice problems. The many open problems and questions stated in every chapter of the book will inspire researchers to explore the LLL algorithm and its variants further. Graduate students in computer science and mathematics and researchers in theoretical computer science will find this book very useful. Finally, it is simply a pleasure to read this lovely book.”
[Krishnan Narayanan, SIGACT News Book Review Column 45(4) 2014]

Caracteristici

The first book to offer a comprehensive view of the LLL algorithm.