Automatically generated by Pod::Man 2.27 (Pod::Simple 3.28)

Standard preamble:
========================================================================
..

..

.. Set up some character translations and predefined strings. \*(-- will
give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
double quote, and \*(R" will give a right double quote. \*(C+ will
give a nicer C++. Capital omega is used to do unbreakable dashes and
therefore won't be available. \*(C` and \*(C' expand to `' in nroff,
nothing in troff, for use with C<>.
.tr \(*W- . ds -- \(*W- . ds PI pi . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch . ds L" "" . ds R" "" . ds C` "" . ds C' "" 'br\} . ds -- \|\(em\| . ds PI \(*p . ds L" `` . ds R" '' . ds C` . ds C' 'br\}
Escape single quotes in literal strings from groff's Unicode transform.

If the F register is turned on, we'll generate index entries on stderr for
titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
entries marked with X<> in POD. Of course, you'll have to process the
output yourself in some meaningful fashion.

Avoid warning from groff about undefined register 'F'.
.. .nr rF 0 . if \nF \{ . de IX . tm Index:\\$1\t\\n%\t"\\$2" .. . if !\nF==2 \{ . nr % 0 . nr F 2 . \} . \} .\} .rr rF
Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
Fear. Run. Save yourself. No user-serviceable parts.
. \" fudge factors for nroff and troff . ds #H 0 . ds #V .8m . ds #F .3m . ds #[ \f1 . ds #] .\} . ds #H ((1u-(\\\\n(.fu%2u))*.13m) . ds #V .6m . ds #F 0 . ds #[ \& . ds #] \& .\} . \" simple accents for nroff and troff . ds ' \& . ds ` \& . ds ^ \& . ds , \& . ds ~ ~ . ds / .\} . ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u" . ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u' . ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u' . ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u' . ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u' . ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u' .\} . \" troff and (daisy-wheel) nroff accents . \" corrections for vroff . \" for low resolution devices (crt and lpr) \{\ . ds : e . ds 8 ss . ds o a . ds d- d\h'-1'\(ga . ds D- D\h'-1'\(hy . ds th \o'bp' . ds Th \o'LP' . ds ae ae . ds Ae AE .\} ========================================================================

Title "DSA_generate_parameters 3" For nroff, turn off justification. Always turn off hyphenation; it makes
way too many mistakes in technical documents.
DSA_generate_parameters - generate DSA parameters Header "SYNOPSIS" .Vb 1 #include <openssl/dsa.h> \& DSA *DSA_generate_parameters(int bits, unsigned char *seed, int seed_len, int *counter_ret, unsigned long *h_ret, void (*callback)(int, int, void *), void *cb_arg); .Ve Header "DESCRIPTION" \fIDSA_generate_parameters() generates primes p and q and a generator g for use in the \s-1DSA.\s0

\fBbits is the length of the prime to be generated; the \s-1DSS\s0 allows a maximum of 1024 bits.

If seed is \s-1NULL\s0 or seed_len < 20, the primes will be generated at random. Otherwise, the seed is used to generate them. If the given seed does not yield a prime q, a new random seed is chosen and placed at seed.

\fIDSA_generate_parameters() places the iteration count in *counter_ret and a counter used for finding a generator in *h_ret, unless these are \s-1NULL\s0.

A callback function may be used to provide feedback about the progress of the key generation. If callback is not \s-1NULL\s0, it will be called as follows:

When a candidate for q is generated, callback(0, m++, cb_arg) is called (m is 0 for the first candidate). When a candidate for q has passed a test by trial division, \fBcallback(1, -1, cb_arg) is called. While a candidate for q is tested by Miller-Rabin primality tests, \fBcallback(1, i, cb_arg) is called in the outer loop (once for each witness that confirms that the candidate may be prime); i is the loop counter (starting at 0). When a prime q has been found, callback(2, 0, cb_arg) and \fBcallback(3, 0, cb_arg) are called. Before a candidate for p (other than the first) is generated and tested, \fBcallback(0, counter, cb_arg) is called. When a candidate for p has passed the test by trial division, \fBcallback(1, -1, cb_arg) is called. While it is tested by the Miller-Rabin primality test, \fBcallback(1, i, cb_arg) is called in the outer loop (once for each witness that confirms that the candidate may be prime). i is the loop counter (starting at 0). When p has been found, callback(2, 1, cb_arg) is called. When the generator has been found, callback(3, 1, cb_arg) is called. Header "RETURN VALUE" \fIDSA_generate_parameters() returns a pointer to the \s-1DSA\s0 structure, or \fB\s-1NULL\s0 if the parameter generation fails. The error codes can be obtained by ERR_get_error\|(3). Header "BUGS" Seed lengths > 20 are not supported. Header "SEE ALSO" \fIdsa\|(3), ERR_get_error\|(3), rand\|(3), \fIDSA_free\|(3) Header "HISTORY" \fIDSA_generate_parameters() appeared in SSLeay 0.8. The cb_arg argument was added in SSLeay 0.9.0. In versions up to OpenSSL 0.9.4, callback(1, ...) was called in the inner loop of the Miller-Rabin test whenever it reached the squaring step (the parameters to callback did not reveal how many witnesses had been tested); since OpenSSL 0.9.5, callback(1, ...) is called as in BN_is_prime\|(3), i.e. once for each witness.