#include "StaticFactorbase.H"
#include "Sieving.H"
#include <cmath>
#include "mpqsMultiplier.cc"
Go to the source code of this file.
Functions | |
| int StaticFactorbaseSettings::PrimeNumbers[StaticFactorbaseSettings::MaxSize] | __attribute__ ((aligned(64))) |
| int | check_SQRT_kN_mod_PrimeNumber (const int Primzahl) |
Variables | |
| int | LogicalSieveSize = 1000000 |
| int | MPQS_Multiplier |
Definition in file StaticFactorbase.cc.
| int StaticFactorbaseSettings::PrimeNumbers [StaticFactorbaseSettings::MaxSize] __attribute__ | ( | (aligned(64)) | ) |
| int check_SQRT_kN_mod_PrimeNumber | ( | const int | Primzahl | ) |
Definition at line 59 of file StaticFactorbase.cc.
References cerr, endl(), exit(), kN, MARK, mpz_clear(), mpz_init_set_ui(), mpz_mod_ui(), mpz_mul(), mpz_sub(), and SQRT_kN_mod_PrimeNumber().
| int LogicalSieveSize = 1000000 |
Constraint for AMD-3DNow! specific code: abs(LogicalSieveSize)<=2^23 (because of float precision)
In contrast to "PhysicalSieveSize", LogicalSieveSize is a value that is less dependent on the hardware. You should choose the (logical) SieveSize according to size of the number to factorize. The default value should be modified before a factorization is started.
The relative rate of hits in the multiple polynomial quadratic sieve algorithm (MPQS) is higher for smaller intervals, but however, the cost of changing polynomials, initialization, and calculation of roots is higher, when polynomials are switched more often.
Definition at line 46 of file StaticFactorbase.cc.
Referenced by DynamicFactorArrays::compute_Deltas_for_DynamicFactors(), do_sieving_DynamicFactors(), main(), Cprocess_clients::process_data_stream(), and tune_parameters().
| int MPQS_Multiplier |
1.5.4