generic-library/openssl
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Document DSA and SHA.

Browse Source 
New function BN_pseudo_rand().
Use BN_prime_checks_size(BN_num_bits(w)) rounds of Miller-Rabin when
generating DSA primes (why not use BN_is_prime()?)
This commit is contained in:
Ulf Möller
2000-01-27 19:31:26 +00:00
parent 0c23524963
commit 38e33cef15
32 changed files with 855 additions and 65 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
crypto/dsa/dsa.h
View File

@@ -182,7 +182,7 @@ DSA * d2i_DSAPrivateKey(DSA **a, unsigned char **pp, long length);
DSA * d2i_DSAparams(DSA **a, unsigned char **pp, long length);
DSA * DSA_generate_parameters(int bits, unsigned char *seed,int seed_len,
int *counter_ret, unsigned long *h_ret,void
(*callback)(),char *cb_arg);
(*callback)(),void *cb_arg);
int DSA_generate_key(DSA *a);
int i2d_DSAPublicKey(DSA *a, unsigned char **pp);
int i2d_DSAPrivateKey(DSA *a, unsigned char **pp);
@@ -197,7 +197,7 @@ int DSAparams_print_fp(FILE *fp, DSA *x);
int DSA_print_fp(FILE *bp, DSA *x, int off);
#endif
int DSA_is_prime(BIGNUM *q,void (*callback)(),char *cb_arg);
int DSA_is_prime(BIGNUM *q,void (*callback)(),void *cb_arg);
#ifndef NO_DH
/* Convert DSA structure (key or just parameters) into DH structure