Review of1 A Course in Computational Algebraic Number Theory By Henri Cohen Published by Springer, 2000, 534 pages Reviewed by Timothy Kelley (klle2td@jmu.edu) James Madison University Introduction: Algebraic number theory is a eld of number theory that studies algebraic numbers. An algebraic number is a number that exists in the set of complex numbers and is a root of a polynomial whose coe cients are in the set of integers. That is, for a number C and polynomial A Z[X],2 is an algebraic number if A( ) = 0, and A is not identically zero.3 The computational aspect of this study involves examining, mathematically, the algorithms that solve problems related to number theory. These algorithms include fast powering algorithms, various algorithms for linear algebra, Euclid s algorithm for greatest common divisor, and elliptical curves, to name a few. These algorithms have become very important in the study of cryptography. The latest cryptography algorithms use elliptical curves, The Advanced Encryption Standard (AES) performs arithmetic over a binary nite eld with a degree of 8, and RSA requires large primes to be generated and encryption and decryption require that the value of a message be raised to a
/lp/association-for-computing-machinery/review-of-a-course-in-computational-algebraic-number-theory-by-henri-aFyd1ku0rS