Overview
- Affordable reprint of the successful, expanded second edition of a unique monograph
- Provides a unique perspective on the study of prime numbers and their importance in modern technology
- Applications remain relevant across the fields of modern computer science and information transmission
- Includes supplementary material: sn.pub/extras
Part of the book series: Modern Birkhäuser Classics (MBC)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (7 chapters)
Keywords
About this book
From the original hard cover edition:
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.
Reviews
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... 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
The book...is an enthusiastic introduction to some of the ideas concerned with primes and factorization. It should be of interest to anyone who would like to learn about the use of computers in number theory. —Mathematical Reviews
Authors and Affiliations
Bibliographic Information
Book Title: Prime Numbers and Computer Methods for Factorization
Authors: Hans Riesel
Series Title: Modern Birkhäuser Classics
DOI: https://doi.org/10.1007/978-0-8176-8298-9
Publisher: Birkhäuser Boston, MA
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Science+Business Media, LLC 2012
Softcover ISBN: 978-0-8176-8297-2Published: 22 November 2011
eBook ISBN: 978-0-8176-8298-9Published: 23 November 2011
Series ISSN: 2197-1803
Series E-ISSN: 2197-1811
Edition Number: 2
Number of Pages: XVIII, 464
Number of Illustrations: 20 b/w illustrations
Topics: Number Theory, Cryptology, Algorithms, Applications of Mathematics, Mathematics, general