Number-Theoretical Tools

Richard Crandall () and Carl Pomerance ()
Additional contact information
Richard Crandall: Center for Advanced Computation
Carl Pomerance: Dartmouth University, Department of Mathematics

Chapter Chapter 2 in Prime Numbers, 2001, pp 77-108 from Springer

Abstract: Abstract 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.

Keywords: Finite Field; Primitive Root; Chinese Remainder Theorem; Quadratic Residue; Euclid Algorithm (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4684-9316-0_2

Ordering information: This item can be ordered from
http://www.springer.com/9781468493160

DOI: 10.1007/978-1-4684-9316-0_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().