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.
"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)
Describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed description of each algorithm allows immediate
"About this title" may belong to another edition of this title.
£ 2.74 shipping within United Kingdom
Destination, rates & speeds£ 27.39 shipping from Chile to United Kingdom
Destination, rates & speedsSeller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Seller Inventory # Z1-A-003-03119
Quantity: 1 available
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Hardcover. Condition: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less 2.08. Seller Inventory # G0387556400I5N00
Quantity: 1 available
Seller: Antiquariat Jochen Mohr -Books and Mohr-, Oberthal, Germany
hardcover. Condition: Sehr gut. 555 Seiten 9780387556406 Wir verkaufen nur, was wir auch selbst lesen würden. Sprache: Deutsch Gewicht in Gramm: 967. Seller Inventory # 89080
Quantity: 1 available
Seller: LIBRERIA LEA+, Santiago, RM, Chile
Dura. Condition: New. Dust Jacket Condition: Nuevo. No Aplica (illustrator). 0. This book, written by one of the leading authorities in the field, describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed descrption of each algorithm allowa immediate computer implementation; numerous further hints for implementation are also provided. Many of the algorithms hace never been published or appear here for the first in book form. The first sever chapters lead the reader to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, and for elliptic curve computations. The last three chapters give a survey of factoring and primality testing methods, including a detailed description of the number-field sieve algorithm. The book ends with a description of available computer packages and some useful tables. It caontains a large number of exercises. OBSERVACI?N: La tapa trasera tiene un pequeño daño. 920 gr. Libro. Seller Inventory # 9780387556406LEA19513
Quantity: 1 available