Uses of Class
de.tilman_neumann.jml.factor.FactorAlgorithm

Packages that use FactorAlgorithm

Package	Description
de.tilman_neumann.jml.factor
de.tilman_neumann.jml.factor.cfrac
de.tilman_neumann.jml.factor.ecm
de.tilman_neumann.jml.factor.hart
de.tilman_neumann.jml.factor.lehman
de.tilman_neumann.jml.factor.pollardRho
de.tilman_neumann.jml.factor.psiqs
de.tilman_neumann.jml.factor.siqs
de.tilman_neumann.jml.factor.squfof
de.tilman_neumann.jml.factor.tdiv

Uses of FactorAlgorithm in de.tilman_neumann.jml.factor

Subclasses of FactorAlgorithm in de.tilman_neumann.jml.factor

Modifier and Type	Class	Description
class	CombinedFactorAlgorithm	Final combination of factor algorithms.

Fields in de.tilman_neumann.jml.factor declared as FactorAlgorithm

Modifier and Type	Field	Description
static FactorAlgorithm	FactorAlgorithm.DEFAULT	The best available single-threaded factor algorithm.

Uses of FactorAlgorithm in de.tilman_neumann.jml.factor.cfrac

Subclasses of FactorAlgorithm in de.tilman_neumann.jml.factor.cfrac

Modifier and Type	Class	Description
class	CFrac	CFrac = Shanks' SQUFOF algorithm + carry along continuant recurrence + collect smooth relations + LinAlg solver. The original CFrac was implemented by Morrison&Brillhart intending to factor the 7.th Fermat number F7 with 39 digits (~130 bits).
class	CFrac63	63 bit CFrac with Knuth-Schroeppel multiplier.

Uses of FactorAlgorithm in de.tilman_neumann.jml.factor.ecm

Subclasses of FactorAlgorithm in de.tilman_neumann.jml.factor.ecm

Modifier and Type	Class	Description
class	EllipticCurveMethod	Use Elliptic Curve Method to find the prime number factors of a given BigInteger.
class	TinyEcm63	A port of Ben Buhrow's tinyecm.c (https://www.mersenneforum.org/showpost.php?p=521028&postcount=84) an ECM implementation for unsigned 64 bit integers.
class	TinyEcm64	A port of Ben Buhrow's tinyecm.c (https://www.mersenneforum.org/showpost.php?p=521028&postcount=84) an ECM implementation for unsigned 64 bit integers.
class	TinyEcm64_MontInline	A port of Ben Buhrow's tinyecm.c (https://www.mersenneforum.org/showpost.php?p=521028&postcount=84) an ECM implementation for unsigned 64 bit integers.
class	TinyEcm64_MontSqr	A port of Ben Buhrow's tinyecm.c (https://www.mersenneforum.org/showpost.php?p=521028&postcount=84) an ECM implementation for unsigned 64 bit integers.

Uses of FactorAlgorithm in de.tilman_neumann.jml.factor.hart

Subclasses of FactorAlgorithm in de.tilman_neumann.jml.factor.hart

Modifier and Type	Class	Description
class	Hart_Fast	Pretty simple yet fast variant of Hart's one line factorizer.
class	Hart_Fast2Mult	Pretty simple yet fast variant of Hart's one line factorizer.
class	Hart_Simple	Simple implementation of Hart's one line factor algorithm.
class	Hart_Squarefree	A variant of Hart's one line factorizer using k = 315 * s, where s is squarefree (1,2,3,5,6,7,10,11,13,...).
class	Hart_TDiv_Race	A factoring algorithm racing Hart's one line factorizer against trial division.
class	Hart_TDiv_Race2	A factoring algorithm racing Hart's one line factorizer against trial division.
class	HartLA63	Experimental Hart algorithm assembling square congruences from smooth congruences.

Uses of FactorAlgorithm in de.tilman_neumann.jml.factor.lehman

Subclasses of FactorAlgorithm in de.tilman_neumann.jml.factor.lehman

