Number-Theoretical Tools

  • Richard Crandall
  • Carl Pomerance


In this chapter we focus specifically on those fundamental tools and associated computational algorithms that apply to prime number and factorization studies. Enhanced integer algorithms, including various modern refinements of the classical ones of the present chapter, are detailed in Chapter 9. The reader may wish to refer to that chapter from time to time, especially when issues of computational complexity and optimization are paramount.


Finite Field Primitive Root Chinese Remainder Theorem Quadratic Residue Euclid Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag, New York, Inc. 2001

Authors and Affiliations

  • Richard Crandall
    • 1
  • Carl Pomerance
    • 2
  1. 1.Center for Advanced ComputationPortlandUSA
  2. 2.Department of MathematicsDartmouth UniversityHanoverUSA

Personalised recommendations