|
Number Theory Utils 0.2.0
|
Configuration/tuning for heuristic factorization. More...
#include <factorization.h>
Data Fields | |
| uint64_t | pollard_max |
| Use Pollard-Rho-Brent when factoring numbers at most this large. | |
| uint64_t | pollard_stride |
| How many iterations of Pollard-Rho-Brent to do in between gcd tests. | |
| uint64_t | lenstra_max |
| Use lenstra ecf when factoring numbers at most this large. | |
| uint64_t | lenstra_bfac |
| Factorial smoothness bound for Lenstra ecf. | |
| uint64_t | qsieve_max |
| Currently unused. | |
Configuration/tuning for heuristic factorization.
Definition at line 47 of file factorization.h.
| uint64_t nut_FactorConf::pollard_max |
Use Pollard-Rho-Brent when factoring numbers at most this large.
0 to disable Pollard, UINT64_MAX to always use Pollard (note that Pollard is much slower than Lenstra for numbers larger than 2^20)
Definition at line 51 of file factorization.h.
| uint64_t nut_FactorConf::pollard_stride |
How many iterations of Pollard-Rho-Brent to do in between gcd tests.
100 or lower is reasonable, this has no effect on whether or not factors will be found, it merely speeds up iterations at the cost of potentially doing up to 2m extra iterations.
Definition at line 55 of file factorization.h.
| uint64_t nut_FactorConf::lenstra_max |
Use lenstra ecf when factoring numbers at most this large.
0 to disable lenstra ecf, UINT64_MAX to always use lenstra above pollard_max. Currently this is the fastest method implemented for large numbers so any number larger than this might not be fully factored. Also note that the factoring algorithms provided may fail with overflow for numbers larger than 2^30.
Definition at line 61 of file factorization.h.
| uint64_t nut_FactorConf::lenstra_bfac |
Factorial smoothness bound for Lenstra ecf.
P <- 2P through P <- kP are computed when searching for a nontrival factor, where k is this bound.
Definition at line 64 of file factorization.h.
| uint64_t nut_FactorConf::qsieve_max |
Currently unused.
Will be the last number for which the quadratic sieve is used, after which the number field sieve is used.
Definition at line 67 of file factorization.h.