Sponsored

Customers who viewed this item also viewed

Buy New
-63% $37.24
FREE delivery October 23 - November 13
Ships from: Dorian's Day
Sold by: Dorian's Day
$37.24 with 63 percent savings
List Price: $99.99 Image
FREE delivery October 23 - November 13. Details
Only 1 left in stock - order soon.
$$37.24 () Includes selected options. Includes initial monthly payment and selected options. Details
Price
Subtotal
$$37.24
Subtotal
Initial payment breakdown
Shipping cost, delivery date, and order total (including tax) shown at checkout.
Shipper / Seller
Returns
30-day refund/replacement
30-day refund/replacement
Quick refund
Usually issued within 24 hours. See exceptions
Shipping fee
May apply, not eligible for free return. See details
Convenient dropoff
At any of our 50,000 US locations.
See return policy
Payment
Secure transaction
Your transaction is secure
We work hard to protect your security and privacy. Our payment security system encrypts your information during transmission. We don’t share your credit card details with third-party sellers, and we don’t sell your information to others. Learn more
$33.78
A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail See less
FREE delivery October 7 - 9. Details
In stock
$$37.24 () Includes selected options. Includes initial monthly payment and selected options. Details
Price
Subtotal
$$37.24
Subtotal
Initial payment breakdown
Shipping cost, delivery date, and order total (including tax) shown at checkout.
Access codes and supplements are not guaranteed with used items.
Ships from and sold by Stellar Book Company.
Added to

Sorry, there was a problem.

There was an error retrieving your Wish Lists. Please try again.

Sorry, there was a problem.

List unavailable.
Sponsored
Kindle app logo image

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.

Read instantly on your browser with Kindle for Web.

Using your mobile phone camera - scan the code below and download the Kindle app.

QR code to download the Kindle App

  • Prime Numbers and Computer Methods for Factorization (Progress in Probability)

Follow the author

Follow authors for new release and deal updates, plus improved recommendations. See updates from all followed authors in Your Books.
Something went wrong. Please try your request again later.

Prime Numbers and Computer Methods for Factorization (Progress in Probability)

4.4 out of 5 stars (7)

{"desktop_buybox_group_1":[{"displayPrice":"$37.24","priceAmount":37.24,"currencySymbol":"$","integerValue":"37","decimalSeparator":".","fractionalValue":"24","symbolPosition":"left","hasSpace":false,"showFractionalPartIfEmpty":true,"offerListingId":"gwxNI%2B0QNiusTXh1WpPjUXQ%2BjQTq%2BQR1Up3VROVnWTzu4wMs0Qw99A0MWtcY9q8vrc%2FANGl5VuS4BJ1EY39e%2FHbzxjQXaXkjPuIJUOH9IPVUVxNMCOhW%2F0h0BtDt6syZR05tBx2IKzmAdnqPa2lgWpkrFiZrHpBimcCIv9t8qZS4QecnZV3uKh%2Fn5BcG6rKT","locale":"en-US","buyingOptionType":"NEW","aapiBuyingOptionIndex":0}, {"displayPrice":"$33.78","priceAmount":33.78,"currencySymbol":"$","integerValue":"33","decimalSeparator":".","fractionalValue":"78","symbolPosition":"left","hasSpace":false,"showFractionalPartIfEmpty":true,"offerListingId":"gwxNI%2B0QNiusTXh1WpPjUXQ%2BjQTq%2BQR1QmK%2BlrzynSHUXErffxdwGq%2Fg14cZpkUNTxqrf%2B8XPOaLCCg3cXPzY1uGrSnFZg36F4qr%2FEr3LH7WvqT28OYiQNMXuPV0CIvfqKfiJpJP7lFFGgs0EKheh6RrNEf2SMzcZEXWTzLDpkOErTS2Bh8ogI4tZ%2FoGml%2Bp","locale":"en-US","buyingOptionType":"USED","aapiBuyingOptionIndex":1}]}

Purchase options and add-ons

In the modern age of almost universal computer usage, practically every individual in a technologically developed society has routine access to the most up-to-date cryptographic technology that exists, the so-called RSA public-key cryptosystem. A major component of this system is the factorization of large numbers into their primes. Thus an ancient number-theory concept now plays a crucial role in communication among millions of people who may have little or no knowledge of even elementary mathematics. The independent structure of each chapter of the book makes it highly readable for a wide variety of mathematicians, students of applied number theory, and others interested in both study and research in number theory and cryptography.

Editorial Reviews

Review

"Here is an outstanding technical monograph on recursive number theory and its numerous automated techniques. It successfully passes a critical milestone not allowed to many books, viz., a second edition. Many good things have happened to computational number theory during the ten years since the first edition appeared and the author includes their highlights in great depth. Several major sections have been rewritten and totally new sections have been added. The new material includes advances on applications of the elliptic curve method, uses of the number field sieve, and two new appendices on the basics of higher algebraic number fields and elliptic curves. Further, the table of prime factors of Fermat numbers has been significantly up-dated. ...Several other tables have been added so as to provide data to look for large prime factors of certain 'generalized' Fermat numbers, while several other tables on special numbers were simply deleted in the second edition. Still one can make several perplexing assertions or challenges: (1) prove that F\sb 5, F\sb 6, F\sb 7, F\sb 8 are the only four consecutive Fermat numbers which are bi-composite; (2) Show that F\sb{14} is bi- composite. (This accounts for the difficulty in finding a prime factor for it.) (3) What is the smallest Fermat quadri-composite?; and (4) Does there exist a Fermat number with an arbitrarily prescribed number of prime factors? All in all, this handy volume continues to be an attractive combination of number-theoretic precision, practicality, and theory with a rich blend of computer science." –Zentralblatt Math

