Prime Numbers and Computer Methods for Factorization
Prime Numbers and Computer Methods for Factorization by Hans Riesel
English | 2012 | ISBN: 081768297X | DJVU | 2nd Edition | 484 pages | 4 Mb
Algorithms
English | 2012 | ISBN: 081768297X | DJVU | 2nd Edition | 484 pages | 4 Mb
Algorithms
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,…
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.