| 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 |
Collects smooth and partial congruences, and assembles partials to smooth congruences on-the-fly.
|
| CongruenceCollectorParallel |
Collects smooth and partial congruences, and assembles partials to smooth congruences on-the-fly.
|
| CongruenceCollectorReport |
|
| CycleFinder |
Algorithms to count and find independent cycles in partial relations containing partials with 2
or 3 large primes.
|
| 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.
|
| PartialSolver |
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.
|