| /external/openssl/crypto/bn/ |
| bn_prime.h | 66 static const prime_t primes[NUMPRIMES]= variable
|
| bntest.c | 1760 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local
[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);
|
| /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]);
|
| /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/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/dropbear/libtommath/etc/ |
| 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...] |
