| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/generators/ |
| RSAKeyPairGenerator.java | 107 // if we get here our primes aren't big enough, make the largest
|
| /external/dropbear/libtommath/ |
| bn_mp_dr_reduce.c | 22 * "Generating Efficient Primes for Discrete Log Cryptosystems"
|
| tommath.h | 446 /* ---> Primes <--- */
448 /* number of primes */
455 /* table of first PRIME_SIZE primes */
458 /* result=1 if a is divisible by one of the first PRIME_SIZE primes */
|
| 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
|
| bn.tex | [all...] |
| /external/dropbear/libtommath/etc/ |
| mersenne.c | 1 /* Finds Mersenne primes using the Lucas-Lehmer test
|
| /external/icu4c/common/ |
| uhash.c | 60 * PRIMES table, so that when the primeIndex is incremented or
69 /* This is a list of non-consecutive primes chosen such that
70 * PRIMES[i+1] ~ 2*PRIMES[i]. (Currently, the ratio ranges from 1.81
78 static const int32_t PRIMES[] = {
85 #define PRIMES_LENGTH (sizeof(PRIMES) / sizeof(PRIMES[0]))
88 /* These ratios are tuned to the PRIMES array such that a resize
219 hash->length = PRIMES[primeIndex];
551 /* Find the smallest index i for which PRIMES[i] >= size. *
[all...] |
| /dalvik/libcore/security/src/main/java/java/security/spec/ |
| RSAPrivateCrtKeySpec.java | 47 * exponents, crt coefficient, and additional primes.
|
| /external/openssl/crypto/bn/ |
| bn_x931p.c | 64 /* X9.31 prime derivation. This is used to generate the primes pi
235 /* Generate primes using X9.31 algorithm. Of the values p, p1, p2, Xp1
|
| bn.h | 647 /* faster mod functions for the 'NIST primes'
769 /* Primes from RFC 2409 */
773 /* Primes from RFC 3526 */
[all...] |
| bn_prime.h | 66 static const prime_t primes[NUMPRIMES]= variable
|
| /external/openssl/crypto/rsa/ |
| rsa_x931g.c | 134 /* Since both primes are set we can now calculate all remaining
221 /* Generate two primes from Xp, Xq */
|
| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| rsa_make_key.c | 53 /* make primes p and q (optimization provided by Wayne Scott) */
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| hashtab.h | 140 table of primes. */
|
| /dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| DHParameters.java | 20 * This class contains well-known primes
|
| /external/openssl/crypto/dh/ |
| dh.h | 158 /* primes p where (p-1)/2 is prime too are called "safe"; we define
|
| /external/openssl/include/openssl/ |
| dh.h | 158 /* primes p where (p-1)/2 is prime too are called "safe"; we define
|
| bn.h | 647 /* faster mod functions for the 'NIST primes'
769 /* Primes from RFC 2409 */
773 /* Primes from RFC 3526 */
[all...] |
| /external/dropbear/libtomcrypt/ |
| 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]
[all...] |
| /prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/lib/gcc/i686-unknown-linux-gnu/4.2.1/include/openssl/ |
| bn.h | 624 /* faster mod functions for the 'NIST primes'
746 /* Primes from RFC 2409 */
750 /* Primes from RFC 3526 */
|
| /dalvik/libcore/dalvik/src/main/java/dalvik/system/ |
| VMDebug.java | 338 * Primes the register map cache.
|
| /dalvik/libcore/math/src/test/java/tests/api/java/math/ |
| BigIntegerTest.java | 131 @KnownFailure("BIGNUM returns no Primes smaller than 16 bits.")
348 assertFalse("isProbablePrime failed for product of two large primes" +
388 assertFalse("isProbablePrime failed for product of two large primes" +
[all...] |
| /external/speex/libspeex/ |
| kiss_fft.c | 441 /*factor out powers of 4, powers of 2, then any remaining primes */
|
| /external/stlport/stlport/stl/ |
| _hashtable.h | 191 // Returns begining of primes list and size by reference.
|
| /external/bison/lib/ |
| hash.c | 453 prime. Primes lower than 10 are merely skipped. */
458 /* Skip small primes. */
|
