




A Course in Computational Algebraic Number Theory (Graduate Texts in Mathematics) [Hardcover]
Our Price 
$ 84.55


Retail Value 
$ 89.95 

You Save 
$ 5.40 

Item Number 
228681 





Available on the Internet only.





Item description for A Course in Computational Algebraic Number Theory (Graduate Texts in Mathematics) by Henri Cohen...
This book describes 148 algorithms which are fundamental for numbertheoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters lead the reader 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. 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. The book also contains a large number of exercises. Written by an authority in the field, and one with great practical and teaching experience it is sure to become the standard and indispensable reference on the subject. Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy  you will find what you want at promiseangels.com!
Item Specifications...
Pages 564
Est. Packaging Dimensions: Length: 1.5" Width: 6.25" Height: 9.25" Weight: 2.2 lbs.
Binding Hardcover
Release Date Jul 19, 2000
Publisher Springer
ISBN 3540556400 ISBN13 9783540556404

Availability 71 units. Availability accurate as of Jan 19, 2017 04:00.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.

More About Henri Cohen


Cohen, Universite de Bordeaux 1, Talence, France.
Henri Cohen was born in 1945 and has an academic affiliation as follows  Universite Paris Descartes Universite du Quebec a Montreal / Max Planc.
Are You The Artisan or Author behind this product?
Improve our customers experience by
registering for an Artisan Biography Center Homepage.

Product Categories
Reviews  What do customers think about A Course in Computational Algebraic Number Theory (Graduate Texts in Mathematics)?
 Great book for computational aspects Mar 2, 2007 
I bought this book for the math course I had taken having the same title. This is an excellent book, but only if you are really interested in its content. It's not a casual read, since it's graduate text. Also, a background in number theory will be of great help  being a CS major, I had a little tough time in the beginning, but things turned out just fine. As for content, it has excellent coverage of the subject, and I would highly recommend this as a reference in this subject. Remember, though, that this book deals COMPUTATIONAL aspects, for only number theory, look for other books like IrelandRosen.    Definitely belongs on the shelf of all number theory lovers Aug 23, 2001 
This book is an excellent compilation of both the theory and pseudocode for number theoretic algorithms. The author also takes the time to prove some of the major results as background to the algorithms, in addition to sets of exercises at the end of the book. The book is too large to do a chapter by chapter review, so instead I will list the algorithms in the book that I thought were particularly useful: 1. Most of the algorithms on elliptic curves. The author reminds the reader that numbertheoretical experiments resulted in the famous SwinnertonDyer Conjecture and the Birch Conjecture. (a) the reduction algorithm, which for a given point in the upper half plane, gives the unique point in the half plane equivalent to this point under the action of the special linear group along with the matrix that maps these two points to each other. (b) The computation of the coefficient g2 and g3 of the Weierstrass equation of an elliptic curve. (c) The computation of the Weierstrass function and its derivative. (d) Determination of the periods of an elliptic curve over the real numbers. (e) The determination of the elliptic logarithm. (f) The reduction of a general cubic (f) The ShanksMestre algorithm for computing the order of an elliptic curve over a finite field F(p), where p is prime and greater than 457. (g) The reduction of an elliptic curve modulo p for p > 3. (h) The reduction of an elliptic curve modulo 2 or 3. (i) Reduction of an elliptic curve over the rational numbers. (j) Determination of the rational torsion points of an elliptic curve. (k) Computation of the Hilbert class polynomials and thus a determination of the jfunction of an elliptic curve. 2. A few of the algorithms on factoring. (a) The Pollard algorithm for finding nontrivial factors of composites. (The author does not give the improved algorithm due to P. Montgomery, but does give references) (b) Shanks Square Form Factorization algorithm for finding a nontrivial factor of an odd integer. (c) Lenstra's Elliptic Curve test for compositeness. 3. Primality tests (a) The Jacobi Sum Primality Test for a positive integer. (b) GoldwasserKillian elliptic curve test for a positive integer not equal to 1 and coprime to 6. The author gives an overview of the computer packages used for number theory, including Pari, which was written by him and his collaborators. I have not used this package, but instead use Lydia and Mathematica for most of the number theoretic computations I need to do.    Excellent! Aug 24, 2000 
Cohen (the world renowned expert) starts with the most basic of algorithms (i.e. Euclid & Shanks). He moves seamlessly into Linear Algebra & Polynomials (bedrocks of most CAS). Although meant to be concise, he proves, or sketches a proof of the important results. Finally, the meat of the book, C.A.N.T. One important problem is finding the "class number" (has to do with unique factorization, which we are all accustomed to in Z). A detailed description of the continued fraction algorithm (for finding the fundamental unit), and others made it very enlightening. He then deals with primality testing and factoring, two very important problems, the latter because of RSA. First, a description of the algorithm, then the theory behind it. He covered everything, from Trial Division (Dark Ages) to Pollard Rho to NFS (cuttingedge). Also included are some useful tables. Of course, CAS information from 1993, won't be that helpful (look in his newest, Advanced Topics in C.A.N.T.). Excellent. Also try Knuth's "Seminumerical Algorithms" for a more computer oriented approach.   Write your own review about A Course in Computational Algebraic Number Theory (Graduate Texts in Mathematics)
Ask A Question or Provide Feedback regarding A Course in Computational Algebraic Number Theory (Graduate Texts in Mathematics)
Add This Product Widget To Your Website
Looking to add this information to your own website? Then use our Product Widget to allow you to display product information in a frame that is 120 pixels wide by 240 pixels high.


Copy and paste the following HTML into your website and enjoy!


