/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/crypto/bn/ |
H A D | bn_prime.h | 64 static const unsigned int primes[NUMPRIMES]= variable
|
H A D | bn_prime.pl | 7 push(@primes,2); 9 loop: while ($#primes < $num-1) 14 for ($i=0; defined($primes[$i]) && $primes[$i]<=$s; $i++) 16 next loop if (($p%$primes[$i]) == 0); 18 push(@primes,$p); 93 for ($i=0; $i <= $#primes; $i++) 95 if ($primes[$i] > 256) 107 print "static const unsigned int primes[NUMPRIMES]=\n\t{\n\t"; 109 for ($i=0; $i <= $#primes; [all...] |
H A D | bn_prime.c | 123 /* The quick sieve algorithm approach to weeding out primes is 266 if (BN_mod_word(a, primes[i]) == 0) 387 mods[i]=BN_mod_word(rnd,(BN_ULONG)primes[i]); 388 maxdelta=BN_MASK2 - primes[NUMPRIMES-1]; 393 * that gcd(rnd-1,primes) == 1 (except for 2) */ 394 if (((mods[i]+delta)%primes[i]) <= 1) 431 if (BN_mod_word(rnd,(BN_ULONG)primes[i]) <= 1) 480 * gcd(p-1,primes) == 1 (except for 2) */ 481 if ( (BN_mod_word(p,(BN_ULONG)primes[i]) == 0) || 482 (BN_mod_word(q,(BN_ULONG)primes[ [all...] |
H A D | bntest.c | 1760 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local 1762 if (!BN_set_word(p, primes[i])) goto err;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/crypto/bn/ |
H A D | bn_prime.h | 66 static const prime_t primes[NUMPRIMES] = { variable
|
H A D | bn_prime.pl | 7 push(@primes,2); 9 loop: while ($#primes < $num-1) 14 for ($i=0; defined($primes[$i]) && $primes[$i]<=$s; $i++) 16 next loop if (($p%$primes[$i]) == 0); 18 push(@primes,$p); 93 for ($i=0; $i <= $#primes; $i++) 95 if ($primes[$i] > 256) 109 print "static const prime_t primes[NUMPRIMES]=\n\t{\n\t"; 111 for ($i=0; $i <= $#primes; [all...] |
H A D | bn_prime.c | 125 * The quick sieve algorithm approach to weeding out primes is Philip 269 if (BN_mod_word(a, primes[i]) == 0) 389 mods[i] = (prime_t) BN_mod_word(rnd, (BN_ULONG)primes[i]); 390 maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; 394 * check that rnd is not a prime and also that gcd(rnd-1,primes) == 1 397 if (((mods[i] + delta) % primes[i]) <= 1) { 442 if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1) { 499 * check that for p and q gcd(p-1,primes) == 1 (except for 2) 501 if ((BN_mod_word(p, (BN_ULONG)primes[i]) == 0) || 502 (BN_mod_word(q, (BN_ULONG)primes[ [all...] |
H A D | bntest.c | 1904 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local 1906 if (!BN_set_word(p, primes[i]))
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/crypto/bn/ |
H A D | bn_prime.h | 66 static const prime_t primes[NUMPRIMES] = { variable
|
H A D | bn_prime.pl | 7 push(@primes,2); 9 loop: while ($#primes < $num-1) 14 for ($i=0; defined($primes[$i]) && $primes[$i]<=$s; $i++) 16 next loop if (($p%$primes[$i]) == 0); 18 push(@primes,$p); 93 for ($i=0; $i <= $#primes; $i++) 95 if ($primes[$i] > 256) 109 print "static const prime_t primes[NUMPRIMES]=\n\t{\n\t"; 111 for ($i=0; $i <= $#primes; [all...] |
H A D | bn_prime.c | 125 * The quick sieve algorithm approach to weeding out primes is Philip 269 if (BN_mod_word(a, primes[i]) == 0) 389 mods[i] = (prime_t) BN_mod_word(rnd, (BN_ULONG)primes[i]); 390 maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; 394 * check that rnd is not a prime and also that gcd(rnd-1,primes) == 1 397 if (((mods[i] + delta) % primes[i]) <= 1) { 442 if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1) { 499 * check that for p and q gcd(p-1,primes) == 1 (except for 2) 501 if ((BN_mod_word(p, (BN_ULONG)primes[i]) == 0) || 502 (BN_mod_word(q, (BN_ULONG)primes[ [all...] |
H A D | bntest.c | 1904 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local 1906 if (!BN_set_word(p, primes[i]))
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/ |
H A D | gl_anyhash_list2.h | 21 /* Array of primes, approximately in steps of factor 1.2. 25 static const size_t primes[] = variable 86 for (i = 0; i < sizeof (primes) / sizeof (primes[0]); i++) 87 if (primes[i] >= estimate) 88 return primes[i];
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/wget-1.12/src/ |
H A D | hash.c | 206 /* Find a prime near, but greather than or equal to SIZE. The primes 207 are looked up from a table with a selection of primes convenient 212 stored in the same variable. That way the list of primes does not 218 static const int primes[] = { local 231 for (i = *prime_offset; i < countof (primes); i++) 232 if (primes[i] >= size) 240 return primes[i];
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/test/ |
H A D | bntest.c | 1760 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local 1762 if (!BN_set_word(p, primes[i])) goto err;
|