Interface TDiv_CF63
- All Known Implementing Classes:
TDiv_CF63_01
,TDiv_CF63_02
public interface TDiv_CF63
Interface for auxiliary factor algorithms to find smooth decompositions of Q's.
-
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, long Q)
Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).
-
Method Details
-
getName
java.lang.String getName()- Returns:
- the name of this algorithm
-
initialize
void initialize(java.math.BigInteger N, double smoothBound)Initialize for a new N.- Parameters:
N
-smoothBound
-
-
initialize
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.- Parameters:
kN
-primeBaseSize
- the true prime base size (the arrays are preallocated with a bigger length)primesArray
- prime base in ints
-
test
Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).- Parameters:
A
-Q
-- Returns:
- an AQ-pair if Q is at least "sufficiently smooth", null else
-