lima.mathematical.factorisation
Class FactorisationAlgorithm

java.lang.Object
  |
  +--lima.mathematical.factorisation.FactorisationAlgorithm

Direct Known Subclasses:

DistributedEcm, Lima, MontgomeryEcm, PMinusOne, PollardRho, QuadraticSieve, TrialDivider

public abstract class FactorisationAlgorithm

extends java.lang.Object

An class to be extended by an algorithm that factorises big integers.

Constructor Summary

FactorisationAlgorithm()

Method Summary

lima.mathematical.factorisation.Factorisation	factorise(java.math.BigInteger n) Attempt to factorise the specified big integer.
abstract void	factorise(lima.mathematical.factorisation.Factorisation f) Attempt to factorise the composite part of the specified factorisation object.

Methods inherited from class java.lang.Object

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

Constructor Detail

FactorisationAlgorithm

public FactorisationAlgorithm()

Method Detail

factorise

public final lima.mathematical.factorisation.Factorisation factorise(java.math.BigInteger n)

Attempt to factorise the specified big integer. Please note that this method is final, and not overridable in classes that extend FactorisationAlgorithm.

Parameters:

n - - The big integer to factorise.

Returns:

Factorisation

factorise

public abstract void factorise(lima.mathematical.factorisation.Factorisation f)

Attempt to factorise the composite part of the specified factorisation object. This method will examine a specified factorisation object and attempt to find prime factors of the composite factor contained therein. Whenever a new prime factor is found it will be supplied to the factorisation object by calling its "expand" method with the prime factor as an argument. Thus prime factors found by this method are automatically recorded in the supplied factorisation object and nothing is explicitly returned by this method call.

Parameters:

f - - The factorisation object to examine.