Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

LLL Algorithm

Name: LLL Algorithm
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 01649919
Price: 85750 HUF
Availability: InStock
Author: Phong Q. Nguyen
ISBN: 9783642022944

Survey and Applications

Phong Q. Nguyen

Brigitte Vallée

Language

English

Book Hardback

Libristo code: 01649919

Publishers Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, November 2009

The LLL algorithm is a polynomial-time lattice reduction algorithm, named after its inventors, Arjen... Full description

Libristo code: 01649919

572 b

85 750 Ft

In stock at our supplier Shipping in 10-13 days

Up to 30 days for returns

Customers also purchased

Manufaktura Świec

Toy

13 996 Ft

DELE escolar - Preparación al Diploma de Español - A1 Mónica García-Viñó Sánchez

Paperback

6 473 Ft

Ztracený Tim Weaver

Hardback

6 024 Ft

Logisch! - Kursbuch A1 Ute Koithan

Paperback

8 510 Ft

Zakręty życia Woydyłło Ewa

Paperback

3 265 Ft

Mega-Mosaik. Bd.1. Bd.1

Paperback

5 694 Ft

The LLL algorithm is a polynomial-time lattice reduction algorithm, named after its inventors, Arjen Lenstra, Hendrik Lenstra and László Lovász. The algorithm has revolutionized computational aspects of the geometry of numbers since its introduction in 1982, leading to breakthroughs in fields as diverse as computer algebra, cryptology and algorithmic number theory.§This book consists of 15 survey chapters on computational aspects of Euclidean lattices and their main applications. Topics covered include polynomial factorization, lattice reduction algorithms, applications in number theory, integer programming, provable security, lattice-based cryptography and complexity.§The authors include many detailed motivations, explanations and examples, and the contributions are largely self-contained. The book will be of value to a wide range of researchers and graduate students working in related fields of theoretical computer science and mathematics.