| /external/dropbear/libtommath/etc/ |
| drprimes.txt | 1 300-bit prime:
4 540-bit prime:
7 780-bit prime:
|
| drprimes.28 | 3 224-bit prime:
6 532-bit prime:
9 784-bit prime:
12 1036-bit prime:
15 1540-bit prime:
18 2072-bit prime:
21 3080-bit prime:
24 4116-bit prime:
|
| mersenne.c | 58 /* if u == 0 then its prime */
89 /* is the long prime by brute force */
117 /* test if 2^k - 1 is prime */
127 /* display if prime */
128 printf ("2^%-5ld - 1 is prime, test took %ld ticks\n", k, tt);
134 /* but make sure its prime */
|
| /libcore/luni/src/main/java/java/security/spec/ |
| RSAOtherPrimeInfo.java | 23 * The additional prime information specified as triplet of primes, a prime
31 // Prime
32 private final BigInteger prime; field in class:RSAOtherPrimeInfo
33 // Prime Exponent
39 * Creates a new {@code RSAOtherPrimeInfo} with the specified prime,
42 * @param prime
43 * the prime factor.
45 * the prime exponent.
49 public RSAOtherPrimeInfo(BigInteger prime,
[all...] |
| DSAParameterSpec.java | 27 // Prime
29 // Sub-prime
35 * Creates a new {@code DSAParameterSpec} with the specified prime {@code p},
36 * sub-prime {@code q} and the base {@code g}.
39 * the prime {@code p}.
41 * the sub-prime {@code q}.
61 * Returns the prime {@code p}.
63 * @return the prime {@code p}.
70 * Returns the sub-prime {@code q}.
72 * @return the sub-prime {@code q}
[all...] |
| RSAPrivateCrtKeySpec.java | 33 // Prime P
35 // Prime Q
37 // Prime Exponent P
39 // Prime Exponent Q
46 * modulus, public exponent, private exponent, prime factors, prime
56 * the prime factor {@code p} of {@code n}.
58 * the prime factor {@code q} of {@code n}.
60 * the exponent of the prime {@code p}.
62 * the exponent of the prime {@code q}
[all...] |
| DSAPrivateKeySpec.java | 28 // Prime
30 // Sub-prime
37 * prime, sub-prime and base.
42 * the prime {@code p}.
44 * the sub-prime {@code q}.
66 * Returns the prime {@code p}.
68 * @return the prime {@code p}.
75 * Returns the sub-prime {@code q}.
77 * @return the sub-prime {@code q}
[all...] |
| DSAPublicKeySpec.java | 28 // Prime
30 // Sub-prime
37 * prime, sub-prime and base.
42 * the prime {@code p}.
44 * the sub-prime {@code q}.
66 * Returns the prime {@code p}.
68 * @return the prime {@code p}.
75 * Returns the sub-prime {@code q}.
77 * @return the sub-prime {@code q}
[all...] |
| RSAMultiPrimePrivateCrtKeySpec.java | 23 * The key specification of a RSA multi-prime private key with the Chinese
33 // Prime P
35 // Prime Q
37 // Prime Exponent P
39 // Prime Exponent Q
43 // Other Prime Info
48 * modulus, public exponent, private exponent, prime factors, prime
58 * the prime factor {@code p} of {@code n}.
60 * the prime factor {@code q} of {@code n}
[all...] |
| ECFieldFp.java | 23 * The parameters specifying a <i>prime finite field</i> of an
27 // Prime
31 * Creates a new prime finite field of an elliptic curve with the specified
32 * prime {@code p}.
35 * the prime value {@code p}.
60 * Returns the prime value {@code p} for this finite field.
62 * @return the prime value {@code p} for this finite field.
|
| /libcore/luni/src/main/java/java/security/interfaces/ |
| RSAMultiPrimePrivateCrtKey.java | 24 * The interface for a Multi-Prime RSA private key. Specified by <a
26 * Multi-Prime RSA</a>.
51 * Returns the prime factor {@code p} of {@code n}.
53 * @return the prime factor {@code p} of {@code n}.
58 * Returns the prime factor {@code q} of {@code n}.
60 * @return the prime factor {@code q} of {@code n}.
65 * Returns the CRT exponent of the prime {@code p}.
67 * @return the CRT exponent of the prime {@code p}.
72 * Returns the CRT exponent of the prime {@code q}.
74 * @return the CRT exponent of the prime {@code q}
[all...] |
| RSAPrivateCrtKey.java | 40 * Returns the prime factor {@code p} of {@code n}.
42 * @return the prime factor {@code p} of {@code n}.
47 * Returns the prime factor {@code q} of {@code n}.
49 * @return the prime factor {@code q} of {@code n}.
56 * @return the CRT exponent of the prime {@code p}.
61 * Returns the CRT exponent of the prime {@code q}.
63 * @return the CRT exponent of the prime {@code q}.
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| DHParametersGenerator.java | 19 * @param size bit length for the prime p
20 * @param certainty level of certainty for the prime number tests
42 // find a safe prime p where p = 2*q + 1, where p and q are prime.
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| ecc_shared_secret.c | 39 void *prime; local
66 if ((err = mp_init(&prime)) != CRYPT_OK) {
71 if ((err = mp_read_radix(prime, (char *)private_key->dp->prime, 16)) != CRYPT_OK) { goto done; }
72 if ((err = ltc_mp.ecc_ptmul(private_key->k, &public_key->pubkey, result, prime, 1)) != CRYPT_OK) { goto done; }
74 x = (unsigned long)mp_unsigned_bin_size(prime);
86 mp_clear(prime);
|
| /external/openssh/ |
| moduli.0 | 7 The /etc/moduli file contains prime numbers and generators for use by
14 are prime and are safe for use in Diffie-Hellman operations by sshd(8).
24 the prime modulus. Supported types are:
27 2 "Safe" prime; (p-1)/2 is also prime.
28 4 Sophie Germain; (p+1)*2 is also prime.
32 testing with ssh-keygen(1) produces safe prime moduli
41 0x01 Composite number - not prime.
53 size Decimal number indicating the size of the prime in
|
| moduli.5 | 25 file contains prime numbers and generators for use by
41 provides a high degree of assurance that the numbers are prime and are
55 Decimal number specifying the internal structure of the prime modulus.
62 "Safe" prime; (p-1)/2 is also prime.
64 Sophie Germain; (p+1)*2 is also prime.
72 produces safe prime moduli (type 2) that are ready for use in
83 Composite number \(en not prime.
100 Decimal number indicating the size of the prime in bits.
|
| /libcore/luni/src/main/java/javax/crypto/spec/ |
| DHParameterSpec.java | 34 * <i>prime modulus</i> and <i>base generator</i>.
37 * the prime modulus.
49 * <i>prime modulus</i>, <i>base generator</i> and size (in bits) of the
53 * the prime modulus.
66 * Returns the <i>prime modulus</i> of this parameter specification.
68 * @return the prime modulus.
|
| DHPrivateKeySpec.java | 34 * value</i> <code>x</code>. <i>prime modulus</i> <code>p</code> and <i>base
40 * the prime modulus.
60 * Returns the <i>prime modulus</i> <code>p</code>.
62 * @return the prime modulus <code>p</code>.
|
| DHPublicKeySpec.java | 34 * <i>public value</i> <code>y</code>, the <i>prime modulus</i>
40 * the prime modulus.
60 * Returns the <i>prime modulus</i> <code>p</code>.
62 * @return the prime modulus <code>p</code>.
|
| /external/wpa_supplicant_8/src/eap_peer/ |
| eap_pwd.c | 156 BN_free(data->grp->prime);
245 BN_num_bits(data->grp->prime));
331 BN_bin2bn(ptr, BN_num_bytes(data->grp->prime), x);
332 ptr += BN_num_bytes(data->grp->prime);
333 BN_bin2bn(ptr, BN_num_bytes(data->grp->prime), y);
334 ptr += BN_num_bytes(data->grp->prime);
409 ((element = os_malloc(BN_num_bytes(data->grp->prime) * 2)) ==
417 * sufficiently smaller than the prime or order might need pre-pending
421 os_memset(element, 0, BN_num_bytes(data->grp->prime) * 2);
426 offset = BN_num_bytes(data->grp->prime) - BN_num_bytes(x)
[all...] |
| /external/chromium/testing/gtest/samples/ |
| prime_tables.h | 34 // prime and determines a next prime number. This interface is used
42 // The prime table interface.
47 // Returns true iff n is a prime number.
50 // Returns the smallest prime number greater than p; or returns -1
51 // if the next prime is beyond the capacity of the table.
82 // 'max' specifies the maximum number the prime table holds.
109 // Marks all multiples of i (except i itself) as non-prime.
|
| /external/gtest/samples/ |
| prime_tables.h | 34 // prime and determines a next prime number. This interface is used
42 // The prime table interface.
47 // Returns true iff n is a prime number.
50 // Returns the smallest prime number greater than p; or returns -1
51 // if the next prime is beyond the capacity of the table.
82 // 'max' specifies the maximum number the prime table holds.
109 // Marks all multiples of i (except i itself) as non-prime.
|
| /external/protobuf/gtest/samples/ |
| prime_tables.h | 34 // prime and determines a next prime number. This interface is used
42 // The prime table interface.
47 // Returns true iff n is a prime number.
50 // Returns the smallest prime number greater than p; or returns -1
51 // if the next prime is beyond the capacity of the table.
82 // 'max' specifies the maximum number the prime table holds.
109 // Marks all multiples of i (except i itself) as non-prime.
|
| /external/openssl/apps/ |
| dh512.pem | 9 Note that g is not a generator, but this is not a problem since p is a safe prime.
|
| /libcore/luni/src/test/java/tests/security/interfaces/ |
| RSAPrivateCrtKeyTest.java | 47 assertEquals("invalid prime exponent P",
56 assertEquals("invalid prime exponent Q",
65 assertEquals("invalid prime P",
74 assertEquals("invalid prime Q",
|
