dh_gen.c 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205
  1. /* crypto/dh/dh_gen.c */
  2. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  3. * All rights reserved.
  4. *
  5. * This package is an SSL implementation written
  6. * by Eric Young (eay@cryptsoft.com).
  7. * The implementation was written so as to conform with Netscapes SSL.
  8. *
  9. * This library is free for commercial and non-commercial use as long as
  10. * the following conditions are aheared to. The following conditions
  11. * apply to all code found in this distribution, be it the RC4, RSA,
  12. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  13. * included with this distribution is covered by the same copyright terms
  14. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  15. *
  16. * Copyright remains Eric Young's, and as such any Copyright notices in
  17. * the code are not to be removed.
  18. * If this package is used in a product, Eric Young should be given attribution
  19. * as the author of the parts of the library used.
  20. * This can be in the form of a textual message at program startup or
  21. * in documentation (online or textual) provided with the package.
  22. *
  23. * Redistribution and use in source and binary forms, with or without
  24. * modification, are permitted provided that the following conditions
  25. * are met:
  26. * 1. Redistributions of source code must retain the copyright
  27. * notice, this list of conditions and the following disclaimer.
  28. * 2. Redistributions in binary form must reproduce the above copyright
  29. * notice, this list of conditions and the following disclaimer in the
  30. * documentation and/or other materials provided with the distribution.
  31. * 3. All advertising materials mentioning features or use of this software
  32. * must display the following acknowledgement:
  33. * "This product includes cryptographic software written by
  34. * Eric Young (eay@cryptsoft.com)"
  35. * The word 'cryptographic' can be left out if the rouines from the library
  36. * being used are not cryptographic related :-).
  37. * 4. If you include any Windows specific code (or a derivative thereof) from
  38. * the apps directory (application code) you must include an acknowledgement:
  39. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  40. *
  41. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  42. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  43. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  44. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  45. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  46. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  47. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  48. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  49. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  50. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  51. * SUCH DAMAGE.
  52. *
  53. * The licence and distribution terms for any publically available version or
  54. * derivative of this code cannot be changed. i.e. this code cannot simply be
  55. * copied and put under another distribution licence
  56. * [including the GNU Public Licence.]
  57. */
  58. /*
  59. * NB: These functions have been upgraded - the previous prototypes are in
  60. * dh_depr.c as wrappers to these ones. - Geoff
  61. */
  62. #include <stdio.h>
  63. #include "cryptlib.h"
  64. #include <openssl/bn.h>
  65. #include <openssl/dh.h>
  66. #ifdef OPENSSL_FIPS
  67. # include <openssl/fips.h>
  68. #endif
  69. static int dh_builtin_genparams(DH *ret, int prime_len, int generator,
  70. BN_GENCB *cb);
  71. int DH_generate_parameters_ex(DH *ret, int prime_len, int generator,
  72. BN_GENCB *cb)
  73. {
  74. #ifdef OPENSSL_FIPS
  75. if (FIPS_mode() && !(ret->meth->flags & DH_FLAG_FIPS_METHOD)
  76. && !(ret->flags & DH_FLAG_NON_FIPS_ALLOW)) {
  77. DHerr(DH_F_DH_GENERATE_PARAMETERS_EX, DH_R_NON_FIPS_METHOD);
  78. return 0;
  79. }
  80. #endif
  81. if (ret->meth->generate_params)
  82. return ret->meth->generate_params(ret, prime_len, generator, cb);
  83. #ifdef OPENSSL_FIPS
  84. if (FIPS_mode())
  85. return FIPS_dh_generate_parameters_ex(ret, prime_len, generator, cb);
  86. #endif
  87. return dh_builtin_genparams(ret, prime_len, generator, cb);
  88. }
  89. /*-
  90. * We generate DH parameters as follows
  91. * find a prime q which is prime_len/2 bits long.
  92. * p=(2*q)+1 or (p-1)/2 = q
  93. * For this case, g is a generator if
  94. * g^((p-1)/q) mod p != 1 for values of q which are the factors of p-1.
  95. * Since the factors of p-1 are q and 2, we just need to check
  96. * g^2 mod p != 1 and g^q mod p != 1.
  97. *
  98. * Having said all that,
  99. * there is another special case method for the generators 2, 3 and 5.
  100. * for 2, p mod 24 == 11
  101. * for 3, p mod 12 == 5 <<<<< does not work for safe primes.
  102. * for 5, p mod 10 == 3 or 7
  103. *
  104. * Thanks to Phil Karn <karn@qualcomm.com> for the pointers about the
  105. * special generators and for answering some of my questions.
  106. *
  107. * I've implemented the second simple method :-).
  108. * Since DH should be using a safe prime (both p and q are prime),
  109. * this generator function can take a very very long time to run.
  110. */
  111. /*
  112. * Actually there is no reason to insist that 'generator' be a generator.
  113. * It's just as OK (and in some sense better) to use a generator of the
  114. * order-q subgroup.
  115. */
  116. static int dh_builtin_genparams(DH *ret, int prime_len, int generator,
  117. BN_GENCB *cb)
  118. {
  119. BIGNUM *t1, *t2;
  120. int g, ok = -1;
  121. BN_CTX *ctx = NULL;
  122. ctx = BN_CTX_new();
  123. if (ctx == NULL)
  124. goto err;
  125. BN_CTX_start(ctx);
  126. t1 = BN_CTX_get(ctx);
  127. t2 = BN_CTX_get(ctx);
  128. if (t1 == NULL || t2 == NULL)
  129. goto err;
  130. /* Make sure 'ret' has the necessary elements */
  131. if (!ret->p && ((ret->p = BN_new()) == NULL))
  132. goto err;
  133. if (!ret->g && ((ret->g = BN_new()) == NULL))
  134. goto err;
  135. if (generator <= 1) {
  136. DHerr(DH_F_DH_BUILTIN_GENPARAMS, DH_R_BAD_GENERATOR);
  137. goto err;
  138. }
  139. if (generator == DH_GENERATOR_2) {
  140. if (!BN_set_word(t1, 24))
  141. goto err;
  142. if (!BN_set_word(t2, 11))
  143. goto err;
  144. g = 2;
  145. }
  146. #if 0 /* does not work for safe primes */
  147. else if (generator == DH_GENERATOR_3) {
  148. if (!BN_set_word(t1, 12))
  149. goto err;
  150. if (!BN_set_word(t2, 5))
  151. goto err;
  152. g = 3;
  153. }
  154. #endif
  155. else if (generator == DH_GENERATOR_5) {
  156. if (!BN_set_word(t1, 10))
  157. goto err;
  158. if (!BN_set_word(t2, 3))
  159. goto err;
  160. /*
  161. * BN_set_word(t3,7); just have to miss out on these ones :-(
  162. */
  163. g = 5;
  164. } else {
  165. /*
  166. * in the general case, don't worry if 'generator' is a generator or
  167. * not: since we are using safe primes, it will generate either an
  168. * order-q or an order-2q group, which both is OK
  169. */
  170. if (!BN_set_word(t1, 2))
  171. goto err;
  172. if (!BN_set_word(t2, 1))
  173. goto err;
  174. g = generator;
  175. }
  176. if (!BN_generate_prime_ex(ret->p, prime_len, 1, t1, t2, cb))
  177. goto err;
  178. if (!BN_GENCB_call(cb, 3, 0))
  179. goto err;
  180. if (!BN_set_word(ret->g, g))
  181. goto err;
  182. ok = 1;
  183. err:
  184. if (ok == -1) {
  185. DHerr(DH_F_DH_BUILTIN_GENPARAMS, ERR_R_BN_LIB);
  186. ok = 0;
  187. }
  188. if (ctx != NULL) {
  189. BN_CTX_end(ctx);
  190. BN_CTX_free(ctx);
  191. }
  192. return ok;
  193. }