| /packages/inputmethods/LatinIME/java/res/xml/ |
| rowkeys_symbols_shift2.xml | 33 U+2032: "?" PRIME
34 U+2033: "?" DOUBLE PRIME -->
|
| /packages/inputmethods/LatinIME/java/res/xml-sw600dp/ |
| rowkeys_symbols_shift2.xml | 40 U+2032: "?" PRIME
41 U+2033: "?" DOUBLE PRIME -->
|
| /libcore/luni/src/main/java/java/math/ |
| Primality.java | 30 /** All prime numbers with bit length lesser than 10 bits. */
46 /** All {@code BigInteger} prime numbers with bit length lesser than 10 bits. */
64 // * index {@code 11} exists {@code 7} consecutive {@code 6}-bit prime
89 int gapSize = 1024; // for searching of the next probable prime number
93 // If n < "last prime of table" searches next prime in the table
|
| /external/openssh/ |
| moduli.c | 34 * that is, where q = (p-1)/2 is also prime.
74 * Prime sieving defines
98 * Constant: when used with 32-bit integers, the largest sieve prime
118 * Prime testing defines
256 * Set power to the length in bits of the prime to be generated.
257 * This is changed to 1 less than the desired safe prime moduli p.
272 * guaranteed) of catching at least one safe prime.
347 /* The next tiny prime */
358 * Start the small block search at the next possible prime. To avoid
368 /* The next tiny prime */
[all...] |
| dh.c | 47 char *strsize, *gen, *prime; local
66 /* Ensure this is a safe prime */
73 /* Ensure prime has been tested and is not composite */
94 prime = strsep(&cp, " "); /* prime */
95 if (cp != NULL || *prime == '\0')
105 if (BN_hex2bn(&dhg->p, prime) == 0)
120 error("Bad prime description in line %d", linenum);
|
| /external/openssl/crypto/bn/ |
| bn_prime.c | 205 /* for "safe prime" generation,
206 * check that (p-1)/2 is prime.
207 * Since a prime is odd, We just
223 /* We have a safe prime test pass */
226 /* we have a prime :-) */
261 /* a is even => a is prime if and only if a == 2 */
358 return 0; /* probably prime */
360 return 0; /* w == -1 (mod a), 'a' is probably prime */
369 return 0; /* w == -1 (mod a), 'a' is probably prime */
372 * and it is neither -1 nor +1 -- so 'a' cannot be prime */
[all...] |
| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/spec/ |
| ECFieldFpTest.java | 51 * using valid <code>p</code> (odd prime)
61 * using valid <code>p</code> (odd but not prime)
142 * Assertion: returns field size in bits which is prime size
151 * Assertion: returns prime
190 * Assertion: true if prime values match.
|
| RSAPrivateCrtKeySpecTest.java | 117 * Assertion: returns prime exponent P
134 * Assertion: returns prime exponent Q
151 * Assertion: returns prime P
168 * Assertion: returns prime Q
|
| /libcore/luni/src/test/java/tests/security/spec/ |
| ECFieldFpTest.java | 44 * using valid <code>p</code> (odd prime)
54 * using valid <code>p</code> (odd but not prime)
135 * Assertion: returns field size in bits which is prime size
144 * Assertion: returns prime
183 * Assertion: true if prime values match.
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x9/ |
| X9FieldID.java | 25 * Constructor for elliptic curves over prime fields
27 * @param primeP The prime <code>p</code> defining the prime field.
|
| X9FieldElement.java | 48 * <li> if <i>q</i> is an odd prime then the field element is
|
| /external/guava/guava/src/com/google/common/eventbus/ |
| EventHandler.java | 86 final int PRIME = 31;
87 return (PRIME + method.hashCode()) * PRIME + target.hashCode();
|
| /sdk/common/src/com/android/utils/ |
| Pair.java | 78 final int prime = 31; local
80 result = prime * result + ((mFirst == null) ? 0 : mFirst.hashCode());
81 result = prime * result + ((mSecond == null) ? 0 : mSecond.hashCode());
|
| /sdk/layoutlib_api/src/com/android/ide/common/rendering/api/ |
| ResourceValue.java | 90 final int prime = 31; local
92 result = prime * result + ((mType == null) ? 0 : mType.hashCode());
93 result = prime * result + ((mValue == null) ? 0 : mValue.hashCode());
|
| DensityBasedResourceValue.java | 62 final int prime = 31; local
64 result = prime * result + ((mDensity == null) ? 0 : mDensity.hashCode());
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| DHParametersHelper.java | 21 * Finds a pair of prime BigInteger's {p, q: p = 2q + 1}
62 * p and q must be s.t. p = 2*q + 1, where p and q are prime (see generateSafePrimes)
|
| /external/dropbear/libtommath/ |
| bn_mp_prime_miller_rabin.c | 21 * Sets result to 0 if definitely composite or 1 if probably prime.
92 /* probably prime now */
|
| tommath.h | 151 #define LTM_PRIME_BBS 0x0001 /* BBS style prime */
152 #define LTM_PRIME_SAFE 0x0002 /* Safe prime (p-1)/2 == prime */
392 /* computes the jacobi c = (a | n) (or Legendre if b is prime) */
462 * Sets result to 0 if composite or 1 if probable prime
467 * Sets result to 0 if composite or 1 if probable prime
477 * t prime bases. Also performs an initial sieve of trial
478 * division. Determines if "a" is prime with probability
481 * Sets result to 1 if probably prime, 0 otherwise
485 /* finds the next prime after the number "a" using "t" trial
[all...] |
| /libcore/luni/src/main/java/java/security/interfaces/ |
| DSAKeyPairGenerator.java | 29 * Initializes this generator with the prime ({@code p}), subprime ({@code
48 * generate new prime ({@code p}), subprime ({@code q}), and base ({@code g})
|
| /libcore/luni/src/main/java/libcore/util/ |
| ZoneInfo.java | 243 final int prime = 31; local
245 result = prime * result + getID().hashCode();
246 result = prime * result + Arrays.hashCode(mOffsets);
247 result = prime * result + Arrays.hashCode(mIsDsts);
248 result = prime * result + mRawOffset;
249 result = prime * result + Arrays.hashCode(mTransitions);
250 result = prime * result + Arrays.hashCode(mTypes);
251 result = prime * result + (mUseDst ? 1231 : 1237);
|
| /sdk/sdkmanager/libs/sdkuilib/src/com/android/sdkuilib/internal/repository/core/ |
| PkgCategory.java | 67 final int prime = 31; local
69 result = prime * result + ((mKey == null) ? 0 : mKey.hashCode());
|
| /tools/motodev/src/plugins/preflighting.core/src/com/motorolamobility/preflighting/core/permissionfeature/ |
| Feature.java | 76 final int prime = 31;
local
78 result = (prime * result) + ((id == null) ? 0 : id.hashCode());
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/digests/ |
| SHA384Digest.java | 76 * of the 9th through 16th prime numbers
|
| SHA512Digest.java | 77 * of the first eight prime numbers
|
| /external/libvorbis/lib/ |
| lpc.c | 133 void vorbis_lpc_predict(float *coeff,float *prime,int m,
137 prime[0...m-1] initial values (allocated size of n+m-1)
144 if(!prime)
149 work[i]=prime[i];
|
