| /external/dropbear/libtommath/etc/ |
| D | 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:
|
| D | drprimes.txt | 1 300-bit prime:
4 540-bit prime:
7 780-bit prime:
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| D | ecc_shared_secret.c | 39 void *prime; in ecc_shared_secret() local
66 if ((err = mp_init(&prime)) != CRYPT_OK) { in ecc_shared_secret()
71 …if ((err = mp_read_radix(prime, (char *)private_key->dp->prime, 16)) != CRYPT_OK) … in ecc_shared_secret()
72 …if ((err = ltc_mp.ecc_ptmul(private_key->k, &public_key->pubkey, result, prime, 1)) != CRYPT_OK) … in ecc_shared_secret()
74 x = (unsigned long)mp_unsigned_bin_size(prime); in ecc_shared_secret()
86 mp_clear(prime); in ecc_shared_secret()
|
| D | ecc_import.c | 28 void *prime, *b, *t1, *t2; in is_point() local
31 if ((err = mp_init_multi(&prime, &b, &t1, &t2, NULL)) != CRYPT_OK) { in is_point()
36 …if ((err = mp_read_radix(prime, key->dp->prime, 16)) != CRYPT_OK) { goto … in is_point()
44 …if ((err = mp_mod(t2, prime, t2)) != CRYPT_OK) { goto … in is_point()
54 …if ((err = mp_mod(t1, prime, t1)) != CRYPT_OK) { goto … in is_point()
56 …if ((err = mp_add(t1, prime, t1)) != CRYPT_OK) { goto err… in is_point()
58 while (mp_cmp(t1, prime) != LTC_MP_LT) { in is_point()
59 …if ((err = mp_sub(t1, prime, t1)) != CRYPT_OK) { goto err… in is_point()
70 mp_clear_multi(prime, b, t1, t2, NULL); in is_point()
|
| D | ecc_make_key.c | 54 void *prime; in ecc_make_key_ex() local
85 …if ((err = mp_init_multi(&key->pubkey.x, &key->pubkey.y, &key->pubkey.z, &key->k, &prime, NULL)) !… in ecc_make_key_ex()
95 …if ((err = mp_read_radix(prime, (char *)key->dp->prime, 16)) != CRYPT_OK) { got… in ecc_make_key_ex()
102 …if ((err = ltc_mp.ecc_ptmul(key->k, base, &key->pubkey, prime, 1)) != CRYPT_OK) { got… in ecc_make_key_ex()
112 mp_clear(prime); in ecc_make_key_ex()
|
| /external/dropbear/ |
| D | genrsa.c | 36 static void getrsaprime(mp_int* prime, mp_int *primeminus,
96 static void getrsaprime(mp_int* prime, mp_int *primeminus, in getrsaprime() argument
111 bytes_to_mp(prime, buf, size+1); in getrsaprime()
114 if (mp_prime_next_prime(prime, 8, 0) != MP_OKAY) { in getrsaprime()
120 if (mp_sub_d(prime, 1, primeminus) != MP_OKAY) { in getrsaprime()
|
| /external/openssl/crypto/dh/ |
| D | generate | 20 q should be prime, and ideally should be a "strong prime",
21 which means it's of the form 2n+1 where n is also prime.
30 relatively prime to q-1. Usually a small prime like 2, 3 or 5 will
41 Since your prime is really random, proving it is hard.
47 to be a non-square. If (P-1)/2 is also prime, then
|
| D | example | 27 Hi. I've generated a 2047-bit "strong" prime number that I would like to
29 'p' prime, but so is (p-1)/2.
33 However, to increase my confidence that this number really is a strong prime,
44 The generator, g, for this prime is 2.
|
| /external/icu4c/data/translit/ |
| D | Uzbek_Latin_BGN.txt | 12 $prime = ʹ ;
98 Ъ → $prime ; # CYRILLIC CAPITAL LETTER HARD SIGN
99 ъ → $prime ; # CYRILLIC SMALL LETTER HARD SIGN
100 Ь → $prime ; # CYRILLIC CAPITAL LETTER SOFT SIGN
101 ь → $prime ; # CYRILLIC SMALL LETTER SOFT SIGN
|
| D | Mongolian_Latin_BGN.txt | 12 $prime = ʹ ;
89 Ъ → $prime ; # CYRILLIC CAPITAL LETTER HARD SIGN
90 ъ → $prime ; # CYRILLIC SMALL LETTER HARD SIGN
|
| D | Kirghiz_Latin_BGN.txt | 12 $prime = ʹ ;
99 Ь → $prime ; # CYRILLIC CAPITAL LETTER SOFT SIGN
100 ь → $prime ; # CYRILLIC SMALL LETTER SOFT SIGN
|
| D | Belarusian_Latin_BGN.txt | 12 $prime = ʹ ;
97 Ь → $prime ; # CYRILLIC CAPITAL LETTER SOFT SIGN
98 ь → $prime ; # CYRILLIC SMALL LETTER SOFT SIGN
|
| D | Ukrainian_Latin_BGN.txt | 12 $prime = ʹ ;
114 Ь → $prime ; # CYRILLIC CAPITAL LETTER SOFT SIGN
115 ь → $prime ; # CYRILLIC SMALL LETTER SOFT SIGN
|
| D | Turkmen_Latin_BGN.txt | 11 $prime = ʹ ;
112 Ь → $prime ; # CYRILLIC CAPITAL LETTER SOFT SIGN
113 ь → $prime ; # CYRILLIC SMALL LETTER SOFT SIGN
|
| /external/chromium/third_party/icu/source/data/translit/ |
| D | Uzbek_Latin_BGN.txt | 12 $prime = ʹ ;
98 Ъ → $prime ; # CYRILLIC CAPITAL LETTER HARD SIGN
99 ъ → $prime ; # CYRILLIC SMALL LETTER HARD SIGN
100 Ь → $prime ; # CYRILLIC CAPITAL LETTER SOFT SIGN
101 ь → $prime ; # CYRILLIC SMALL LETTER SOFT SIGN
|
| D | Mongolian_Latin_BGN.txt | 12 $prime = ʹ ;
89 Ъ → $prime ; # CYRILLIC CAPITAL LETTER HARD SIGN
90 ъ → $prime ; # CYRILLIC SMALL LETTER HARD SIGN
|
| D | Kirghiz_Latin_BGN.txt | 12 $prime = ʹ ;
99 Ь → $prime ; # CYRILLIC CAPITAL LETTER SOFT SIGN
100 ь → $prime ; # CYRILLIC SMALL LETTER SOFT SIGN
|
| D | Belarusian_Latin_BGN.txt | 12 $prime = ʹ ;
97 Ь → $prime ; # CYRILLIC CAPITAL LETTER SOFT SIGN
98 ь → $prime ; # CYRILLIC SMALL LETTER SOFT SIGN
|
| D | Russian_Latin_BGN.txt | 12 $prime = ʹ ;
112 Ь → $prime ; # CYRILLIC CAPITAL LETTER SOFT SIGN
113 ь → $prime ; # CYRILLIC SMALL LETTER SOFT SIGN
|
| D | Ukrainian_Latin_BGN.txt | 12 $prime = ʹ ;
114 Ь → $prime ; # CYRILLIC CAPITAL LETTER SOFT SIGN
115 ь → $prime ; # CYRILLIC SMALL LETTER SOFT SIGN
|
| /external/dropbear/libtomcrypt/notes/ |
| D | tech0006.txt | 28 p INTEGER , -- prime modulus
29 q INTEGER , -- order of sub-group (must be prime)
39 p INTEGER , -- prime modulus
40 q INTEGER , -- order of sub-group (must be prime)
|
| /external/wpa_supplicant_6/wpa_supplicant/src/crypto/ |
| D | dh_groups.c | 573 if (os_memcmp(wpabuf_head(*priv), dh->prime, dh->prime_len) > 0) { in dh_init()
585 dh->prime, dh->prime_len, wpabuf_mhead(pv), in dh_init()
621 dh->prime, dh->prime_len, in dh_derive_shared()
|
| /external/oauth/core/src/main/java/net/oauth/ |
| D | OAuth.java | 242 final int prime = 31; in hashCode() local
244 result = prime * result + ((key == null) ? 0 : key.hashCode()); in hashCode()
245 result = prime * result + ((value == null) ? 0 : value.hashCode()); in hashCode()
|
| /external/chromium/third_party/icu/source/test/perf/unisetperf/draft/ |
| D | bitset.cpp | 35 const int32_t prime=1301; // Less than 2k. member
64 hash=(hash+prime)&0x7ff; in map()
|
| /external/icu4c/test/perf/unisetperf/draft/ |
| D | bitset.cpp | 35 const int32_t prime=1301; // Less than 2k. member
64 hash=(hash+prime)&0x7ff; in map()
|