| /dalvik/libcore/math/src/main/java/java/math/ |
| Primality.java | 37 private static final int primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, field in class:Primality
53 private static final BigInteger BIprimes[] = new BigInteger[primes.length];
68 // * It encodes how many i-bit primes there are in the table for
77 static {// To initialize the dual table of BigInteger primes
78 for (int i = 0; i < primes.length; i++) {
79 BIprimes[i] = BigInteger.valueOf(primes[i]);
97 int modules[] = new int[primes.length];
103 if (l < primes[primes.length - 1]) {
104 for (i = 0; l >= primes[i]; i++) {
[all...] |
| /external/webkit/SunSpider/tests/sunspider-0.9/ |
| bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function
28 primes(isPrime, i);
|
| /external/webkit/SunSpider/tests/sunspider-0.9.1/ |
| bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function
28 primes(isPrime, i);
|
| /external/dropbear/libtommath/etc/ |
| drprimes.28 | 1 DR safe primes for 28-bit digits.
|
| makefile | 9 #provable primes
32 # spits out mersenne primes
36 # fines DR safe primes for the given config
40 # fines 2k safe primes for the given config
|
| makefile.icc | 27 #provable primes
50 # spits out mersenne primes
54 # fines DR safe primes for the given config
58 # fines 2k safe primes for the given config
|
| pprime.c | 1 /* Generates provable primes
11 FILE *primes; variable
41 /* write first set of primes */
152 primes = fopen("pprime.dat", "rb");
153 if (primes == NULL) {
155 primes = fopen("pprime.dat", "rb");
157 fseek(primes, 0, SEEK_END);
158 n_prime = ftell(primes) / sizeof(mp_digit);
167 fseek(primes, n * sizeof(mp_digit), SEEK_SET);
168 fread(&d, 1, sizeof(mp_digit), primes);
[all...] |
| 2kprime.c | 1 /* Makes safe primes of a 2k nature */
31 printf("No primes of size %d found\n", sizes[x]);
|
| drprime.c | 1 /* Makes safe primes of a DR nature */
|
| /external/openssl/crypto/bn/ |
| 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; $i++
[all...] |
| 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]=(prime_t)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[i]) == 0)
[all...] |
| /external/v8/test/mjsunit/ |
| apply.js | 144 var primes = new Array(0);
147 for (var d = 0; d < primes.length; d++) {
148 var p = primes[d];
159 primes.push(i);
163 assertEquals(1229, primes.length);
165 var same_primes = Array.prototype.constructor.apply(Array, primes);
167 for (var i = 0; i < primes.length; i++)
168 assertEquals(primes[i], same_primes[i], "prime" + primes[i]);
169 assertEquals(primes.length, same_primes.length, "prime-length")
[all...] |
| /dalvik/libcore/security/src/main/java/java/security/interfaces/ |
| RSAMultiPrimePrivateCrtKey.java | 43 * Returns the information for the additional primes.
45 * @return the information for the additional primes, or {@code null} if
46 * there are only the two primes ({@code p, q}),
|
| /dalvik/libcore/crypto/src/test/java/org/apache/harmony/crypto/tests/javax/crypto/spec/ |
| DHGenParameterSpecTest.java | 70 int[] primes = {Integer.MIN_VALUE, -1, 0, 1, Integer.MAX_VALUE}; local
72 for (int i=0; i<primes.length; i++) {
73 DHGenParameterSpec ps = new DHGenParameterSpec(primes[i],
77 ps.getPrimeSize(), primes[i]);
|
| /external/dropbear/libtommath/mtest/ |
| mpi-config.h | 73 the more space they take up. See primes.c for the possible
76 #define MP_PTAB_SIZE 128 /* how many built-in primes? */
|
| /dalvik/libcore/security/src/main/java/java/security/spec/ |
| RSAMultiPrimePrivateCrtKeySpec.java | 51 * exponents, crt coefficient, and additional primes.
70 * the information for the additional primes or {@code null} if
71 * there are only the two primes ({@code p, q}).
144 * Returns the information for the additional primes.
146 * @return the information for the additional primes, or {@code null} if
147 * there are only the two primes ({@code p, q}).
|
| RSAOtherPrimeInfo.java | 25 * The additional prime information specified as triplet of primes, a prime
|
| /external/dropbear/libtommath/ |
| bn_mp_prime_is_divisible.c | 19 * of the first PRIME_SIZE primes or not
|
| bn_mp_prime_is_prime.c | 38 /* is the input equal to one of the primes in the table? */
|
| /external/elfutils/lib/ |
| next_prime.c | 43 /* We need primes for the table size. */
|
| /external/gtest/samples/ |
| prime_tables.h | 55 // Implementation #1 calculates the primes on-the-fly.
78 // Implementation #2 pre-calculates the primes and stores the result
|
| /external/openssl/crypto/dh/ |
| generate | 39 Subject: random large primes
42 My personal limit on rigorously proved primes is ~350 digits.
|
| dh_gen.c | 91 * for 3, p mod 12 == 5 <<<<< does not work for safe primes.
133 #if 0 /* does not work for safe primes */
152 * generator or not: since we are using safe primes,
|
| /external/dropbear/libtommath/demo/ |
| timing.c | 206 char *primes[] = { local
211 /* 2K moduli mersenne primes */
242 for (n = 0; primes[n]; n++) {
244 mp_read_radix(&a, primes[n], 10);
|
| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| misc_utils.sgml | 354 Gets the smallest prime number from a built-in array of primes which
359 The built-in array of primes ranges from 11 to 13845163 such that
364 @Returns: the smallest prime number from a built-in array of primes which is
|
