//]]>

The LLL Algorithm (Record no. 21535)

000 -LEADER
fixed length control field 03621nam a22005295i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310151117.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100301s2010 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642022951
978-3-642-02295-1
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.D35
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.74
Edition number 23
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2010.
912 ## -
-- ZDB-2-SCS
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Nguyen, Phong Q.
Relator term editor.
245 14 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title The LLL Algorithm
Medium [electronic resource] :
Remainder of title Survey and Applications /
Statement of responsibility, etc edited by Phong Q. Nguyen, Brigitte Vallée.
300 ## - PHYSICAL DESCRIPTION
Extent XIV, 496 p.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Information Security and Cryptography,
International Standard Serial Number 1619-7100
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note The History of the LLL-Algorithm -- Hermite’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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
Topical term or geographic name as entry element Data structures (Computer science).
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Computational complexity.
Topical term or geographic name as entry element Algorithms.
Topical term or geographic name as entry element Number theory.
Topical term or geographic name as entry element Mathematical optimization.
Topical term or geographic name as entry element Computer Science.
Topical term or geographic name as entry element Data Structures, Cryptology and Information Theory.
Topical term or geographic name as entry element Algorithms.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
Topical term or geographic name as entry element Number Theory.
Topical term or geographic name as entry element Optimization.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Vallée, Brigitte.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642022944
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-02295-1
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-04-14AUM Main Library2014-04-14 2014-04-14 E-Book   AUM Main Library005.74

Languages: 
English |
العربية