Package de.tilman_neumann.jml.factor.base.congruence

Class CongruenceCollector02

java.lang.Object

de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector02

All Implemented Interfaces:

CongruenceCollector

public class CongruenceCollector02
extends java.lang.Object
implements CongruenceCollector

Collects smooth and partial congruences, using cycle counting and finding algorithms instead of a partial solver. Works only for <= 2 large primes.

Field Summary

Fields

Modifier and Type	Field	Description
java.math.BigInteger	factor

Constructor Summary

Constructors

Constructor	Description
CongruenceCollector02()	Default constructor that expects 10 more equations than variables to run the matrix solver.
CongruenceCollector02(int extraCongruences)	Full constructor.

Method Summary

Modifier and Type	Method	Description
void	cleanUp()	Release memory after a factorization.
void	collectAndProcessAQPair(AQPair aqPair)	Collect a single AQ pair and run the matrix solver if appropriate.
void	collectAndProcessAQPairs(java.util.List<AQPair> aqPairs)	Collect AQ pairs and run the matrix solver if appropriate.
long	getCollectDuration()
java.math.BigInteger	getFactor()
int	getPartialCongruenceCount()
CongruenceCollectorReport	getReport()
int	getSmoothCongruenceCount()
java.util.Collection<Smooth>	getSmoothCongruences()
long	getSolverDuration()
int	getSolverRunCount()
int	getTestedNullVectorCount()
void	initialize(java.math.BigInteger N, int primeBaseSize, MatrixSolver matrixSolver, FactorTest factorTest)	Initialize congruence collector for a new N.
void	setPrimeBaseSize(int newPrimeBaseSize)	Re-initialize the prime base size.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

factor

public java.math.BigInteger factor

Constructor Details

CongruenceCollector02

public CongruenceCollector02()

Default constructor that expects 10 more equations than variables to run the matrix solver.

CongruenceCollector02

public CongruenceCollector02(int extraCongruences)

Full constructor.

Parameters:

extraCongruences - The difference #equations-#variables required before the solver is started.

Method Details

initialize

public void initialize(java.math.BigInteger N,
int primeBaseSize,
MatrixSolver matrixSolver,
FactorTest factorTest)

Description copied from interface: CongruenceCollector

Initialize congruence collector for a new N.

Specified by:

initialize in interface CongruenceCollector

setPrimeBaseSize

public void setPrimeBaseSize(int newPrimeBaseSize)

Description copied from interface: CongruenceCollector

Re-initialize the prime base size. This is useful only for algorithms that combine relations from different prime bases.

Specified by:

setPrimeBaseSize in interface CongruenceCollector

collectAndProcessAQPairs

public void collectAndProcessAQPairs(java.util.List<AQPair> aqPairs)

Description copied from interface: CongruenceCollector

Collect AQ pairs and run the matrix solver if appropriate. In a multi-threaded factoring algorithm, this method needs to be run in a block synchronized on this. This also speeds up single-threaded solvers like Block-Lanczos, because on modern CPUs single threads run at a higher clock rate.

Specified by:

collectAndProcessAQPairs in interface CongruenceCollector

collectAndProcessAQPair

public void collectAndProcessAQPair(AQPair aqPair)

Description copied from interface: CongruenceCollector

Collect a single AQ pair and run the matrix solver if appropriate. In a multi-threaded factoring algorithm, this method needs to be run in a block synchronized on this. This also speeds up single-threaded solvers like Block-Lanczos, because on modern CPUs single threads run at a higher clock rate.

Specified by:

collectAndProcessAQPair in interface CongruenceCollector

getSmoothCongruenceCount

public int getSmoothCongruenceCount()

Specified by:

getSmoothCongruenceCount in interface CongruenceCollector

Returns:

number of smooth congruences found so far.

getSmoothCongruences

public java.util.Collection<Smooth> getSmoothCongruences()

Specified by:

getSmoothCongruences in interface CongruenceCollector

Returns:

smooth congruences found so far.

getPartialCongruenceCount

public int getPartialCongruenceCount()

Specified by:

getPartialCongruenceCount in interface CongruenceCollector

Returns:

number of partial congruences found so far.

getFactor

public java.math.BigInteger getFactor()

Specified by:

getFactor in interface CongruenceCollector

Returns:

the factor that was found or null

getReport

public CongruenceCollectorReport getReport()

Specified by:

getReport in interface CongruenceCollector

getCollectDuration

public long getCollectDuration()

Specified by:

getCollectDuration in interface CongruenceCollector

getSolverDuration

public long getSolverDuration()

Specified by:

getSolverDuration in interface CongruenceCollector

getSolverRunCount

public int getSolverRunCount()

Specified by:

getSolverRunCount in interface CongruenceCollector

Returns:

the number of solvers runs required to find a factor (should be 1)

getTestedNullVectorCount

public int getTestedNullVectorCount()

Specified by:

getTestedNullVectorCount in interface CongruenceCollector

Returns:

the number of null vector tests required to find a factor

cleanUp

public void cleanUp()

Description copied from interface: CongruenceCollector

Release memory after a factorization.

Specified by:

cleanUp in interface CongruenceCollector