Searched refs:qbits (Results 1 - 6 of 6) sorted by relevance

/osnet-11/usr/src/grub/grub2/grub-core/lib/libgcrypt/cipher/
H A Ddsa.c99 static int test_keys (DSA_secret_key *sk, unsigned int qbits);
103 unsigned int qbits,
199 test_keys (DSA_secret_key *sk, unsigned int qbits)
203 gcry_mpi_t data = gcry_mpi_new (qbits);
204 gcry_mpi_t sig_a = gcry_mpi_new (qbits);
205 gcry_mpi_t sig_b = gcry_mpi_new (qbits);
214 gcry_mpi_randomize (data, qbits, GCRY_WEAK_RANDOM);
248 generate (DSA_secret_key *sk, unsigned int nbits, unsigned int qbits,
260 if (qbits)
261 ; /* Caller supplied qbits
198 test_keys(DSA_secret_key *sk, unsigned int qbits) argument
247 generate(DSA_secret_key *sk, unsigned int nbits, unsigned int qbits, int transient_key, dsa_domain_t *domain, gcry_mpi_t **ret_factors ) argument
397 generate_fips186(DSA_secret_key *sk, unsigned int nbits, unsigned int qbits, gcry_sexp_t deriveparms, int use_fips186_2, dsa_domain_t *domain, int *r_counter, void **r_seed, size_t *r_seedlen, gcry_mpi_t *r_h) argument
687 unsigned int qbits = 0; local
[all...]
H A Dprimegen.c278 size qbits. This is for example required for DSA.
298 unsigned int qbits, gcry_mpi_t g,
335 if (!qbits)
336 qbits = pbits / 3;
338 req_qbits = qbits;
341 for (n = 1; (pbits - qbits - 1) / n >= qbits; n++)
357 qbits = pbits - req_qbits - n * fbits;
362 qbits = pbits - n * fbits;
366 log_debug ("gen prime: pbits=%u qbits
294 prime_generate_internal(int need_q_factor, gcry_mpi_t *prime_generated, unsigned int pbits, unsigned int qbits, gcry_mpi_t g, gcry_mpi_t **ret_factors, gcry_random_level_t randomlevel, unsigned int flags, int all_factors, gcry_prime_check_func_t cb_func, void *cb_arg) argument
738 _gcry_generate_elg_prime(int mode, unsigned pbits, unsigned qbits, gcry_mpi_t g, gcry_mpi_t **ret_factors) argument
1426 _gcry_generate_fips186_2_prime(unsigned int pbits, unsigned int qbits, const void *seed, size_t seedlen, gcry_mpi_t *r_q, gcry_mpi_t *r_p, int *r_counter, void **r_seed, size_t *r_seedlen) argument
1640 _gcry_generate_fips186_3_prime(unsigned int pbits, unsigned int qbits, const void *seed, size_t seedlen, gcry_mpi_t *r_q, gcry_mpi_t *r_p, int *r_counter, void **r_seed, size_t *r_seedlen, int *r_hashalgo) argument
[all...]
H A Delgamal.c266 unsigned int qbits; local
271 qbits = wiener_map( nbits );
272 if( qbits & 1 ) /* better have a even one */
273 qbits++;
275 p = _gcry_generate_elg_prime( 0, nbits, qbits, g, ret_factors );
290 xbits = qbits * 3 / 2;
368 unsigned int qbits; local
382 qbits = wiener_map ( nbits );
383 if ( (qbits & 1) ) /* Better have an even one. */
384 qbits
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/lib/libgcrypt-grub/cipher/
H A Ddsa.c99 static int test_keys (DSA_secret_key *sk, unsigned int qbits);
103 unsigned int qbits,
199 test_keys (DSA_secret_key *sk, unsigned int qbits)
203 gcry_mpi_t data = gcry_mpi_new (qbits);
204 gcry_mpi_t sig_a = gcry_mpi_new (qbits);
205 gcry_mpi_t sig_b = gcry_mpi_new (qbits);
214 gcry_mpi_randomize (data, qbits, GCRY_WEAK_RANDOM);
248 generate (DSA_secret_key *sk, unsigned int nbits, unsigned int qbits,
260 if (qbits)
261 ; /* Caller supplied qbits
198 test_keys(DSA_secret_key *sk, unsigned int qbits) argument
247 generate(DSA_secret_key *sk, unsigned int nbits, unsigned int qbits, int transient_key, dsa_domain_t *domain, gcry_mpi_t **ret_factors ) argument
397 generate_fips186(DSA_secret_key *sk, unsigned int nbits, unsigned int qbits, gcry_sexp_t deriveparms, int use_fips186_2, dsa_domain_t *domain, int *r_counter, void **r_seed, size_t *r_seedlen, gcry_mpi_t *r_h) argument
687 unsigned int qbits = 0; local
[all...]
H A Dprimegen.c277 size qbits. This is for example required for DSA.
297 unsigned int qbits, gcry_mpi_t g,
334 if (!qbits)
335 qbits = pbits / 3;
337 req_qbits = qbits;
340 for (n = 1; (pbits - qbits - 1) / n >= qbits; n++)
356 qbits = pbits - req_qbits - n * fbits;
361 qbits = pbits - n * fbits;
365 log_debug ("gen prime: pbits=%u qbits
293 prime_generate_internal(int need_q_factor, gcry_mpi_t *prime_generated, unsigned int pbits, unsigned int qbits, gcry_mpi_t g, gcry_mpi_t **ret_factors, gcry_random_level_t randomlevel, unsigned int flags, int all_factors, gcry_prime_check_func_t cb_func, void *cb_arg) argument
737 _gcry_generate_elg_prime(int mode, unsigned pbits, unsigned qbits, gcry_mpi_t g, gcry_mpi_t **ret_factors) argument
1425 _gcry_generate_fips186_2_prime(unsigned int pbits, unsigned int qbits, const void *seed, size_t seedlen, gcry_mpi_t *r_q, gcry_mpi_t *r_p, int *r_counter, void **r_seed, size_t *r_seedlen) argument
1639 _gcry_generate_fips186_3_prime(unsigned int pbits, unsigned int qbits, const void *seed, size_t seedlen, gcry_mpi_t *r_q, gcry_mpi_t *r_p, int *r_counter, void **r_seed, size_t *r_seedlen, int *r_hashalgo) argument
[all...]
H A Delgamal.c266 unsigned int qbits; local
271 qbits = wiener_map( nbits );
272 if( qbits & 1 ) /* better have a even one */
273 qbits++;
275 p = _gcry_generate_elg_prime( 0, nbits, qbits, g, ret_factors );
290 xbits = qbits * 3 / 2;
368 unsigned int qbits; local
382 qbits = wiener_map ( nbits );
383 if ( (qbits & 1) ) /* Better have an even one. */
384 qbits
[all...]

Completed in 26 milliseconds