| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/libexec/gcc/i686-linux/4.6.x-google/ |
| libfunction_reordering_plugin.so.0.0.0 | |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/digests/ |
| SHA256Digest.java | 127 * of the first eight prime numbers
282 * cube roots of the first sixty-four prime numbers)
|
| /external/openssl/crypto/dh/ |
| dhtest.c | 127 BIO_puts(out, "p value is not prime\n");
129 BIO_puts(out, "p value is not a safe prime\n");
|
| /external/openssl/crypto/ec/ |
| ec_cvt.c | 84 * prime method was observed to deliver better performance even
100 * prime method...
|
| ec_err.c | 243 {ERR_REASON(EC_R_NOT_A_NIST_PRIME) ,"not a NIST prime"},
244 {ERR_REASON(EC_R_NOT_A_SUPPORTED_NIST_PRIME),"not a supported NIST prime"},
|
| ec_curve.c | 85 /* the nist prime curves */
226 /* the x9.62 prime curves (minus the nist prime curves) */
405 /* the secg prime curves (minus the nist and x9.62 prime curves) */
[all...] |
| /external/openssl/crypto/rsa/ |
| rsa_err.c | 178 {ERR_REASON(RSA_R_P_NOT_PRIME) ,"p not prime"},
179 {ERR_REASON(RSA_R_Q_NOT_PRIME) ,"q not prime"},
|
| /external/dropbear/libtommath/demo/ |
| demo.c | 178 printf("Testing (not safe-prime): %9d bits \r", ix);
189 printf("Prime is %d not %d bits!!!\n", mp_count_bits(&a), ix);
195 printf("Testing ( safe-prime): %9d bits \r", ix);
207 printf("Prime is %d not %d bits!!!\n", mp_count_bits(&a), ix);
210 /* let's see if it's really a safe prime */
215 printf("sub is not prime!\n");
|
| /sdk/sdk_common/src/com/android/ide/common/xml/ |
| ManifestData.java | 316 final int prime = 31; local
318 result = prime * result + ((mAnyDensity == null) ? 0 : mAnyDensity.hashCode());
319 result = prime * result + ((mLargeScreens == null) ? 0 : mLargeScreens.hashCode());
320 result = prime * result + ((mNormalScreens == null) ? 0 : mNormalScreens.hashCode());
321 result = prime * result + ((mResizeable == null) ? 0 : mResizeable.hashCode());
322 result = prime * result + ((mSmallScreens == null) ? 0 : mSmallScreens.hashCode());
|
| /libcore/luni/src/test/java/tests/api/java/math/ |
| BigIntegerTest.java | 251 assertTrue("false negative on prime number <1000", BigInteger
339 // BigInteger prime = a.nextProbablePrime();
340 // System.out.print("Next Probable Prime is ");
341 // System.out.println(prime);
364 // BigInteger prime = a.nextProbablePrime();
365 // System.out.print("Next Probable Prime is ");
366 // System.out.println(prime);
371 // BigInteger prime = a.nextProbablePrime();
372 // System.out.print("Next Probable Prime is ");
373 // System.out.println(prime);
[all...] |
| /external/ipsec-tools/src/racoon/ |
| oakley.c | 111 a.prime = vdup(&buf); \
171 if (dhgrp->prime)
172 vfree(dhgrp->prime);
185 * length of the prime modulus over which the exponentiation was
189 oakley_check_dh_pub(prime, pub0)
190 vchar_t *prime, **pub0;
195 if (prime->l == pub->l)
198 if (prime->l < pub->l) {
205 /* prime->l > pub->l */
206 tmp = vmalloc(prime->l)
[all...] |
| /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/internal/repository/packages/ |
| ExtraPackage.java | 708 final int prime = 31; local
710 result = prime * result + mMinApiLevel;
711 result = prime * result + ((mPath == null) ? 0 : mPath.hashCode());
712 result = prime * result + Arrays.hashCode(mProjectFiles);
713 result = prime * result + ((mVendorDisplay == null) ? 0 : mVendorDisplay.hashCode());
|
| SystemImagePackage.java | 327 final int prime = 31; local
329 result = prime * result + ((mAbi == null) ? 0 : mAbi.hashCode());
330 result = prime * result + ((mVersion == null) ? 0 : mVersion.hashCode());
|
| /external/dropbear/libtommath/ |
| bn.tex | [all...] |
| changes.txt | 97 -- Added mp_prime_random_ex() which is a more versatile prime generator accurate to
192 will find the next prime congruent to 3 mod 4. The default [bbs_style==0] will
244 -- mp_prime_is_prime will now return true if the input is one of the primes in the prime table
279 v0.15 -- Added series of prime testing routines to lib
332 -- Added a Mersenne prime finder demo in ./etc/mersenne.c
340 -- add etc/pprime.c program which makes numbers which are provably prime.
|
| /external/icu4c/data/unidata/ |
| ScriptExtensions.txt | 123 301D ; Bopo Hang Hani Hira Kana # Ps REVERSED DOUBLE PRIME QUOTATION MARK
124 301E..301F ; Bopo Hang Hani Hira Kana # Pe [2] DOUBLE PRIME QUOTATION MARK..LOW DOUBLE PRIME QUOTATION MARK
|
| /external/wpa_supplicant_6/wpa_supplicant/src/crypto/ |
| dh_groups.c | 26 * Prime: 2^768 - 2 ^704 - 1 + 2^64 * { [2^638 pi] + 149686 }
46 * Prime: 2^1024 - 2^960 - 1 + 2^64 * { [2^894 pi] + 129093 }
72 * Prime: 2^1536 - 2^1472 - 1 + 2^64 * { [2^1406 pi] + 741804 }
106 * Prime: 2^2048 - 2^1984 - 1 + 2^64 * { [2^1918 pi] + 124476 }
146 * Prime: 2^3072 - 2^3008 - 1 + 2^64 * { [2^2942 pi] + 1690314 }
202 * Prime: 2^4096 - 2^4032 - 1 + 2^64 * { [2^3966 pi] + 240904 }
274 * Prime: 2^6144 - 2^6080 - 1 + 2^64 * { [2^6014 pi] + 929484 }
378 * Prime: 2^8192 - 2^8128 - 1 + 2^64 * { [2^8062 pi] + 4743158 }
573 if (os_memcmp(wpabuf_head(*priv), dh->prime, dh->prime_len) > 0) {
574 /* Make sure private value is smaller than prime */
[all...] |
| /external/wpa_supplicant_8/src/crypto/ |
| dh_groups.c | 21 * Prime: 2^768 - 2 ^704 - 1 + 2^64 * { [2^638 pi] + 149686 }
41 * Prime: 2^1024 - 2^960 - 1 + 2^64 * { [2^894 pi] + 129093 }
67 * Prime: 2^1536 - 2^1472 - 1 + 2^64 * { [2^1406 pi] + 741804 }
101 * Prime: 2^2048 - 2^1984 - 1 + 2^64 * { [2^1918 pi] + 124476 }
141 * Prime: 2^3072 - 2^3008 - 1 + 2^64 * { [2^2942 pi] + 1690314 }
197 * Prime: 2^4096 - 2^4032 - 1 + 2^64 * { [2^3966 pi] + 240904 }
269 * Prime: 2^6144 - 2^6080 - 1 + 2^64 * { [2^6014 pi] + 929484 }
373 * Prime: 2^8192 - 2^8128 - 1 + 2^64 * { [2^8062 pi] + 4743158 }
569 if (os_memcmp(wpabuf_head(*priv), dh->prime, dh->prime_len) > 0) {
570 /* Make sure private value is smaller than prime */
[all...] |
| /external/wpa_supplicant_8/src/tls/ |
| tlsv1_cred.c | 363 * prime INTEGER, -- p
379 /* prime INTEGER */
390 wpa_hexdump(MSG_MSGDUMP, "DH: prime (p)", hdr.payload, hdr.length);
|
| /packages/apps/Bluetooth/res/values-ro/ |
| strings.xml | 41 <string name="incoming_file_confirm_Notification_title" msgid="2958227698135117210">"Distribuire prin Bluetooth: se prime?te fi?ierul"</string>
44 <string name="notification_receiving" msgid="4674648179652543984">"Distribuire prin Bluetooth: se prime?te <xliff:g id="FILE">%1$s</xliff:g>"</string>
56 <string name="download_line5" msgid="3069560415845295386">"Se prime?te fi?ierul..."</string>
|
| /tools/motodev/src/plugins/certmanager/src/com/motorolamobility/studio/android/certmanager/ui/model/ |
| EntryNode.java | 293 final int prime = 31;
local
295 result = (prime * result) + ((alias == null) ? 0 : alias.hashCode());
297 (prime * result) + ((getKeyStoreNode() == null) ? 0 : getKeyStoreNode().hashCode());
|
| /external/libvpx/examples/includes/geshi/geshi/ |
| d.php | 88 "phi|chi|psi|omega|thetasym|upsih|piv|bull|hellip|prime|Prime|".
|
| /external/openssl/apps/ |
| dh.c | 269 printf("p value is not prime\n");
271 printf("p value is not a safe prime\n");
|
| /external/openssl/crypto/bn/ |
| bn_const.c | 8 * The prime is: 2^768 - 2 ^704 - 1 + 2^64 * { [2^638 pi] + 149686 }
31 * The prime is: 2^1024 - 2^960 - 1 + 2^64 * { [2^894 pi] + 129093 }.
57 * The prime is: 2^1536 - 2^1472 - 1 + 2^64 * { [2^1406 pi] + 741804 }
88 * The prime is: 2^2048 - 2^1984 - 1 + 2^64 * { [2^1918 pi] + 124476 }
124 * The prime is: 2^3072 - 2^3008 - 1 + 2^64 * { [2^2942 pi] + 1690314 }
170 * The prime is: 2^4096 - 2^4032 - 1 + 2^64 * { [2^3966 pi] + 240904 }
227 * The prime is: 2^6144 - 2^6080 - 1 + 2^64 * { [2^6014 pi] + 929484 }
305 * The prime is: 2^8192 - 2^8128 - 1 + 2^64 * { [2^8062 pi] + 4743158 }
|
| expspeed.c | 76 #define P_MOD_64 9 /* least significant 6 bits for prime to be used for BN_sqrt timings */
322 "2*sqrt [prime == %d (mod 64)] %4d %4d mod %4d"
|
