| AQPair |
An elementary smooth or partially smooth congruence A^2 == Q (mod N).
|
| AQPairFactory |
Creates an elementary congruence of the subclass appropriate for the given large factors.
|
| CongruenceCollector_Small |
A copy of CongruenceCollector01 used for collecting congruences in nested SIQS.
|
| CongruenceCollector01 |
Collects smooth and partial congruences, and assembles partials to smooth congruences on-the-fly relying solely on the partzial solver.
|
| CongruenceCollector02 |
Collects smooth and partial congruences, using cycle counting and finding algorithms instead of a partial solver.
|
| CongruenceCollector03 |
First congruence collector using a cycle counter for 3LP.
|
| CongruenceCollectorReport |
|
| CycleCounter2LP |
Cycle counting algorithm implementation for two large primes, following [LM94].
|
| CycleCounter3LP |
Cycle counting algorithm implementation following [LLDMW02], as far as possible.
|
| CycleFinder |
A cycle finding algorithm implementation following [LLDMW02], finding smooth congruences from partial relations.
|
| Partial |
Base class for partial congruences.
|
| Partial_1Large |
A partial congruence having 1 large factor.
|
| Partial_2Large |
A partial congruence having 2 distinct large factors.
|
| Partial_nLarge |
A partial congruence having an arbitrary number of large factors.
|
| PartialSolver01 |
A Gaussian solver used to find smooth from partial relations.
|
| PartialSolver02 |
A Gaussian solver used to find smooth from partial relations.
|
| Smooth_1LargeSquare |
A smooth congruence with 1 large factor contained as a square.
|
| Smooth_Composite |
A smooth congruence composed from several partials.
|
| Smooth_nLargeSquares |
A smooth congruence having an arbitrary number of large factors.
|
| Smooth_Perfect |
A perfect smooth congruence.
|
| Smooth_Simple |
A smooth congruence from a single AQ-pair.
|