Exponential Factoring Algorithms

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

Chapter Chapter 5 in Prime Numbers, 2001, pp 191-225 from Springer

Abstract: Abstract For almost all of the multicentury history of factoring, the only algorithms available were exponential, namely, the running time was, in the worst case, a fixed positive power of the number being factored. But in the early 1970s, subexponential factoring algorithms began to come “on line.” These methods, discussed in the next chapter, have their running time to factor n bounded by an expression of the form n°(1) One might wonder, then, why the current chapter exists in this book. We have several reasons for including it.

Keywords: Quadratic Form; Discrete Logarithm; Residue Class; Modular Multiplication; Binary Quadratic Form (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_5

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

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

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 ().