| /external/openssl/crypto/bn/ |
| 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)
111 for ($i=0; $i <= $#primes; $i++)
113 printf "\n#ifndef EIGHT_BIT\n\t" if ($primes[$i] > 256) && !($init++);
115 printf("%4d,",$primes[$i]);
|
| D | bn_prime.c | 266 if (BN_mod_word(a, primes[i]) == 0) in BN_is_prime_fasttest_ex()
387 mods[i]=(prime_t)BN_mod_word(rnd,(BN_ULONG)primes[i]); in probable_prime()
388 maxdelta=BN_MASK2 - primes[NUMPRIMES-1]; in probable_prime()
394 if (((mods[i]+delta)%primes[i]) <= 1) in probable_prime()
431 if (BN_mod_word(rnd,(BN_ULONG)primes[i]) <= 1) in probable_prime_dh()
481 if ( (BN_mod_word(p,(BN_ULONG)primes[i]) == 0) || in probable_prime_dh_safe()
482 (BN_mod_word(q,(BN_ULONG)primes[i]) == 0)) in probable_prime_dh_safe()
|
| D | bn_prime.h | 66 static const prime_t primes[NUMPRIMES]= variable
|
| D | bntest.c | 1762 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; in test_sqrt() local
1764 if (!BN_set_word(p, primes[i])) goto err; in test_sqrt()
|
| /external/v8/test/mjsunit/ |
| D | apply.js | 140 var primes = new Array(0); variable
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.length, same_primes.length, "prime-length");
185 primes[0] = "";
[all …]
|
| /external/valgrind/main/drd/tests/ |
| D | omp_prime.c | 44 int* primes; in main() local
78 primes = malloc(n * sizeof(primes[0])); in main()
96 primes[total] = i; in main()
106 printf("%d\n", primes[i]); in main()
111 free(primes); in main()
|
| /external/apache-harmony/crypto/src/test/api/java/org/apache/harmony/crypto/tests/javax/crypto/spec/ |
| D | DHGenParameterSpecTest.java | 43 int[] primes = {Integer.MIN_VALUE, -1, 0, 1, Integer.MAX_VALUE}; in testDHGenParameterSpec() local
45 for (int i=0; i<primes.length; i++) { in testDHGenParameterSpec()
46 DHGenParameterSpec ps = new DHGenParameterSpec(primes[i], in testDHGenParameterSpec()
50 ps.getPrimeSize(), primes[i]); in testDHGenParameterSpec()
|
| /external/valgrind/main/coregrind/ |
| D | m_hashtable.c | 55 static SizeT primes[N_HASH_PRIMES] = { variable
70 SizeT n_chains = primes[0]; in VG_()
98 if (old_chains == primes[N_HASH_PRIMES-1]) in resize()
101 vg_assert(old_chains >= primes[0] in resize()
102 && old_chains < primes[N_HASH_PRIMES-1]); in resize()
105 if (primes[i] > new_chains) { in resize()
106 new_chains = primes[i]; in resize()
112 vg_assert(new_chains > primes[0] in resize()
113 && new_chains <= primes[N_HASH_PRIMES-1]); in resize()
|
| /external/dropbear/libtommath/etc/ |
| D | pprime.c | 11 FILE *primes; variable
152 primes = fopen("pprime.dat", "rb"); in load_tab()
153 if (primes == NULL) { in load_tab()
155 primes = fopen("pprime.dat", "rb"); in load_tab()
157 fseek(primes, 0, SEEK_END); in load_tab()
158 n_prime = ftell(primes) / sizeof(mp_digit); in load_tab()
167 fseek(primes, n * sizeof(mp_digit), SEEK_SET); in prime_digit()
168 fread(&d, 1, sizeof(mp_digit), primes); in prime_digit()
|
| D | drprimes.28 | 1 DR safe primes for 28-bit digits.
|
| /external/chromium/chrome/browser/debugger/manual_tests/resources/ |
| D | worker-primes.js | 3 var primes = new Primes(); variable
9 postMessage([p, primes.test(p)]);
|
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| D | bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function
28 primes(isPrime, i);
|
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| D | bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function
28 primes(isPrime, i);
|
| /external/openssh/ |
| D | Makefile.in | 296 echo "moving $(DESTDIR)$(sysconfdir)/primes to $(DESTDIR)$(sysconfdir)/moduli"; \
297 mv "$(DESTDIR)$(sysconfdir)/primes" "$(DESTDIR)$(sysconfdir)/moduli"; \
|
| D | ssh-keygen.0 | 128 Generate candidate primes for DH-GEX. These primes must be
265 Test DH group exchange candidate primes (generated using the -G
313 process: first, candidate primes are generated using a fast, but memory
314 intensive process. These candidate primes are then tested for
317 Generation of primes is performed using the -G option. The desired
318 length of the primes may be specified by the -b option. For example:
322 By default, the search for primes begins at a random point in the desired
|
| D | moduli.0 | 31 are Sophie Germain primes (type 4). Further primality
|
| /external/dropbear/libtommath/demo/ |
| D | timing.c | 206 char *primes[] = { in main() local
242 for (n = 0; primes[n]; n++) { in main()
244 mp_read_radix(&a, primes[n], 10); in main()
|
| /external/valgrind/main/auxprogs/ |
| D | Makefile.am | 19 primes.c
|
| /external/openssl/crypto/dh/ |
| D | generate | 39 Subject: random large primes
42 My personal limit on rigorously proved primes is ~350 digits.
|
| /external/dropbear/libtommath/ |
| D | changes.txt | 125 … -- Added mp_prime_random() which requires a callback to make truly random primes of a given nature
179 digit primes then it reads them randomly instead of randomly choosing/testing single
180 digit primes.
193 make primes which are either congruent to 1 or 3 mod 4.
244 … -- mp_prime_is_prime will now return true if the input is one of the primes in the prime table
|
| D | bn.tex | 1521 primes are acceptable.
1594 This will attempt to evenly divide $a$ by a list of primes\footnote{Default is the first 256 primes…
1595 outcome in ``result''. That is if $result = 0$ then $a$ is not divisible by the primes, otherwise …
1642 $1 \le t < PRIME\_SIZE$ where $PRIME\_SIZE$ is the number of primes in the prime number table (by d…
1667 mp\_prime\_random() is more suitable for generating primes which must be secret (as in the case of …
|
| /external/dropbear/libtomcrypt/ |
| D | changes | 181 … some annoying "setup" issues like the primes are smaller which makes ECM factoring more plausible.
211 v1.06 -- Fixed rand_prime() to accept negative inputs as a signal for BBS primes. [Fredrik Olsson]
730 …-- I've removed the primes from dh.c and replaced them with DR safe primes suitable for the default
743 …Times are all in milliseconds for key generation. New primes times on the left. This makes the c…
867 …-- Changed the DH and ECC code to use base64 static key settings [e.g. the primes]. Dropped the c…
902 …d the primality routines around. I now use 8 rounds of Rabin-Miller, I use 256 primes in the sieve
1047 -- replaced the primes in the DH code with new ones that are larger than the size they are
1063 …e RSA code to make keys a bit quicker [update by Wayne Scott] by not making both primes at the same
1297 -- Fixed rand_prime() so that it makes primes bigger than the setting you give. For example,
1345 does trial divisions against more primes before the Rabin Miller steps
[all …]
|
| /external/libvorbis/doc/ |
| D | vorbis-clip.txt | 104 a) The first packet only primes the overlap/add buffer. No data is
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/fr-FR/ |
| D | fr-FR_klex.pkb | 588 primauté3primezprimes.primo%C2<@!Bprinces4
|
| /external/openssh/contrib/redhat/ |
| D | openssh.spec | 488 - replace primes with moduli
|