The Mathematica Journal
Departments
Current Issue
Tricks of the Trade
In and Out
Riemann Surfaces IIc
The Mathematica Programmer
New Products
New Publications
Classifieds
Calendar
News Bulletins
Library
Editor's Pick
Mailbox
FAQ
Write Us
About the Journal
Staff and Contributors
Submissions
Subscriptions
Advertising
Back Issues
Home
Download This Issue

Prime Numbers: A Computational Perspective

Richard Crandall and Carl Pomerance, 2001, Springer-Verlag, 545 pp., hardcover.

A 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. The text focuses on the computational aspects of finding, testing, and characterizing prime numbers. The theoretically interesting, aesthetic, and practical aspects of primes are discussed. The reference provides theoretical explanations that explain the practical power of the computational algorithms. Detailed pseudocode and exercises that are designed to keep the student engaged and interested are also included.

Chapters include:
Primes! | Number-Theoretical Tools | Recognizing Primes and Composites | Primality Proving | Exponential Factoring Algorithms | Subexponential Factoring Algorithms | Elliptic Curve Arithmetic | The Ubiquity of Prime Numbers | Fast Algorithms for Large-Integer Arithmetic | Appendix: Book Pseudocode | References | Index

This book is available in the Wolfram Research bookstore.


[New Publications Index] [Previous Page] [Next Page]


Copyright © 2002 Wolfram Media, Inc. All rights reserved.