Searched refs:prime (Results 26 - 50 of 113) sorted by relevance

12345

/external/wpa_supplicant_8/src/eap_peer/
H A Deap_pwd.c169 BN_clear_free(data->grp->prime);
336 BN_num_bits(data->grp->prime));
372 prime_len = BN_num_bytes(data->grp->prime);
442 BN_bin2bn(ptr, BN_num_bytes(data->grp->prime), x);
443 ptr += BN_num_bytes(data->grp->prime);
444 BN_bin2bn(ptr, BN_num_bytes(data->grp->prime), y);
445 ptr += BN_num_bytes(data->grp->prime);
520 ((element = os_malloc(BN_num_bytes(data->grp->prime) * 2)) ==
528 * sufficiently smaller than the prime or order might need pre-pending
532 os_memset(element, 0, BN_num_bytes(data->grp->prime) *
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/eap_peer/
H A Deap_pwd.c169 BN_clear_free(data->grp->prime);
336 BN_num_bits(data->grp->prime));
372 prime_len = BN_num_bytes(data->grp->prime);
442 BN_bin2bn(ptr, BN_num_bytes(data->grp->prime), x);
443 ptr += BN_num_bytes(data->grp->prime);
444 BN_bin2bn(ptr, BN_num_bytes(data->grp->prime), y);
445 ptr += BN_num_bytes(data->grp->prime);
520 ((element = os_malloc(BN_num_bytes(data->grp->prime) * 2)) ==
528 * sufficiently smaller than the prime or order might need pre-pending
532 os_memset(element, 0, BN_num_bytes(data->grp->prime) *
[all...]
/external/kernel-headers/original/uapi/linux/
H A Dkeyctl.h67 __s32 prime; member in struct:keyctl_dh_params
/external/wpa_supplicant_8/hostapd/src/common/
H A Dsae.c34 tmp->prime = crypto_ec_get_prime(tmp->ec);
49 tmp->prime_buf = crypto_bignum_init_set(tmp->dh->prime,
55 tmp->prime = tmp->prime_buf;
173 get_rand_1_to_p_1(const u8 *prime, size_t prime_len, size_t prime_bits, argument
184 if (os_memcmp(tmp, prime, prime_len) >= 0)
203 const u8 *prime, size_t bits,
220 r = get_rand_1_to_p_1(prime, sae->tmp->prime_len, bits, &r_odd);
226 crypto_bignum_mulmod(y_sqr, r, sae->tmp->prime, num) < 0 ||
227 crypto_bignum_mulmod(num, r, sae->tmp->prime, num) < 0)
235 if (crypto_bignum_mulmod(num, qr, sae->tmp->prime, nu
202 is_quadratic_residue_blind(struct sae_data *sae, const u8 *prime, size_t bits, const struct crypto_bignum *qr, const struct crypto_bignum *qnr, const struct crypto_bignum *y_sqr) argument
261 sae_test_pwd_seed_ecc(struct sae_data *sae, const u8 *pwd_seed, const u8 *prime, const struct crypto_bignum *qr, const struct crypto_bignum *qnr, struct crypto_bignum **ret_x_cand) argument
382 get_random_qr_qnr(const u8 *prime, size_t prime_len, const struct crypto_bignum *prime_bn, size_t prime_bits, struct crypto_bignum **qr, struct crypto_bignum **qnr) argument
429 u8 prime[SAE_MAX_ECC_PRIME_LEN]; local
997 u8 prime[SAE_MAX_ECC_PRIME_LEN]; local
[all...]
/external/wpa_supplicant_8/src/common/
H A Dsae.c34 tmp->prime = crypto_ec_get_prime(tmp->ec);
49 tmp->prime_buf = crypto_bignum_init_set(tmp->dh->prime,
55 tmp->prime = tmp->prime_buf;
173 get_rand_1_to_p_1(const u8 *prime, size_t prime_len, size_t prime_bits, argument
184 if (os_memcmp(tmp, prime, prime_len) >= 0)
203 const u8 *prime, size_t bits,
220 r = get_rand_1_to_p_1(prime, sae->tmp->prime_len, bits, &r_odd);
226 crypto_bignum_mulmod(y_sqr, r, sae->tmp->prime, num) < 0 ||
227 crypto_bignum_mulmod(num, r, sae->tmp->prime, num) < 0)
235 if (crypto_bignum_mulmod(num, qr, sae->tmp->prime, nu
202 is_quadratic_residue_blind(struct sae_data *sae, const u8 *prime, size_t bits, const struct crypto_bignum *qr, const struct crypto_bignum *qnr, const struct crypto_bignum *y_sqr) argument
261 sae_test_pwd_seed_ecc(struct sae_data *sae, const u8 *pwd_seed, const u8 *prime, const struct crypto_bignum *qr, const struct crypto_bignum *qnr, struct crypto_bignum **ret_x_cand) argument
382 get_random_qr_qnr(const u8 *prime, size_t prime_len, const struct crypto_bignum *prime_bn, size_t prime_bits, struct crypto_bignum **qr, struct crypto_bignum **qnr) argument
429 u8 prime[SAE_MAX_ECC_PRIME_LEN]; local
997 u8 prime[SAE_MAX_ECC_PRIME_LEN]; local
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/common/
H A Dsae.c34 tmp->prime = crypto_ec_get_prime(tmp->ec);
49 tmp->prime_buf = crypto_bignum_init_set(tmp->dh->prime,
55 tmp->prime = tmp->prime_buf;
173 get_rand_1_to_p_1(const u8 *prime, size_t prime_len, size_t prime_bits, argument
184 if (os_memcmp(tmp, prime, prime_len) >= 0)
203 const u8 *prime, size_t bits,
220 r = get_rand_1_to_p_1(prime, sae->tmp->prime_len, bits, &r_odd);
226 crypto_bignum_mulmod(y_sqr, r, sae->tmp->prime, num) < 0 ||
227 crypto_bignum_mulmod(num, r, sae->tmp->prime, num) < 0)
235 if (crypto_bignum_mulmod(num, qr, sae->tmp->prime, nu
202 is_quadratic_residue_blind(struct sae_data *sae, const u8 *prime, size_t bits, const struct crypto_bignum *qr, const struct crypto_bignum *qnr, const struct crypto_bignum *y_sqr) argument
261 sae_test_pwd_seed_ecc(struct sae_data *sae, const u8 *pwd_seed, const u8 *prime, const struct crypto_bignum *qr, const struct crypto_bignum *qnr, struct crypto_bignum **ret_x_cand) argument
382 get_random_qr_qnr(const u8 *prime, size_t prime_len, const struct crypto_bignum *prime_bn, size_t prime_bits, struct crypto_bignum **qr, struct crypto_bignum **qnr) argument
429 u8 prime[SAE_MAX_ECC_PRIME_LEN]; local
997 u8 prime[SAE_MAX_ECC_PRIME_LEN]; local
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/random/
H A DAbstractRandomGenerator.java72 // the following number is the largest prime that fits in 32 bits (it is 2^32 - 5)
73 final long prime = 4294967291l;
77 combined = combined * prime + s;
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/moment/
H A DVectorialMean.java84 final int prime = 31;
86 result = prime * result + Arrays.hashCode(means);
/external/snakeyaml/src/test/java/examples/
H A DCustomJavaObjectWithBinaryStringTest.java44 final int prime = 31;
46 result = prime * result + ((data == null) ? 0 : data.hashCode());
/external/libmojo/mojo/public/java/bindings/src/org/chromium/mojo/bindings/
H A DMessageHeader.java180 final int prime = 31;
182 result = prime * result + ((mDataHeader == null) ? 0 : mDataHeader.hashCode());
183 result = prime * result + mFlags;
184 result = prime * result + (int) (mRequestId ^ (mRequestId >>> 32));
185 result = prime * result + mType;
/external/testng/src/main/java/org/testng/xml/
H A DXmlInclude.java84 final int prime = 31;
86 result = prime * result + m_index;
87 result = prime * result
89 result = prime * result + (m_parameters == null ? 0 : m_parameters.hashCode());
90 result = prime * result + ((m_name == null) ? 0 : m_name.hashCode());
H A DXmlMethodSelector.java121 final int prime = 31;
123 result = prime * result
125 result = prime * result
127 result = prime * result
129 result = prime * result + m_priority;
H A DXmlPackage.java133 final int prime = 31;
135 result = prime * result + ((m_exclude == null) ? 0 : m_exclude.hashCode());
136 result = prime * result + ((m_include == null) ? 0 : m_include.hashCode());
137 result = prime * result + ((m_name == null) ? 0 : m_name.hashCode());
138 result = prime * result
H A DXmlClass.java233 final int prime = 31;
235 result = prime * result + ((m_class == null) ? 0 : m_class.hashCode());
236 result = prime * result + (m_loadClasses ? 1 : 0);
237 result = prime * result
239 result = prime * result
241 result = prime * result + m_index;
242 result = prime * result + ((m_name == null) ? 0 : m_name.hashCode());
H A DXmlSuite.java752 final int prime = 31;
754 // result = prime * result
756 result = prime
760 result = prime * result + m_dataProviderThreadCount;
761 result = prime * result
763 result = prime * result
765 result = prime * result
767 result = prime * result
770 result = prime * result
772 result = prime * resul
[all...]
H A DXmlTest.java732 final int prime = 31;
734 result = prime * result
736 result = prime
740 result = prime * result
742 result = prime * result + ((m_isJUnit == null) ? 0 : m_isJUnit.hashCode());
743 result = prime * result
745 result = prime * result
747 result = prime * result + ((m_name == null) ? 0 : m_name.hashCode());
748 result = prime * result
750 result = prime * resul
[all...]
/external/v8/src/inspector/
H A Dv8-debugger-script.cc27 static uint64_t prime[] = {0x3FB75161, 0xAB1F4E4F, 0x82675BC5, 0xCD924D35, local
46 hashes[current] = (hashes[current] + zi[current] * xi) % prime[current];
47 zi[current] = (zi[current] * random[current]) % prime[current];
57 hashes[current] = (hashes[current] + zi[current] * xi) % prime[current];
58 zi[current] = (zi[current] * random[current]) % prime[current];
63 hashes[i] = (hashes[i] + zi[i] * (prime[i] - 1)) % prime[i];
/external/libvorbis/lib/
H A Dlpc.c133 void vorbis_lpc_predict(float *coeff,float *prime,int m, argument
137 prime[0...m-1] initial values (allocated size of n+m-1)
144 if(!prime)
149 work[i]=prime[i];
/external/tpm2/
H A DMathFunctions_fp.h20 LIB_EXPORT BOOL _math__IsPrime(const UINT32 prime);
/external/openssh/
H A Dkexgex.c53 const BIGNUM *prime,
80 (r = sshbuf_put_bignum2(b, prime)) != 0 ||
45 kexgex_hash( int hash_alg, const char *client_version_string, const char *server_version_string, const u_char *ckexinit, size_t ckexinitlen, const u_char *skexinit, size_t skexinitlen, const u_char *serverhostkeyblob, size_t sbloblen, int min, int wantbits, int max, const BIGNUM *prime, const BIGNUM *gen, const BIGNUM *client_dh_pub, const BIGNUM *server_dh_pub, const BIGNUM *shared_secret, u_char *hash, size_t *hashlen) argument
H A Ddh.c49 char *strsize, *gen, *prime; local
69 /* Ensure this is a safe prime */
78 /* Ensure prime has been tested and is not composite */
97 error("moduli:%d: invalid prime length", linenum);
105 prime = strsep(&cp, " "); /* prime */
106 if (cp != NULL || *prime == '\0') {
121 if (BN_hex2bn(&dhg->p, prime) == 0) {
122 error("moduli:%d: could not parse prime value", linenum);
126 error("moduli:%d: prime ha
[all...]
/external/snakeyaml/src/test/java8/org/yaml/snakeyaml/issues/issue310/
H A DOptionalTest.java56 final int prime = 31;
58 result = prime * result
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowPendingIntent.java110 final int prime = 31;
112 result = prime * result + (isActivityIntent ? 1231 : 1237);
113 result = prime * result + (isBroadcastIntent ? 1231 : 1237);
114 result = prime * result + (isServiceIntent ? 1231 : 1237);
115 result = prime * result + requestCode;
116 result = prime * result + ((savedIntent == null) ? 0 : savedIntent.hashCode());
/external/boringssl/src/crypto/rsa/
H A Drsa_impl.c738 /* multi-prime RSA. */
743 if (!BN_mod(r1, I, ap->prime, ctx)) {
747 if (!BN_MONT_CTX_set_locked(&ap->mont, &rsa->lock, ap->prime, ctx) ||
748 !BN_mod_exp_mont_consttime(m1, r1, ap->exp, ap->prime, ctx, ap->mont)) {
754 !BN_mod(m1, m1, ap->prime, ctx) ||
755 (BN_is_negative(m1) && !BN_add(m1, m1, ap->prime)) ||
808 ap->prime = BN_new();
812 if (ap->prime == NULL ||
873 * continually regenerating the same prime values. Check for
910 if (!BN_generate_prime_ex(ap->prime, prime_bit
[all...]
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue318/
H A DContextClassLoaderTest.java52 final int prime = 31;
54 result = prime * result + value;

Completed in 672 milliseconds

12345