Class 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
    • Constructor Detail

      • SquFoF63

        public SquFoF63()
    • Method Detail

      • getName

        public String getName()
        Specified by:
        getName in class FactorAlgorithm
        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 class FactorAlgorithm
        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