dsa_gen.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386
  1. /* crypto/dsa/dsa_gen.c */
  2. /* Copyright (C) 1995-1998 Eric Young ([email protected])
  3. * All rights reserved.
  4. *
  5. * This package is an SSL implementation written
  6. * by Eric Young ([email protected]).
  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 ([email protected]).
  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 ([email protected])"
  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 ([email protected])"
  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. #undef GENUINE_DSA
  59. #ifdef GENUINE_DSA
  60. /*
  61. * Parameter generation follows the original release of FIPS PUB 186,
  62. * Appendix 2.2 (i.e. use SHA as defined in FIPS PUB 180)
  63. */
  64. # define HASH EVP_sha()
  65. #else
  66. /*
  67. * Parameter generation follows the updated Appendix 2.2 for FIPS PUB 186,
  68. * also Appendix 2.2 of FIPS PUB 186-1 (i.e. use SHA as defined in FIPS PUB
  69. * 180-1)
  70. */
  71. # define HASH EVP_sha1()
  72. #endif
  73. #include <openssl/opensslconf.h> /* To see if OPENSSL_NO_SHA is defined */
  74. #ifndef OPENSSL_NO_SHA
  75. # include <stdio.h>
  76. # include "cryptlib.h"
  77. # include <openssl/evp.h>
  78. # include <openssl/bn.h>
  79. # include <openssl/rand.h>
  80. # include <openssl/sha.h>
  81. # include "dsa_locl.h"
  82. # ifdef OPENSSL_FIPS
  83. # include <openssl/fips.h>
  84. # endif
  85. int DSA_generate_parameters_ex(DSA *ret, int bits,
  86. const unsigned char *seed_in, int seed_len,
  87. int *counter_ret, unsigned long *h_ret,
  88. BN_GENCB *cb)
  89. {
  90. # ifdef OPENSSL_FIPS
  91. if (FIPS_mode() && !(ret->meth->flags & DSA_FLAG_FIPS_METHOD)
  92. && !(ret->flags & DSA_FLAG_NON_FIPS_ALLOW)) {
  93. DSAerr(DSA_F_DSA_GENERATE_PARAMETERS_EX, DSA_R_NON_FIPS_DSA_METHOD);
  94. return 0;
  95. }
  96. # endif
  97. if (ret->meth->dsa_paramgen)
  98. return ret->meth->dsa_paramgen(ret, bits, seed_in, seed_len,
  99. counter_ret, h_ret, cb);
  100. # ifdef OPENSSL_FIPS
  101. else if (FIPS_mode()) {
  102. return FIPS_dsa_generate_parameters_ex(ret, bits,
  103. seed_in, seed_len,
  104. counter_ret, h_ret, cb);
  105. }
  106. # endif
  107. else {
  108. const EVP_MD *evpmd;
  109. size_t qbits = bits >= 2048 ? 256 : 160;
  110. if (bits >= 2048) {
  111. qbits = 256;
  112. evpmd = EVP_sha256();
  113. } else {
  114. qbits = 160;
  115. evpmd = EVP_sha1();
  116. }
  117. return dsa_builtin_paramgen(ret, bits, qbits, evpmd,
  118. seed_in, seed_len, NULL, counter_ret,
  119. h_ret, cb);
  120. }
  121. }
  122. int dsa_builtin_paramgen(DSA *ret, size_t bits, size_t qbits,
  123. const EVP_MD *evpmd, const unsigned char *seed_in,
  124. size_t seed_len, unsigned char *seed_out,
  125. int *counter_ret, unsigned long *h_ret, BN_GENCB *cb)
  126. {
  127. int ok = 0;
  128. unsigned char seed[SHA256_DIGEST_LENGTH];
  129. unsigned char md[SHA256_DIGEST_LENGTH];
  130. unsigned char buf[SHA256_DIGEST_LENGTH], buf2[SHA256_DIGEST_LENGTH];
  131. BIGNUM *r0, *W, *X, *c, *test;
  132. BIGNUM *g = NULL, *q = NULL, *p = NULL;
  133. BN_MONT_CTX *mont = NULL;
  134. int i, k, n = 0, m = 0, qsize = qbits >> 3;
  135. int counter = 0;
  136. int r = 0;
  137. BN_CTX *ctx = NULL;
  138. unsigned int h = 2;
  139. if (qsize != SHA_DIGEST_LENGTH && qsize != SHA224_DIGEST_LENGTH &&
  140. qsize != SHA256_DIGEST_LENGTH)
  141. /* invalid q size */
  142. return 0;
  143. if (evpmd == NULL)
  144. /* use SHA1 as default */
  145. evpmd = EVP_sha1();
  146. if (bits < 512)
  147. bits = 512;
  148. bits = (bits + 63) / 64 * 64;
  149. /*
  150. * NB: seed_len == 0 is special case: copy generated seed to seed_in if
  151. * it is not NULL.
  152. */
  153. if (seed_len && (seed_len < (size_t)qsize))
  154. seed_in = NULL; /* seed buffer too small -- ignore */
  155. if (seed_len > (size_t)qsize)
  156. seed_len = qsize; /* App. 2.2 of FIPS PUB 186 allows larger
  157. * SEED, but our internal buffers are
  158. * restricted to 160 bits */
  159. if (seed_in != NULL)
  160. memcpy(seed, seed_in, seed_len);
  161. if ((ctx = BN_CTX_new()) == NULL)
  162. goto err;
  163. if ((mont = BN_MONT_CTX_new()) == NULL)
  164. goto err;
  165. BN_CTX_start(ctx);
  166. r0 = BN_CTX_get(ctx);
  167. g = BN_CTX_get(ctx);
  168. W = BN_CTX_get(ctx);
  169. q = BN_CTX_get(ctx);
  170. X = BN_CTX_get(ctx);
  171. c = BN_CTX_get(ctx);
  172. p = BN_CTX_get(ctx);
  173. test = BN_CTX_get(ctx);
  174. if (!BN_lshift(test, BN_value_one(), bits - 1))
  175. goto err;
  176. for (;;) {
  177. for (;;) { /* find q */
  178. int seed_is_random;
  179. /* step 1 */
  180. if (!BN_GENCB_call(cb, 0, m++))
  181. goto err;
  182. if (!seed_len) {
  183. if (RAND_pseudo_bytes(seed, qsize) < 0)
  184. goto err;
  185. seed_is_random = 1;
  186. } else {
  187. seed_is_random = 0;
  188. seed_len = 0; /* use random seed if 'seed_in' turns out to
  189. * be bad */
  190. }
  191. memcpy(buf, seed, qsize);
  192. memcpy(buf2, seed, qsize);
  193. /* precompute "SEED + 1" for step 7: */
  194. for (i = qsize - 1; i >= 0; i--) {
  195. buf[i]++;
  196. if (buf[i] != 0)
  197. break;
  198. }
  199. /* step 2 */
  200. if (!EVP_Digest(seed, qsize, md, NULL, evpmd, NULL))
  201. goto err;
  202. if (!EVP_Digest(buf, qsize, buf2, NULL, evpmd, NULL))
  203. goto err;
  204. for (i = 0; i < qsize; i++)
  205. md[i] ^= buf2[i];
  206. /* step 3 */
  207. md[0] |= 0x80;
  208. md[qsize - 1] |= 0x01;
  209. if (!BN_bin2bn(md, qsize, q))
  210. goto err;
  211. /* step 4 */
  212. r = BN_is_prime_fasttest_ex(q, DSS_prime_checks, ctx,
  213. seed_is_random, cb);
  214. if (r > 0)
  215. break;
  216. if (r != 0)
  217. goto err;
  218. /* do a callback call */
  219. /* step 5 */
  220. }
  221. if (!BN_GENCB_call(cb, 2, 0))
  222. goto err;
  223. if (!BN_GENCB_call(cb, 3, 0))
  224. goto err;
  225. /* step 6 */
  226. counter = 0;
  227. /* "offset = 2" */
  228. n = (bits - 1) / 160;
  229. for (;;) {
  230. if ((counter != 0) && !BN_GENCB_call(cb, 0, counter))
  231. goto err;
  232. /* step 7 */
  233. BN_zero(W);
  234. /* now 'buf' contains "SEED + offset - 1" */
  235. for (k = 0; k <= n; k++) {
  236. /*
  237. * obtain "SEED + offset + k" by incrementing:
  238. */
  239. for (i = qsize - 1; i >= 0; i--) {
  240. buf[i]++;
  241. if (buf[i] != 0)
  242. break;
  243. }
  244. if (!EVP_Digest(buf, qsize, md, NULL, evpmd, NULL))
  245. goto err;
  246. /* step 8 */
  247. if (!BN_bin2bn(md, qsize, r0))
  248. goto err;
  249. if (!BN_lshift(r0, r0, (qsize << 3) * k))
  250. goto err;
  251. if (!BN_add(W, W, r0))
  252. goto err;
  253. }
  254. /* more of step 8 */
  255. if (!BN_mask_bits(W, bits - 1))
  256. goto err;
  257. if (!BN_copy(X, W))
  258. goto err;
  259. if (!BN_add(X, X, test))
  260. goto err;
  261. /* step 9 */
  262. if (!BN_lshift1(r0, q))
  263. goto err;
  264. if (!BN_mod(c, X, r0, ctx))
  265. goto err;
  266. if (!BN_sub(r0, c, BN_value_one()))
  267. goto err;
  268. if (!BN_sub(p, X, r0))
  269. goto err;
  270. /* step 10 */
  271. if (BN_cmp(p, test) >= 0) {
  272. /* step 11 */
  273. r = BN_is_prime_fasttest_ex(p, DSS_prime_checks, ctx, 1, cb);
  274. if (r > 0)
  275. goto end; /* found it */
  276. if (r != 0)
  277. goto err;
  278. }
  279. /* step 13 */
  280. counter++;
  281. /* "offset = offset + n + 1" */
  282. /* step 14 */
  283. if (counter >= 4096)
  284. break;
  285. }
  286. }
  287. end:
  288. if (!BN_GENCB_call(cb, 2, 1))
  289. goto err;
  290. /* We now need to generate g */
  291. /* Set r0=(p-1)/q */
  292. if (!BN_sub(test, p, BN_value_one()))
  293. goto err;
  294. if (!BN_div(r0, NULL, test, q, ctx))
  295. goto err;
  296. if (!BN_set_word(test, h))
  297. goto err;
  298. if (!BN_MONT_CTX_set(mont, p, ctx))
  299. goto err;
  300. for (;;) {
  301. /* g=test^r0%p */
  302. if (!BN_mod_exp_mont(g, test, r0, p, ctx, mont))
  303. goto err;
  304. if (!BN_is_one(g))
  305. break;
  306. if (!BN_add(test, test, BN_value_one()))
  307. goto err;
  308. h++;
  309. }
  310. if (!BN_GENCB_call(cb, 3, 1))
  311. goto err;
  312. ok = 1;
  313. err:
  314. if (ok) {
  315. if (ret->p)
  316. BN_free(ret->p);
  317. if (ret->q)
  318. BN_free(ret->q);
  319. if (ret->g)
  320. BN_free(ret->g);
  321. ret->p = BN_dup(p);
  322. ret->q = BN_dup(q);
  323. ret->g = BN_dup(g);
  324. if (ret->p == NULL || ret->q == NULL || ret->g == NULL) {
  325. ok = 0;
  326. goto err;
  327. }
  328. if (counter_ret != NULL)
  329. *counter_ret = counter;
  330. if (h_ret != NULL)
  331. *h_ret = h;
  332. if (seed_out)
  333. memcpy(seed_out, seed, qsize);
  334. }
  335. if (ctx) {
  336. BN_CTX_end(ctx);
  337. BN_CTX_free(ctx);
  338. }
  339. if (mont != NULL)
  340. BN_MONT_CTX_free(mont);
  341. return ok;
  342. }
  343. #endif