Searched refs:primes (Results 1 - 17 of 17) sorted by relevance

/external/chromium/chrome/browser/debugger/manual_tests/resources/
H A Dworker-primes.js1 importScripts('primes.js');
3 var primes = new Primes();
9 postMessage([p, primes.test(p)]);
/external/openssl/crypto/bn/
H A Dbn_prime.h66 static const prime_t primes[NUMPRIMES]= variable
H A Dbn_prime.pl7 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 Dbn_prime.c123 /* 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[
[all...]
H A Dbntest.c1762 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local
1764 if (!BN_set_word(p, primes[i])) goto err;
/external/apache-harmony/crypto/src/test/api/java/org/apache/harmony/crypto/tests/javax/crypto/spec/
H A DDHGenParameterSpecTest.java43 int[] primes = {Integer.MIN_VALUE, -1, 0, 1, Integer.MAX_VALUE};
45 for (int i=0; i<primes.length; i++) {
46 DHGenParameterSpec ps = new DHGenParameterSpec(primes[i],
50 ps.getPrimeSize(), primes[i]);
/external/valgrind/main/drd/tests/
H A Domp_prime.c44 int* primes; local
78 primes = malloc(n * sizeof(primes[0]));
96 primes[total] = i;
106 printf("%d\n", primes[i]);
111 free(primes);
/external/v8/test/mjsunit/
H A Dapply.js140 var primes = new Array(0);
143 for (var d = 0; d < primes.length; d++) {
144 var p = primes[d];
155 primes.push(i);
159 assertEquals(1229, primes.length);
161 var same_primes = Array.prototype.constructor.apply(Array, primes);
163 for (var i = 0; i < primes.length; i++)
164 assertEquals(primes[i], same_primes[i], "prime" + primes[i]);
165 assertEquals(primes
[all...]
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/
H A Dbitops-nsieve-bits.js12 function primes(isPrime, n) { function
28 primes(isPrime, i);
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
H A Dbitops-nsieve-bits.js12 function primes(isPrime, n) { function
28 primes(isPrime, i);
/external/valgrind/main/coregrind/
H A Dm_hashtable.c55 static SizeT primes[N_HASH_PRIMES] = { variable
70 SizeT n_chains = primes[0];
97 /* If we've run out of primes, do nothing. */
98 if (old_chains == primes[N_HASH_PRIMES-1])
101 vg_assert(old_chains >= primes[0]
102 && old_chains < primes[N_HASH_PRIMES-1]);
105 if (primes[i] > new_chains) {
106 new_chains = primes[i];
112 vg_assert(new_chains > primes[0]
113 && new_chains <= primes[N_HASH_PRIME
[all...]
/external/dropbear/libtommath/etc/
H A Dpprime.c1 /* 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...]
/external/dropbear/libtommath/demo/
H A Dtiming.c206 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/
H A Dbn.tex1521 primes are acceptable.
1594 This will attempt to evenly divide $a$ by a list of primes\footnote{Default is the first 256 primes.} and store the
1595 outcome in ``result''. That is if $result = 0$ then $a$ is not divisible by the primes, otherwise it is. Note that
1642 $1 \le t < PRIME\_SIZE$ where $PRIME\_SIZE$ is the number of primes in the prime number table (by default this is $256$).
1667 mp\_prime\_random() is more suitable for generating primes which must be secret (as in the case of RSA) since there
/external/openssh/contrib/redhat/
H A Dopenssh.spec488 - replace primes with moduli
693 - Add the primes file from the latest snapshot to the main package (#20884).
/external/dropbear/libtomcrypt/
H A Dcrypt.tex3229 The system begins with with two primes $p$ and $q$ and their product $N = pq$. The order or \textit{Euler totient} of the
3241 Currently RSA is a difficult system to cryptanalyze provided that both primes are large and not close to each other.
4884 two phases. First it will perform trial division by the first few primes. Second it will perform eight rounds of the
4890 When making random primes the trial division step is in fact an optimized implementation of \textit{Implementation of Fast RSA Key Generation on Smart Cards}\footnote{Chenghuai Lu, Andre L. M. dos Santos and Francisco R. Pimentel}.
4891 In essence a table of machine-word sized residues are kept of a candidate modulo a set of primes. When the candidate
4897 instance, in RSA two primes $p$ and $q$ are required. The order of the multiplicative sub-group (modulo $pq$) is given
4900 the multi-prime RSA. Suppose $q = rs$ for two primes $r$ and $s$ then $\phi(pq) = (p - 1)(r - 1)(s - 1)$ which clearly is
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dcom.ibm.icu_4.2.1.v20100412.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 1344 milliseconds