Cryptography Reference
In-Depth Information
k = sieve_l (n_l, no_of_smallprimes);
if (1 == k)
{
return 1;
}
if (1 < k)
{
return 0;
}
else
{
if (0 == iterations)
If
iterations == 0
is passed as parameter, then based on the number of digits of
n_l
, the optimized number of iterations for coming in under the bound of
2
−
80
is
determined.
{
k = ld_l (n_l);
if (k < 73) iterations = 37;
else if (k < 105) iterations = 32;
else if (k < 137) iterations = 25;
else if (k < 197) iterations = 19;
else if (k < 220) iterations = 15;
else if (k < 235) iterations = 13;
else if (k < 253) iterations = 12;
else if (k < 275) iterations = 11;
else if (k < 300) iterations = 10;
else if (k < 332) iterations = 9;
else if (k < 375) iterations = 8;
else if (k < 433) iterations = 7;
else if (k < 514) iterations = 6;
else if (k < 638) iterations = 5;
else if (k < 847) iterations = 4;
else if (k < 1275) iterations = 3;
else if (k < 2861) iterations = 2;
else iterations = 1;
}