Modifier and Type	Class	Description
class	Lehman_CustomKOrder	A variant of Lehman's algorithm that allows to arrange the k's in arrays of different "performance levels".
class	Lehman_Fast	Fast implementation of Lehman's factor algorithm.
class	Lehman_Simple	Simple implementation of Lehmans factor algorithm, following https://programmingpraxis.com/2017/08/22/lehmans-factoring-algorithm/, using fast inverse trial division.
class	Lehman_Smith	An attempt to reproduce Warren D.

Uses of FactorAlgorithm in de.tilman_neumann.jml.factor.pollardRho

Subclasses of FactorAlgorithm in de.tilman_neumann.jml.factor.pollardRho

Modifier and Type	Class	Description
class	PollardRho	From: http://www.cs.princeton.edu/introcs/79crypto/PollardRho.java (INTRODUCTION TO COMPUTER SCIENCE by Robert Sedgewick and Kevin Wayne) Pollards Rho method.
class	PollardRho_ProductGcd	Pollard's Rho algorithm improved by doing the GCD on products.
class	PollardRho31	31-bit implementation of Pollard' Rho method.
class	PollardRhoBrent	Brents's improvement of Pollard's Rho algorithm, following [Richard P.
class	PollardRhoBrent31	Brents's improvement of Pollard's Rho algorithm, following [Richard P.
class	PollardRhoBrentMontgomery63	Brents's improvement of Pollard's Rho algorithm using Montgomery multiplication.
class	PollardRhoBrentMontgomery64	Brents's improvement of Pollard's Rho algorithm using Montgomery multiplication.
class	PollardRhoBrentMontgomeryR64Mul63	Brents's improvement of Pollard's Rho algorithm using Montgomery multiplication.

Uses of FactorAlgorithm in de.tilman_neumann.jml.factor.psiqs

Subclasses of FactorAlgorithm in de.tilman_neumann.jml.factor.psiqs

Modifier and Type	Class	Description
class	PSIQS	Multi-threaded SIQS using Sieve03g.
class	PSIQS_SBH_U	Multi-threaded SIQS using the single block hybrid sieve.
class	PSIQS_U	Multi-threaded SIQS using Sieve03gU.
class	PSIQSBase	Multi-threaded SIQS, the fastest factor algorithm in this project.

Uses of FactorAlgorithm in de.tilman_neumann.jml.factor.siqs

Subclasses of FactorAlgorithm in de.tilman_neumann.jml.factor.siqs

Modifier and Type	Class	Description
class	SIQS	Main class for single-threaded SIQS implementations.
class	SIQS_Small	Single-threaded SIQS implementation used to factor the Q(x)-rests in the trial division stage of SIQS/PSIQS.

Uses of FactorAlgorithm in de.tilman_neumann.jml.factor.squfof

Subclasses of FactorAlgorithm in de.tilman_neumann.jml.factor.squfof

Modifier and Type	Class	Description
class	SquFoF31	Shanks' SQUFOF algorithm, 31-bit version.
class	SquFoF31Preload	Shanks' SQUFOF algorithm, 31-bit version.
class	SquFoF63	Shanks' SQUFOF algorithm, 63-bit version. Implemented according to http://en.wikipedia.org/wiki/Shanks'_square_forms_factorization.

Uses of FactorAlgorithm in de.tilman_neumann.jml.factor.tdiv

Subclasses of FactorAlgorithm in de.tilman_neumann.jml.factor.tdiv

Modifier and Type	Class	Description
class	TDiv	Trial division for large arguments.
class	TDiv31	Trial division factor algorithm using the safe AutoExpandingPrimesArray class.
class	TDiv31Barrett	Trial division using long-valued Barrett reduction, see https://en.wikipedia.org/wiki/Barrett_reduction.
class	TDiv31Inverse	Trial division factor algorithm using double-valued Barrett reduction, thus replacing division by multiplications.
class	TDiv63	Trial division factor algorithm using the safe AutoExpandingPrimesArray class.
class	TDiv63Inverse	Trial division factor algorithm replacing division by multiplications.