Prime Numbers

A Computational Perspective

Richard Crandall, Carl Pomerance

545 pages, parution le 01/04/2001

Ajouter à une liste

Indisponible

Résumé

Prime numbers belong to an exclusive world of intellectual conceptions. They are one of those marvelous notions that enjoy simple, elegant descriptions, yet lead to extreme complexity in the details. The basic notion of primality can be accessible to a child, yet no human mind harbors anything like a complete picture. In this book the authors concentrate on the computational aspect of finding and characterizing primes, but will often digress into the theoretical domain in order to illuminate, justify, and underscore the practical import of the computational algorithms. The book will be an indispensable reference for professionals interested in prime numbers and encryption, cryptography, factoring algorithms, elliptic curve arithmetic, and many more computational issues related to primes and factoring. Readers can test their understanding at the end of each chapter with a variety of exercises ranging from very easy to extremely difficult.

Contents

Primes!
Number-Theoretical Tools
Recognizing Primes and Composites
Primality Proving
Exponential Factoring Algorithms
Sub-Exponential Factoring Algorithms
Elliptic Curve Arithmetic
The Ubiquity of Prime Numbers
Fast Algorithms for Large-Integer Arithmetic

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Richard Crandall, Carl Pomerance
Parution	01/04/2001
Nb. de pages	545
Format	16 x 24
Couverture	Relié
Poids	915g
Intérieur	Noir et Blanc
EAN13	9780387947778
ISBN13	978-0-387-94777-8