Class SquFoF63
- java.lang.Object
-
- de.tilman_neumann.jml.factor.FactorAlgorithm
-
- de.tilman_neumann.jml.factor.squfof.SquFoF63
-
public class SquFoF63 extends FactorAlgorithm
Shanks' SQUFOF algorithm, 63-bit version.
Implemented according to http://en.wikipedia.org/wiki/Shanks'_square_forms_factorization. Final choice with self-initialization of parameters. Stopping criterion: after a maximum number of iterations.- Author:
- Tilman Neumann
-
-
Field Summary
-
Fields inherited from class de.tilman_neumann.jml.factor.FactorAlgorithm
DEFAULT, NUM_PRIMES_FOR_31_BIT_TDIV, tdivLimit
-
-
Constructor Summary
Constructors Constructor Description SquFoF63()
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description long
findSingleFactor(long N)
BigInteger
findSingleFactor(BigInteger N)
Find a factor of the given composite N. Warning: This method will not return when called with a prime argument.String
getName()
static void
main(String[] args)
Test.protected BigInteger
test(long Q_ip1)
-
Methods inherited from class de.tilman_neumann.jml.factor.FactorAlgorithm
factor, factor, searchFactors
-
-
-
-
Method Detail
-
getName
public String getName()
- Specified by:
getName
in classFactorAlgorithm
- Returns:
- The name of the algorithm, possibly including important parameters.
-
findSingleFactor
public long findSingleFactor(long N)
-
findSingleFactor
public BigInteger findSingleFactor(BigInteger N)
Find a factor of the given composite N. Warning: This method will not return when called with a prime argument.- Specified by:
findSingleFactor
in classFactorAlgorithm
- Parameters:
N
- composite integer- Returns:
- factor of N
-
test
protected BigInteger test(long Q_ip1)
-
main
public static void main(String[] args)
Test.- Parameters:
args
- ignored
-
-