| /frameworks/native/libs/utils/ |
| primes.py | 19 # Generates a table of prime numbers for use in BasicHashtable.cpp.
21 # Each prime is chosen such that it is a little more than twice as large as
22 # the previous prime in the table. This makes it easier to choose a new
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| ecc_import.c | 28 void *prime, *b, *t1, *t2; local
31 if ((err = mp_init_multi(&prime, &b, &t1, &t2, NULL)) != CRYPT_OK) {
35 /* load prime and b */
36 if ((err = mp_read_radix(prime, key->dp->prime, 16)) != CRYPT_OK) { goto error; }
44 if ((err = mp_mod(t2, prime, t2)) != CRYPT_OK) { goto error; }
54 if ((err = mp_mod(t1, prime, t1)) != CRYPT_OK) { goto error; }
56 if ((err = mp_add(t1, prime, t1)) != CRYPT_OK) { goto error; }
58 while (mp_cmp(t1, prime) != LTC_MP_LT) {
59 if ((err = mp_sub(t1, prime, t1)) != CRYPT_OK) { goto error;
[all...] |
| ecc_make_key.c | 54 void *prime; local
85 if ((err = mp_init_multi(&key->pubkey.x, &key->pubkey.y, &key->pubkey.z, &key->k, &prime, NULL)) != CRYPT_OK) {
95 if ((err = mp_read_radix(prime, (char *)key->dp->prime, 16)) != CRYPT_OK) { goto errkey; }
102 if ((err = ltc_mp.ecc_ptmul(key->k, base, &key->pubkey, prime, 1)) != CRYPT_OK) { goto errkey; }
112 mp_clear(prime);
|
| ecc_test.c | 53 if ((err = mp_read_radix(modulus, (char *)ltc_ecc_sets[i].prime, 16)) != CRYPT_OK) { goto done; }
56 /* is prime actually prime? */
63 /* is order prime ? */
|
| /external/dropbear/libtommath/ |
| bn_mp_prime_random_ex.c | 18 /* makes a truly random prime of a given size (bits),
22 * LTM_PRIME_BBS - make prime congruent to 3 mod 4
23 * LTM_PRIME_SAFE - make sure (p-1)/2 is prime as well (implies LTM_PRIME_BBS)
33 /* This is possibly the mother of all prime generation functions, muahahahahaha! */
92 /* is it prime? */
99 /* see if (a-1)/2 is prime */
103 /* is it prime? */
|
| bn_mp_prime_next_prime.c | 18 /* finds the next prime after the number "a" using "t" trials
21 * bbs_style = 1 means the prime must be congruent to 3 mod 4
37 /* simple algo if a is less than the largest prime in the table */
39 /* find which prime it is bigger than */
43 /* ok we found a prime smaller or
46 * however, the prime must be
50 /* scan upwards for a prime congruent to 3 mod 4 */
72 /* generate a prime congruent to 3 mod 4 or 1/3 mod 4? */
111 /* y == 1 if any residue was zero [e.g. cannot be prime] */
144 /* is this prime? *
[all...] |
| /external/openssl/crypto/dh/ |
| 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
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
| SuggestionData.java | 222 final int prime = 31; local
224 result = prime * result + ((mFormat == null) ? 0 : mFormat.hashCode());
225 result = prime * result + ((mIcon1 == null) ? 0 : mIcon1.hashCode());
226 result = prime * result + ((mIcon2 == null) ? 0 : mIcon2.hashCode());
227 result = prime * result + ((mIntentAction == null) ? 0 : mIntentAction.hashCode());
228 result = prime * result + ((mIntentData == null) ? 0 : mIntentData.hashCode());
229 result = prime * result + ((mIntentExtraData == null) ? 0 : mIntentExtraData.hashCode());
230 result = prime * result + ((mLogType == null) ? 0 : mLogType.hashCode());
231 result = prime * result + ((mShortcutId == null) ? 0 : mShortcutId.hashCode());
232 result = prime * result + ((mSource == null) ? 0 : mSource.hashCode())
[all...] |
| /external/wpa_supplicant_8/src/eap_server/ |
| eap_server_pwd.c | 150 BN_free(data->grp->prime);
246 ((element = os_malloc(BN_num_bytes(data->grp->prime) * 2)) ==
254 * sufficiently smaller than the prime or order might need pre-pending
258 os_memset(element, 0, BN_num_bytes(data->grp->prime) * 2);
263 offset = BN_num_bytes(data->grp->prime) - BN_num_bytes(x);
265 offset = BN_num_bytes(data->grp->prime) - BN_num_bytes(y);
266 BN_bn2bin(y, element + BN_num_bytes(data->grp->prime) + offset);
268 data->outbuf = wpabuf_alloc(2 * BN_num_bytes(data->grp->prime) +
275 2 * BN_num_bytes(data->grp->prime));
305 /* Each component of the cruft will be at most as big as the prime */
[all...] |
| /packages/apps/Calendar/src/com/android/calendar/ |
| CalendarEventModel.java | 468 final int prime = 31; local
470 result = prime * result + (mAllDay ? 1231 : 1237);
471 result = prime * result + ((mAttendeesList == null) ? 0 : getAttendeesString().hashCode());
472 result = prime * result + (int) (mCalendarId ^ (mCalendarId >>> 32));
473 result = prime * result + ((mDescription == null) ? 0 : mDescription.hashCode());
474 result = prime * result + ((mDuration == null) ? 0 : mDuration.hashCode());
475 result = prime * result + (int) (mEnd ^ (mEnd >>> 32));
476 result = prime * result + (mGuestsCanInviteOthers ? 1231 : 1237);
477 result = prime * result + (mGuestsCanModify ? 1231 : 1237);
478 result = prime * result + (mGuestsCanSeeGuests ? 1231 : 1237)
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/h264/model/ |
| PictureParameterSet.java | 285 final int prime = 31; local
287 result = prime * result + Arrays.hashCode(bottom_right);
288 result = prime * result + chroma_qp_index_offset;
289 result = prime * result + (constrained_intra_pred_flag ? 1231 : 1237);
290 result = prime * result
292 result = prime * result + (entropy_coding_mode_flag ? 1231 : 1237);
293 result = prime * result
295 result = prime * result + num_ref_idx_l0_active_minus1;
296 result = prime * result + num_ref_idx_l1_active_minus1;
297 result = prime * result + num_slice_groups_minus1
[all...] |
| /cts/tools/signature-tools/src/signature/converter/dex/ |
| FieldPool.java | 46 final int prime = 31; local
47 int result = prime * fieldName.hashCode();
48 result = prime * result + qualifiedClassName.hashCode();
|
| /libcore/luni/src/main/java/javax/crypto/spec/ |
| DHGenParameterSpec.java | 36 * the size of the <i>prime modulus</i> in bits.
46 * Returns the size of the <i>prime modulus</i> in bits.
48 * @return the size of the prime modulus in bits.
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| RSAKeyPairGenerator.java | 46 // generate p, prime and (p-1) relatively prime to e
73 // generate q, prime and (q-1) relatively prime to e,
|
| /external/openssl/apps/ |
| dh1024.pem | 10 Note that g is not a generator, but this is not a problem since p is a safe prime.
|
| /external/wpa_supplicant_8/src/crypto/ |
| dh_groups.h | 16 const u8 *prime; member in struct:dh_group
|
| /external/wpa_supplicant_8/src/eap_common/ |
| eap_pwd_common.c | 122 grp->prime = NULL;
133 ((grp->prime = BN_new()) == NULL) ||
139 if (!EC_GROUP_get_curve_GFp(grp->group, grp->prime, NULL, NULL, NULL))
141 wpa_printf(MSG_INFO, "EAP-pwd: unable to get prime for GFp "
154 primebitlen = BN_num_bits(grp->prime);
155 primebytelen = BN_num_bytes(grp->prime);
173 * compute counter-mode password value and stretch to prime
208 if (BN_ucmp(x_candidate, grp->prime) >= 0)
270 BN_free(grp->prime);
271 grp->prime = NULL
[all...] |
| eap_pwd_common.h | 18 * TODO: support one based on a prime field
25 BIGNUM *prime; member in struct:group_definition_
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/refactoring/changes/ |
| AndroidLayoutChangeDescription.java | 84 final int prime = 31; local
86 result = prime * result + ((mClassName == null) ? 0 : mClassName.hashCode());
87 result = prime * result + ((mNewName == null) ? 0 : mNewName.hashCode());
88 result = prime * result + mType;
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/rsa/ |
| BCRSAPrivateCrtKey.java | 146 * return the prime P.
148 * @return the prime P.
156 * return the prime Q.
158 * @return the prime Q.
166 * return the prime exponent for P.
168 * @return the prime exponent for P.
176 * return the prime exponent for Q.
178 * @return the prime exponent for Q.
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| JCERSAPrivateCrtKey.java | 146 * return the prime P.
148 * @return the prime P.
156 * return the prime Q.
158 * @return the prime Q.
166 * return the prime exponent for P.
168 * @return the prime exponent for P.
176 * return the prime exponent for Q.
178 * @return the prime exponent for Q.
|
| /external/dropbear/ |
| genrsa.c | 36 static void getrsaprime(mp_int* prime, mp_int *primeminus,
95 /* return a prime suitable for p or q */
96 static void getrsaprime(mp_int* prime, mp_int *primeminus,
107 the next prime above it */
111 bytes_to_mp(prime, buf, size+1);
113 /* find the next integer which is prime, 8 round of miller-rabin */
114 if (mp_prime_next_prime(prime, 8, 0) != MP_OKAY) {
120 if (mp_sub_d(prime, 1, primeminus) != MP_OKAY) {
|
| /libcore/luni/src/main/java/java/security/interfaces/ |
| DSAParams.java | 35 * Returns the prime ({@code p}) value.
37 * @return the prime ({@code p}) value.
|
| /frameworks/base/location/java/android/location/ |
| Geofence.java | 148 final int prime = 31; local
152 result = prime * result + (int) (temp ^ (temp >>> 32));
154 result = prime * result + (int) (temp ^ (temp >>> 32));
155 result = prime * result + Float.floatToIntBits(mRadius);
156 result = prime * result + mType;
|
| /bionic/libc/tools/zoneinfo/ |
| ZoneInfo.java | 258 final int prime = 31; local
260 result = prime * result + ((mDaylightName == null) ? 0 :
262 result = prime * result + Arrays.hashCode(mGmtOffs);
263 result = prime * result + Arrays.hashCode(mIsDsts);
264 result = prime * result + mRawOffset;
265 result = prime * result + ((mStandardName == null) ? 0 :
267 result = prime * result + Arrays.hashCode(mTransitions);
268 result = prime * result + Arrays.hashCode(mTypes);
269 result = prime * result + (mUseDst ? 1231 : 1237);
|
