Class TDiv_CF63_01

  • All Implemented Interfaces:
    TDiv_CF63

    public class TDiv_CF63_01
    extends Object
    implements TDiv_CF63
    Auxiliary factor algorithm to find smooth decompositions of Q's. Version 01: Uses only trial division -> this means that partials can have only 1 big factor
    Author:
    Tilman Neumann
    • Constructor Detail

      • TDiv_CF63_01

        public TDiv_CF63_01()
    • Method Detail

      • getName

        public String getName()
        Specified by:
        getName in interface TDiv_CF63
        Returns:
        the name of this algorithm
      • initialize

        public void initialize​(BigInteger N,
                               double maxQRest)
        Description copied from interface: TDiv_CF63
        Initialize for a new N.
        Specified by:
        initialize in interface TDiv_CF63
      • initialize

        public void initialize​(BigInteger kN,
                               int primeBaseSize,
                               int[] primesArray)
        Description copied from interface: TDiv_CF63
        Initialize this factorizer for a new k; in particular set the prime base to be used for trial division.
        Specified by:
        initialize in interface TDiv_CF63
        primeBaseSize - the true prime base size (the arrays are preallocated with a bigger length)
        primesArray - prime base in ints
      • test

        public AQPair test​(BigInteger A,
                           long Q)
        Description copied from interface: TDiv_CF63
        Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).
        Specified by:
        test in interface TDiv_CF63
        Returns:
        an AQ-pair if Q is at least "sufficiently smooth", null else