Manual Pages for UNIX Operating System command usage for man DSA_generate_parameters

OpenSSL                         DSA_generate_parameters(3openssl)



NNNNAAAAMMMMEEEE
     DSA_generate_parameters - generate DSA parameters

SSSSYYYYNNNNOOOOPPPPSSSSIIIISSSS
      #include 

      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);


DDDDEEEESSSSCCCCRRRRIIIIPPPPTTTTIIIIOOOONNNN
     DSA_generate_parameters() generates primes p and q and a
     generator g for use in the DSA.

     bbbbiiiittttssss is the length of the prime to be generated; the DSS
     allows a maximum of 1024 bits.

     If sssseeeeeeeedddd is NNNNUUUULLLLLLLL or sssseeeeeeeedddd_lllleeeennnn < 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 sssseeeeeeeedddd.

     DSA_generate_parameters() places the iteration count in
     *ccccoooouuuunnnntttteeeerrrr_rrrreeeetttt and a counter used for finding a generator in
     *hhhh_rrrreeeetttt, unless these are NNNNUUUULLLLLLLL.

     A callback function may be used to provide feedback about
     the progress of the key generation. If ccccaaaallllllllbbbbaaaacccckkkk is not NNNNUUUULLLLLLLL,
     it will be called as follows:

     +o   When a candidate for q is generated, ccccaaaallllllllbbbbaaaacccckkkk((((0000,,,, mmmm++++++++,,,,
         ccccbbbb_aaaarrrrgggg)))) is called (m is 0 for the first candidate).

     +o   When a candidate for q has passed a test by trial
         division, ccccaaaallllllllbbbbaaaacccckkkk((((1111,,,, ----1111,,,, ccccbbbb_aaaarrrrgggg)))) is called.  While a
         candidate for q is tested by Miller-Rabin primality
         tests, ccccaaaallllllllbbbbaaaacccckkkk((((1111,,,, iiii,,,, ccccbbbb_aaaarrrrgggg)))) 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).

     +o   When a prime q has been found, ccccaaaallllllllbbbbaaaacccckkkk((((2222,,,, 0000,,,, ccccbbbb_aaaarrrrgggg))))
         and ccccaaaallllllllbbbbaaaacccckkkk((((3333,,,, 0000,,,, ccccbbbb_aaaarrrrgggg)))) are called.

     +o   Before a candidate for p (other than the first) is
         generated and tested, ccccaaaallllllllbbbbaaaacccckkkk((((0000,,,, ccccoooouuuunnnntttteeeerrrr,,,, ccccbbbb_aaaarrrrgggg)))) is
         called.

     +o   When a candidate for p has passed the test by trial
         division, ccccaaaallllllllbbbbaaaacccckkkk((((1111,,,, ----1111,,,, ccccbbbb_aaaarrrrgggg)))) is called.  While it
         is tested by the Miller-Rabin primality test,



25/Sep/2002            Last change: 0.9.8o                      1






OpenSSL                         DSA_generate_parameters(3openssl)



         ccccaaaallllllllbbbbaaaacccckkkk((((1111,,,, iiii,,,, ccccbbbb_aaaarrrrgggg)))) 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).

     +o   When p has been found, ccccaaaallllllllbbbbaaaacccckkkk((((2222,,,, 1111,,,, ccccbbbb_aaaarrrrgggg)))) is called.

     +o   When the generator has been found, ccccaaaallllllllbbbbaaaacccckkkk((((3333,,,, 1111,,,,
         ccccbbbb_aaaarrrrgggg)))) is called.

RRRREEEETTTTUUUURRRRNNNN VVVVAAAALLLLUUUUEEEE
     DSA_generate_parameters() returns a pointer to the DSA
     structure, or NNNNUUUULLLLLLLL if the parameter generation fails. The
     error codes can be obtained by ERR_get_error(3).

BBBBUUUUGGGGSSSS
     Seed lengths > 20 are not supported.

SSSSEEEEEEEE AAAALLLLSSSSOOOO
     dsa(3), ERR_get_error(3), rand(3), DSA_free(3)

HHHHIIIISSSSTTTTOOOORRRRYYYY
     DSA_generate_parameters() appeared in SSLeay 0.8. The ccccbbbb_aaaarrrrgggg
     argument was added in SSLeay 0.9.0.  In versions up to
     OpenSSL 0.9.4, ccccaaaallllllllbbbbaaaacccckkkk((((1111,,,, ............)))) was called in the inner loop
     of the Miller-Rabin test whenever it reached the squaring
     step (the parameters to ccccaaaallllllllbbbbaaaacccckkkk did not reveal how many
     witnesses had been tested); since OpenSSL 0.9.5, ccccaaaallllllllbbbbaaaacccckkkk((((1111,,,,
     ............))))  is called as in BN_is_prime(3), i.e. once for each
     witness.  =cut


























25/Sep/2002            Last change: 0.9.8o                      2