From the Back Cover

In the modern age of almost universal computer usage, practically every individual in a technologically developed society has routine access to the most up-to-date cryptographic technology that exists, the so-called RSA public-key cryptosystem. A major component of this system is the factorization of large numbers into their primes. Thus an ancient number-theory concept now plays a crucial role in communication among millions of people who may have little or no knowledge of even elementary mathematics. Hans Riesel’s highly successful first edition of this book has now been enlarged and updated with the goal of satisfying the needs of researchers, students, practitioners of cryptography, and non-scientific readers with a mathematical inclination. It includes important advances in computational prime number theory and in factorization as well as re-computed and enlarged tables, accompanied by new tables reflecting current research by both the author and his coworkers and by independent researchers. The book treats four fundamental problems: the number of primes below a given limit, the approximate number of primes, the recognition of primes and the factorization of large numbers. The author provides explicit algorithms and computer programs, and has attempted to discuss as many of the classically important results as possible, as well as the most recent discoveries. The programs include are written in PASCAL to allow readers to translate the programs into the language of their own computers. The independent structure of each chapter of the book makes it highly readable for a wide variety of mathematicians, students of applied number theory, and others interested in both study and research in number theory and cryptography.

Product details

  • Publisher ‏ : ‎ Birkhauser Boston
  • Publication date ‏ : ‎ October 1, 1994
  • Edition ‏ : ‎ 2nd
  • Language ‏ : ‎ English
  • Print length ‏ : ‎ 480 pages
  • ISBN-10 ‏ : ‎ 0817637435
  • ISBN-13 ‏ : ‎ 978-0817637439
  • Item Weight ‏ : ‎ 1.84 pounds
  • Dimensions ‏ : ‎ 6.46 x 1.12 x 9.58 inches
  • Best Sellers Rank: #997,843 in Books (See Top 100 in Books)
  • Customer Reviews:
    4.4 out of 5 stars (7)

About the author

Follow authors for new release and deal updates, plus improved recommendations. See updates from all followed authors in Your Books.
Hans Riesel
Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.

Discover more of the author’s books, see similar authors, read book recommendations and more.

Sponsored

Customer reviews

4.4 out of 5 stars
7 global ratings
Sponsored

Top reviews from the United States

  • 4 out of 5 stars
    A great book, but a bit out of date.
    Reviewed in the United States on January 26, 2024
    Brief content visible, double tap to read full content.
    Full content visible, double tap to read brief content.

    I learned a lot of neat stuff about identifying prime numbers, and even used some of it. However, I didn't realize that the book was almost 30 years old.

    Sending feedback...
    Thank you for your feedback.
    Sending feedback...
    Thanks, we'll investigate in the next few days.

    We'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.

  • 5 out of 5 stars
    Best buy for number-theory, especially computational number-theory
    Reviewed in the United States on August 9, 2014
    Brief content visible, double tap to read full content.
    Full content visible, double tap to read brief content.

    I absolutely love this book. I combines every feature of computing large numbers and primes into just one volume.

    It is very readable. I'm not a math major, but I can still understand 75% of the material covered. The 25% seems to be mostly in supporting theory or proofs, and I'm more of a programmer-type.

    This book is my all-time favorite book on number-theory so far. I have many books, but this one is the most readable and informative to me.

    4 people found this helpful
    Sending feedback...
    Thank you for your feedback.
    Sending feedback...
    Thanks, we'll investigate in the next few days.

    We'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.

  • 4 out of 5 stars
    Excellent Book
    Reviewed in the United States on August 24, 2018
    Brief content visible, double tap to read full content.
    Full content visible, double tap to read brief content.

    ...but who does still write programs in Pascal?

    Sending feedback...
    Thank you for your feedback.
    Sending feedback...
    Thanks, we'll investigate in the next few days.

    We'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.

  • 5 out of 5 stars
    Excellent book
    Reviewed in the United States on March 24, 2000
    Brief content visible, double tap to read full content.
    Full content visible, double tap to read brief content.

    Excellent book published on primes, primality proving and numbers factoring. The book are written for mathematicians not computer security professionals, have sections on public keys and Pascal code for various factorization methods. There are seven chapters and there are nine appendices. The book begins with a good introduction the concept of a prime number and the prime number theorem. The chapters deal with fundamental problems: The Number of Primes Below a Given Limit, Subtleties in the Distribution of Primes, The Recognition of Primes and Methods of Factorization.The factoring methods is broken into two chapters, one on classical method and one on modern methods. The seventh chapter is a short presentation on RSA cryptosystem. The second half of the book is split between the appendices and the tables. The tables are composed of primes, factors in many formats, quadratic residues and formulas for cyclotomic polynomials. There is also an appendix devoted to elliptic curves.

    I will be pleased if in a next edition a diskette with the programs of examples is included.

    16 people found this helpful
    Sending feedback...
    Thank you for your feedback.
    Sending feedback...
    Thanks, we'll investigate in the next few days.

    We'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.

  • 5 out of 5 stars
    Yes, Excellent Book
    Reviewed in the United States on December 16, 2001
    Brief content visible, double tap to read full content.
    Full content visible, double tap to read brief content.

    I think this is an excellent book as well. I bought it soon after it came out and read it. I was impressed. It has been impressive enough to stay on my bookshelf since the. Just today, I had to look up some information on factoring and remembered what a great book it is -- so I am leaving a review here. The only thing is that the code is in Pascal, which is not bad, but not like C++ or Java. Still, the book is detailed and informative.

    4 people found this helpful
    Sending feedback...
    Thank you for your feedback.
    Sending feedback...
    Thanks, we'll investigate in the next few days.

    We'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.