Package de.tilman_neumann.jml.factor.cfrac.tdiv

Class TDiv_CF01

java.lang.Object
de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF01
All Implemented Interfaces:
TDiv_CF
public class TDiv_CF01
extends java.lang.Object
implements TDiv_CF
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

  • Constructor Summary

    Constructors
    Constructor Description
    TDiv_CF01()  

  • Method Summary

    Modifier and Type Method Description
    java.lang.String getName()  
    void initialize​(java.math.BigInteger N, double smoothBound)
    Initialize for a new N.
    void initialize​(java.math.BigInteger kN, int primeBaseSize, int[] primesArray)
    Initialize this factorizer for a new k; in particular set the prime base to be used for trial division.
    AQPair test​(java.math.BigInteger A, java.math.BigInteger Q)
    Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).

    Methods inherited from class java.lang.Object

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

  • Constructor Details

    • TDiv_CF01

      public TDiv_CF01()

  • Method Details

    • getName

      public java.lang.String getName()
      Specified by:
      getName in interface TDiv_CF
      Returns:
      the name of this algorithm

    • initialize

      public void initialize​(java.math.BigInteger N, double smoothBound)
      Description copied from interface: TDiv_CF
      Initialize for a new N.
      Specified by:
      initialize in interface TDiv_CF

    • initialize

      public void initialize​(java.math.BigInteger kN, int primeBaseSize, int[] primesArray)
      Description copied from interface: TDiv_CF
      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_CF
      primeBaseSize - the true prime base size (the arrays are preallocated with a bigger length)
      primesArray - prime base in ints

    • test

      public AQPair test​(java.math.BigInteger A, java.math.BigInteger Q)
      Description copied from interface: TDiv_CF
      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_CF
      Returns:
      an AQ-pair if Q is at least "sufficiently smooth", null else