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.
KeywordsFinite Field Primitive Root Chinese Remainder Theorem Quadratic Residue Euclid Algorithm
Unable to display preview. Download preview PDF.