25286 I. Angel/H. Godwin: Some factorizations of 10^n+-1.
Math. Comp. 28/125 (1974), 307-308.

Richard Arratia/A. Barbour/Simon Tavare': Random combinatorial structures
and prime factorization. Notices AMS September 1997, ...

11570 A. Atkin/F. Morain: Finding suitable curves for the elliptic curve
method of factorization. Math. Comp. 201 (1993), 399-405.

Daniel Berend: On the parity of exponents in the factorization of n!
J. Number Theory 64 (1997), 13-19.

11557 Anders Bjo''rn/Hans Riesel: Factors of generalized Fermat numbers.
Math. Comp. 67 (1998), 441-446.

25318 Nathan Bliss/Ben Fulan/Stephen Lovett/Jeff Sommars: Strong divisibility,
cyclotomic polynomials, and iterated polynomials.
Am. Math. Monthly June-July 2013, 519-537.

8335 Henk Boender/Herman te Riele: Factoring integers with large prime
variations of the quadratic sieve. CWI Report NM-R9513 (1995), 27p.

R. Brent: An improved Monte Carlo factorization algorithm.
BIT 20 (1980), 176-184.

R. Brent/J. Pollard: Factorization of the eighth Fermat number.
Math. Comp. 36 (1981), 627-630.

3572 David Bressoud: Factorization and primality tests. Springer 1989.

J. Brilllhart/John Selfridge: Some factorizations of 2^n+-1 and related
results. Math. Comp. 21 (1967), 87-96, 751.

J. Brillhart/D. Lehmer/J. Selfridge: New primality criteria and
factorizations of 2^m+-1. Math. Comp. 29 (1975), 620-647.

J. Brillhart a.o.: Factorizations of b^n+-1, b=2,3,5,6,7,10,11,,12,
up to high powers. AMS Contemporary Math. 22 (1983).

11444 Keith Brown: Perrin's sequence. Internet 1996, 3p.

9570 Johannes Buchmann: Faktorisierung gros''er Zahlen. Spektrum 1996/9, 80-88.

C. Dartyge: Proprietes multiplicatives des valeurs de certains polynomes
en deux variables. Acta Arithm. 78 (1996), 37-74.

357 J. Dixon: Factorization and primality tests.
Am. Math. Monthly 91 (1984), 333-352.

Harvey Dubner/W. Keller: Factors of generalized Fermat numbers.
Math. Comp. 64 (1995), 397-405.

26793 M. Gilowski/.../Wolfgang Schleich: Gauss sum factorization with cold atoms.
Arxiv 0709.1424 (2007), 4p.

A. Guthmann: Primzahltests und Pseudoprimzahlen.
Bayreuther Math. Schr. 21 (1986), 101-116.

25293 William Hart: A one line factoring algorithm. J. Austr. Math. Soc. 92 (2012), 61-69.

8333 Marije Huizing: An implementation of the number field sieve.
CWI Report NM-R9511 (1995), 26p.

Wilfried Keller: Factors of Fermat numbers and large primes of the
form k*2^n+1. Math. Comp. 41 (1983), 661-673.

Norbert Klingen: Arithmetical similarities - prime decomposition and
finite group theory. Oxford UP 1998. 0-19-853598-8. $105.

M. Kraitchik: On the factorization of 2^n±1.
Scripta Math. 17 (1952), 39-52.

R. Sherman Lehman: Factoring large integers.
Math. Comp. 28 (1974), 637-646.

Arjen Lenstra/Hendrik Lenstra (ed.): The development of the number field sieve.
SLN Math. 1554 (1993).

Arjen Lenstra/M. Manasse: Factoring by electronic mail.
SLN Computer Science 434 (1990), 355-371.

Hendrik Lenstra: Factoring integers with elliptic curves.
Annals Math. 126 (1987), 649-673.

Hendrik Lenstra/C. Pomerance: A rigorous time bound for factoring
integers. J. AMS 5 (1992), 483-516.

25322 Richard Mollin: A brief history of factoring and primality testing B. C.
(before computers). Math. Magazine 75/1 (2002), 18-29.

11569 Michael Morrison/John Brillhart: A method of factoring and the
factorization of F_7. Math. Comp. 29 (1975), 183-205.

11351 Andrew Odlyzko: The future of integer factorization.
Internet 1995, 8p.

J. Pollard: Theorems on factorization and primality testing.
Proc. Camb. Phil. Soc. 76 (1974), 521-528.

J. Pollard: A Monte Carlo method for factorization.
BIT 15 (1975), 331-334.

C. Pomerance: Fast, rigorous factorization and discrete logarithm
algorithms.
In Discrete Algorithms and Complexity, Academic Press 1986, 119-143.

8751 Carl Pomerance: A tale of two sieves.
Notices AMS December 1996, ...

Hans Riesel: Some factors of the numbers G_n=6^{2^n}+1 and
H_n=10^{2^n}+1. Math. Comp. 23 (1969), 413-415.

Raphael Robinson: A report on primes of the form k*2^n+1 and on
factors of Fermat numbers. Proc. AMS 9 (1958), 673-681.

J. Selfridge/M. Wunderlich: An efficient algorithm for testing large
numbers for primality.
Proc. 4th Manitoba Conf. Num. Math. (1974), 109-120.

Adi Shamir: Factoring numbers in O(log n) steps.
Inf. Proc. Letters 8 (1979), 28-31.

11618 Daniel Shanks: Class number, a theory of factorization, and genera.
AMS Proc. Symp. Pure Math. 20 (1969), 415-440.

26792 Gernot Stania/Gerhard Paulus: Zahlentheorie mit dem Interferenzcomputer.
Physik-Journal 7/5 (2008), 16-17.

25290 Samuel Wagstaff: The joy of factoring. AMS 2013, 290p. Eur 34.

11470 Eric Weisstein: Continued fraction factorization algorithm.
Internet 1998, 1p.

11471 Eric Weisstein: Prime factorization algorithms.
Internet 1998, 2p.

H. Williams/J. Judd: Some algorithms for prime testing using generalized
Lehmer functions. Math. Comp. 30 (1976), 157-172, 867-886.

5022 Juergen Wolfart: Primzahltests und Primfaktorzerlegung.
2687 Chatterji/, 161-188.

1947 Heather Woll: Reductions among number theoretic problems.
Inf. and Comp. 72 (1987), 167-179.