Factorization and Primality Testing (Undergraduate Texts in Mathematics) (Hardcover)

~ (Author) "The integers larger than 1 are of two types: the composite integers which can be written as a product of two integers larger than 1..." (more)
Key Phrases: unfactored portion, pseudoprime test, cubic integers, Quadratic Sieve, Proof Let, Carl Pomerance (more...)

Editorial Reviews

Product Description

This book focuses on a single problem: how to factor a large integer or prove its prime. From the Sieve of Eratosthenes of ancient Greece to the Multiple Polynomial Quadratic Sieve and the Elliptic Curve Methods discovered in the past few years, this self-contained text provides a survey of the heritage and an introduction to the current research in this field. It can also be used as an introduction to Number Theory and has the advantage over most texts in this area of being built around a unifying theme. With its strong emphasis on algorithms, it encourages learning through computation and experimentation.

Product Details

• Hardcover: 260 pages
• Publisher: Springer; 1 edition (October 2, 1989)
• Language: English
• ISBN-10: 0387970401
• ISBN-13: 978-0387970400
• Product Dimensions: 9.3 x 5.9 x 0.7 inches
• Shipping Weight: 1.1 pounds (View shipping rates and policies)
• Average Customer Review: 4.0 out of 5 stars  See all reviews (3 customer reviews)
• Amazon.com Sales Rank: #933,080 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

10 of 10 people found the following review helpful:

4.0 out of 5 stars Excellent Text on Factorization, December 11, 2000

By	"zein" (Athens, GA USA) - See all my reviews

This is one of the most compact and best organization of material on the subject of factorization and primality.

Written by a promising author, this book explores factorization from the beginning to end, starting with the sieve of Eratosthenes and proceeding to much more complicated material. The book focuses on algorithms, and contains many useful ones, such as how to raise a number a to a power b, mod m. However, the primary focus of the book is factorization, so it contains algorithms for factorizations. They begin with trial division, then progress into Fermat's Algorithm and Pollard Rho. They eventually evolve into one of the strongest methods to date, Quadratic Sieve, and its child, Multiple Polynomial Quadratic Sieve.

This book is certainly a must for amateurs who are exploring the subject.

8 of 11 people found the following review helpful:

4.0 out of 5 stars Just the facts mam, just the facts., July 8, 1999

By A Customer

This book gives you the juicy bits you want for factoring and primality testing. It skips all the theory and presents the algorithims before you to observe and play with. For the amateur, this is an excellent first book.

1 of 1 people found the following review helpful:

4.0 out of 5 stars Old, but pertinent., October 4, 2009

By	Andrew - See all my reviews

Amazon Verified Purchase

As far as I can tell this is the first edition of a book written in 1989, almost 20 years ago. Fortunately, the material is still relevant. The author does a good job of presenting the information in a precise manner that is understandable to the reader. Still you will see that the largest Mersenne prime listed in the book is hopelessly out-of-date, and you will find some errors which were never corrected. May I request a second edition for this book as to make it up-to-date?