This book describes 148 algorithms which are essential for serious number-theoretic computations, in particular for computations related to lattices, algebraic number theory, elliptic curves, primality testing and factoring. For each algorithm, a complete theoretical introduction is given so that prerequisites are reduced to a minimum. Many implementation hints and exercises are also provided.
"synopsis" may belong to another edition of this title.
From the reviews:
H. Cohen
A Course in Computational Algebraic Number Theory
"With numerous advances in mathematics, computer science, and cryptography, algorithmic number theory has become an important subject. Undoubtedly, this book, written by one of the leading authorities in the field, is one of the most beautiful books available on the market."
―ACTA SCIENTIARUM MATHEMATICARUM
“This book is intended to provide material for a three-semester sequence, introductory, graduate course in computational algebraic number theory. ... The book is excellent. ... The book has 75 sections, making it suitable for a three-semester sequence. There are numerous exercises at all levels ... . The bibliography is quite comprehensive and therefore has intrinsic value in its own right. ... chapters bring the student to the frontiers of the field, covering elliptic curves, modern primality testing and modern factoring methods.” (Russell Jay Hendel, The Mathematical Association of America, January, 2011)
"About this title" may belong to another edition of this title.
FREE shipping within United Kingdom
Destination, rates & speedsSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 12033553-n
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9783642081422
Quantity: 10 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In English. Seller Inventory # ria9783642081422_new
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject. 560 pp. Englisch. Seller Inventory # 9783642081422
Quantity: 2 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - With the advent of powerful computing tools and numerous advances in math ematics, computer science and cryptography, algorithmic number theory has become an important subject in its own right. Both external and internal pressures gave a powerful impetus to the development of more powerful al gorithms. These in turn led to a large number of spectacular breakthroughs. To mention but a few, the LLL algorithm which has a wide range of appli cations, including real world applications to integer programming, primality testing and factoring algorithms, sub-exponential class group and regulator algorithms, etc . Several books exist which treat parts of this subject. (It is essentially impossible for an author to keep up with the rapid pace of progress in all areas of this subject.) Each book emphasizes a different area, corresponding to the author's tastes and interests. The most famous, but unfortunately the oldest, is Knuth's Art of Computer Programming, especially Chapter 4. The present book has two goals. First, to give a reasonably comprehensive introductory course in computational number theory. In particular, although we study some subjects in great detail, others are only mentioned, but with suitable pointers to the literature. Hence, we hope that this book can serve as a first course on the subject. A natural sequel would be to study more specialized subjects in the existing literature. Seller Inventory # 9783642081422
Quantity: 1 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783642081422
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Immediate bestselling graduate textbookA description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first se. Seller Inventory # 5047189
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 12033553-n
Quantity: Over 20 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. Neuware -With the advent of powerful computing tools and numerous advances in math ematics, computer science and cryptography, algorithmic number theory has become an important subject in its own right. Both external and internal pressures gave a powerful impetus to the development of more powerful al gorithms. These in turn led to a large number of spectacular breakthroughs. To mention but a few, the LLL algorithm which has a wide range of appli cations, including real world applications to integer programming, primality testing and factoring algorithms, sub-exponential class group and regulator algorithms, etc . Several books exist which treat parts of this subject. (It is essentially impossible for an author to keep up with the rapid pace of progress in all areas of this subject.) Each book emphasizes a different area, corresponding to the author's tastes and interests. The most famous, but unfortunately the oldest, is Knuth's Art of Computer Programming, especially Chapter 4. The present book has two goals. First, to give a reasonably comprehensive introductory course in computational number theory. In particular, although we study some subjects in great detail, others are only mentioned, but with suitable pointers to the literature. Hence, we hope that this book can serve as a first course on the subject. A natural sequel would be to study more specialized subjects in the existing literature.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 560 pp. Englisch. Seller Inventory # 9783642081422
Quantity: 2 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 12033553
Quantity: Over 20 available