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.
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
10 of 10 people found the following review helpful:
4.0 out of 5 stars
Excellent Text on Factorization,
By true1987 "zein" (Athens, GA USA) - See all my reviews
This review is from: Factorization and Primality Testing (Undergraduate Texts in Mathematics) (Hardcover)
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.
3 of 3 people found the following review helpful:
4.0 out of 5 stars
Old, but pertinent.,
By
Amazon Verified Purchase(What's this?)
This review is from: Factorization and Primality Testing (Undergraduate Texts in Mathematics) (Hardcover)
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?
8 of 11 people found the following review helpful:
4.0 out of 5 stars
Just the facts mam, just the facts.,
By A Customer
This review is from: Factorization and Primality Testing (Undergraduate Texts in Mathematics) (Hardcover)
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.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
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 and the prime integers (or primes) which cannot. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
unfactored portion, pseudoprime test, cubic integers, rank mod, extended integers, strong pseudoprime, complex integers, factor base, prime moduli, primality test, trial division, largest prime factor, positive quadratic form, continued fraction algorithm, factoring large numbers, factorization techniques, factorization algorithm, primitive root Key Phrases - Capitalized Phrases (CAPs): (learn more)
Quadratic Sieve, Proof Let, Carl Pomerance, Chinese Remainder Theorem, Edouard Lucas, Board of Health, Computational Methods, General Approach, Mathematisch Centrum, Pierre de Fermat, Some Observations, Using Equations New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
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 and the prime integers (or primes) which cannot. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
unfactored portion, pseudoprime test, cubic integers, rank mod, extended integers, strong pseudoprime, complex integers, factor base, prime moduli, primality test, trial division, largest prime factor, positive quadratic form, continued fraction algorithm, factoring large numbers, factorization techniques, factorization algorithm, primitive root Key Phrases - Capitalized Phrases (CAPs): (learn more)
Quadratic Sieve, Proof Let, Carl Pomerance, Chinese Remainder Theorem, Edouard Lucas, Board of Health, Computational Methods, General Approach, Mathematisch Centrum, Pierre de Fermat, Some Observations, Using Equations New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 100
books:
See all 100 books this book cites
100
books
cite this book:
See all 100 books citing this book
- Prime Numbers and Computer Methods for Factorization (Progress in Mathematics) by Hans Riesel in Front Matter, and page 71
- Constructive Combinatorics (Undergraduate Texts in Mathematics) by Dennis Stanton in Front Matter, and Back Matter
- Advances in Cryptology (Lecture Notes in Computer Science) by T. Beth on page 118, and page 119
- Topology of Surfaces (Undergraduate Texts in Mathematics) by L.Christine Kinsey in Back Matter
- Intermediate Calculus (Undergraduate Texts in Mathematics) by Murray H. Protter in Back Matter
See all 100 books this book cites
- Security in Fixed and Wireless Networks: An Introduction to Securing Data Communications by Günter Schäfer on page 77, and Back Matter
- Reading, Writing, and Proving: A Closer Look at Mathematics (Undergraduate Texts in Mathematics) by Ulrich Daepp in Front Matter, and Back Matter
- Introduction to the Mathematics of Finance: From Risk Management to Options Pricing (Undergraduate Texts in Mathematics) by Steven Roman in Front Matter
- Differential Equations: An Introduction with Mathematica® (Undergraduate Texts in Mathematics) by Clay C. Ross in Front Matter
- Topology of Surfaces (Undergraduate Texts in Mathematics) by L.Christine Kinsey in Front Matter
See all 100 books citing this book
Books on Related Topics
(learn more)
|
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
