Searched refs:prime (Results 1 - 25 of 45) sorted by relevance

12

/freebsd-11-stable/usr.bin/primes/
H A Dpr_tbl.c42 * prime - prime table
46 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
56 const ubig prime[] = { variable
547 /* pr_limit - largest prime in the prime table */
548 const ubig *const pr_limit = &prime[(sizeof(prime)/sizeof(prime[0]))-1];
H A Dprimes.h41 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
54 * prime[i] is the (i-1)th prime.
59 extern const ubig prime[];
60 extern const ubig *const pr_limit; /* largest prime in the prime array */
H A Dprimes.c52 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
82 * sieve, table[i] == 1 if and only if 2*i-1 is prime.
208 const ubig *p; /* prime table pointer */
209 ubig fact_lim; /* highest prime for current block */
242 for (p = &prime[0], factor = prime[0];
286 factor = 17; /* 17 is first prime to use */
287 p = &prime[7]; /* 19 is next prime, pi(19)=7 */
/freebsd-11-stable/contrib/bmake/unit-tests/
H A Dcond1.exp3 2 is prime
13 1 is not prime
14 2 is prime
15 3 is prime
16 4 is not prime
17 5 is prime
H A Dcond1.mk104 @echo "$n is $X prime"
107 @echo "${NUMBERS:@n@$n is ${("${PRIMES:M$n}" == ""):?not:} prime${.newline}@}"
/freebsd-11-stable/contrib/wpa/src/common/
H A Ddragonfly.c21 * purposes: FFC groups whose prime is >= 3072 bits and ECC groups
22 * defined over a prime field whose prime is >= 256 bits. Furthermore,
26 * timing information due to the prime not being close to a power of
44 /* FFC groups that have prime that is close to a power of two */
53 int dragonfly_get_random_qr_qnr(const struct crypto_bignum *prime, argument
64 if (!tmp || crypto_bignum_rand(tmp, prime) < 0) {
69 res = crypto_bignum_legendre(tmp, prime);
88 dragonfly_get_rand_1_to_p_1(const struct crypto_bignum *prime) argument
96 crypto_bignum_sub(prime, on
116 const struct crypto_bignum *prime; local
[all...]
H A Ddragonfly.h20 int dragonfly_get_random_qr_qnr(const struct crypto_bignum *prime,
H A Dsae.c47 tmp->prime = crypto_ec_get_prime(tmp->ec);
65 tmp->prime_buf = crypto_bignum_init_set(tmp->dh->prime,
71 tmp->prime = tmp->prime_buf;
141 const u8 *prime, const u8 *qr, const u8 *qnr,
155 prime, sae->tmp->prime_len, pwd_value, bits) < 0)
162 cmp_prime = const_time_memcmp(pwd_value, prime, sae->tmp->prime_len);
164 * being smaller than prime. */
203 sae->tmp->dh->prime, sae->tmp->prime_len, pwd_value,
210 res = const_time_memcmp(pwd_value, sae->tmp->dh->prime,
244 crypto_bignum_sub(sae->tmp->prime,
140 sae_test_pwd_seed_ecc(struct sae_data *sae, const u8 *pwd_seed, const u8 *prime, const u8 *qr, const u8 *qnr, u8 *pwd_value) argument
287 u8 prime[SAE_MAX_ECC_PRIME_LEN]; local
960 u8 prime[SAE_MAX_ECC_PRIME_LEN]; local
[all...]
H A Dsae.h38 const struct crypto_bignum *prime; member in struct:sae_temporary_data
/freebsd-11-stable/contrib/wpa/src/crypto/
H A Dcrypto_internal-modexp.c16 int crypto_dh_init(u8 generator, const u8 *prime, size_t prime_len, u8 *privkey, argument
23 if (os_memcmp(privkey, prime, prime_len) > 0) {
24 /* Make sure private value is smaller than prime */
29 if (crypto_mod_exp(&generator, 1, privkey, prime_len, prime, prime_len,
42 int crypto_dh_derive_secret(u8 generator, const u8 *prime, size_t prime_len, argument
53 os_memcmp(pubkey, prime, prime_len) >= 0))
70 bignum_set_unsigned_bin(p, prime, prime_len) < 0 ||
82 prime, prime_len, secret, len);
H A Ddh_groups.h16 const u8 *prime; member in struct:dh_group
H A Dcrypto_nettle.c307 int crypto_dh_init(u8 generator, const u8 *prime, size_t prime_len, u8 *privkey, argument
314 if (os_memcmp(privkey, prime, prime_len) > 0) {
315 /* Make sure private value is smaller than prime */
320 if (crypto_mod_exp(&generator, 1, privkey, prime_len, prime, prime_len,
333 int crypto_dh_derive_secret(u8 generator, const u8 *prime, size_t prime_len, argument
344 os_memcmp(pubkey, prime, prime_len) >= 0))
358 mpz_import(p, prime_len, 1, 1, 1, 0, prime);
368 prime, prime_len, secret, len);
H A Dcrypto_wolfssl.c778 int crypto_dh_init(u8 generator, const u8 *prime, size_t prime_len, u8 *privkey, argument
799 if (wc_DhSetKey(dh, prime, prime_len, &generator, 1) != 0)
828 int crypto_dh_derive_secret(u8 generator, const u8 *prime, size_t prime_len, argument
843 if (wc_DhSetKey(dh, prime, prime_len, &generator, 1) != 0)
1260 mp_int prime; member in struct:crypto_ec
1315 mp_init(&e->prime) != MP_OKAY ||
1320 mp_read_radix(&e->prime, e->key.dp->prime, 16) != MP_OKAY ||
1322 mp_montgomery_setup(&e->prime, &e->mont_b) != MP_OKAY)
1342 mp_clear(&e->prime);
[all...]
H A Dcrypto_gnutls.c286 int crypto_dh_init(u8 generator, const u8 *prime, size_t prime_len, u8 *privkey, argument
293 if (os_memcmp(privkey, prime, prime_len) > 0) {
294 /* Make sure private value is smaller than prime */
299 if (crypto_mod_exp(&generator, 1, privkey, prime_len, prime, prime_len,
312 int crypto_dh_derive_secret(u8 generator, const u8 *prime, size_t prime_len, argument
323 os_memcmp(pubkey, prime, prime_len) >= 0))
338 gcry_mpi_scan(&p, GCRYMPI_FMT_USG, prime, prime_len,
354 prime, prime_len, secret, len);
/freebsd-11-stable/crypto/openssl/engines/vendor_defns/
H A Datalla.h24 Item prime[2]; member in struct:RSAPrivateKeyStr
/freebsd-11-stable/contrib/unbound/util/
H A Dfptr_wlist.h235 uint16_t qflags, int prime, int valrec, struct module_qstate** newq));
244 struct query_info* qinfo, uint16_t qflags, int prime, int valrec,
262 uint16_t flags, int prime, int valrec));
H A Dmodule.h397 * @param prime: if it is a (stub) priming query.
404 struct query_info* qinfo, uint16_t qflags, int prime,
426 * @param prime: if it is a (stub) priming query.
434 struct query_info* qinfo, uint16_t qflags, int prime,
453 * @param prime: if dependency is a priming query or not.
461 struct query_info* qinfo, uint16_t flags, int prime,
505 * expire. The hints are always used to "prime" the cache. Note
/freebsd-11-stable/crypto/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...]
/freebsd-11-stable/contrib/wpa/src/eap_common/
H A Deap_pwd_common.c138 const struct crypto_bignum *prime; local
148 prime = crypto_ec_get_prime(grp->group);
151 if (crypto_bignum_to_bin(prime, prime_bin, sizeof(prime_bin),
167 if (dragonfly_get_random_qr_qnr(prime, &qr, &qnr) < 0 ||
186 * compute counter-mode password value and stretch to prime
212 * being smaller than prime. */
248 * prime) handles this in constant time.
366 static int eap_pwd_element_coord_ok(const struct crypto_bignum *prime, argument
374 crypto_bignum_cmp(val, prime) >= 0)
385 const struct crypto_bignum *prime; local
[all...]
/freebsd-11-stable/contrib/unbound/services/
H A Dmesh.h377 * @param prime: if it is a (stub) priming query.
384 uint16_t qflags, int prime, int valrec, struct module_qstate** newq);
404 * @param prime: if it is a (stub) priming query.
412 uint16_t qflags, int prime, int valrec, struct module_qstate** newq,
461 * @param prime: if true, it is a priming query, set is_priming on mesh state.
468 uint16_t qflags, int prime, int valrec);
507 * @param prime: if it is a priming query.
513 uint16_t qflags, int prime, int valrec);
601 * @param prime: if dependency is a priming query or not.
609 uint16_t flags, int prime, in
[all...]
/freebsd-11-stable/secure/usr.bin/openssl/
H A DMakefile18 prime.c rand.c req.c rsa.c rsautl.c s_cb.c s_client.c s_server.c \
/freebsd-11-stable/gnu/usr.bin/groff/src/libs/libgroff/
H A DMakefile9 maxfilename.cpp mksdir.cpp nametoindex.cpp new.cpp paper.cpp prime.cpp\
/freebsd-11-stable/contrib/groff/src/libs/libgroff/
H A DMakefile.sub35 prime.$(OBJEXT) \
80 $(srcdir)/prime.cpp \
/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dhashtab.c126 hashval_t prime; member in struct:prime_ent
128 hashval_t inv_m2; /* inverse of prime-2 */
167 nearest prime number which is greater than N, and near a power of two. */
178 if (n > prime_tab[mid].prime)
185 if (n > prime_tab[low].prime)
187 fprintf (stderr, "Cannot find prime bigger than %lu\n", n);
270 return htab_mod_1 (hash, p->prime, p->inv, p->shift);
279 return 1 + htab_mod_1 (hash, p->prime - 2, p->inv_m2, p->shift);
295 size = prime_tab[size_prime_index].prime;
330 size = prime_tab[size_prime_index].prime;
[all...]

Completed in 236 milliseconds

12