dh_key.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276
  1. /* crypto/dh/dh_key.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. #include <stdio.h>
  59. #include "internal/cryptlib.h"
  60. #include <openssl/rand.h>
  61. #include <openssl/dh.h>
  62. #include "internal/bn_int.h"
  63. static int generate_key(DH *dh);
  64. static int compute_key(unsigned char *key, const BIGNUM *pub_key, DH *dh);
  65. static int dh_bn_mod_exp(const DH *dh, BIGNUM *r,
  66. const BIGNUM *a, const BIGNUM *p,
  67. const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
  68. static int dh_init(DH *dh);
  69. static int dh_finish(DH *dh);
  70. int DH_generate_key(DH *dh)
  71. {
  72. return dh->meth->generate_key(dh);
  73. }
  74. int DH_compute_key(unsigned char *key, const BIGNUM *pub_key, DH *dh)
  75. {
  76. return dh->meth->compute_key(key, pub_key, dh);
  77. }
  78. int DH_compute_key_padded(unsigned char *key, const BIGNUM *pub_key, DH *dh)
  79. {
  80. int rv, pad;
  81. rv = dh->meth->compute_key(key, pub_key, dh);
  82. if (rv <= 0)
  83. return rv;
  84. pad = BN_num_bytes(dh->p) - rv;
  85. if (pad > 0) {
  86. memmove(key + pad, key, rv);
  87. memset(key, 0, pad);
  88. }
  89. return rv + pad;
  90. }
  91. static DH_METHOD dh_ossl = {
  92. "OpenSSL DH Method",
  93. generate_key,
  94. compute_key,
  95. dh_bn_mod_exp,
  96. dh_init,
  97. dh_finish,
  98. DH_FLAG_FIPS_METHOD,
  99. NULL,
  100. NULL
  101. };
  102. const DH_METHOD *DH_OpenSSL(void)
  103. {
  104. return &dh_ossl;
  105. }
  106. static int generate_key(DH *dh)
  107. {
  108. int ok = 0;
  109. int generate_new_key = 0;
  110. unsigned l;
  111. BN_CTX *ctx;
  112. BN_MONT_CTX *mont = NULL;
  113. BIGNUM *pub_key = NULL, *priv_key = NULL;
  114. ctx = BN_CTX_new();
  115. if (ctx == NULL)
  116. goto err;
  117. if (dh->priv_key == NULL) {
  118. priv_key = BN_new();
  119. if (priv_key == NULL)
  120. goto err;
  121. generate_new_key = 1;
  122. } else
  123. priv_key = dh->priv_key;
  124. if (dh->pub_key == NULL) {
  125. pub_key = BN_new();
  126. if (pub_key == NULL)
  127. goto err;
  128. } else
  129. pub_key = dh->pub_key;
  130. if (dh->flags & DH_FLAG_CACHE_MONT_P) {
  131. mont = BN_MONT_CTX_set_locked(&dh->method_mont_p,
  132. CRYPTO_LOCK_DH, dh->p, ctx);
  133. if (!mont)
  134. goto err;
  135. }
  136. if (generate_new_key) {
  137. if (dh->q) {
  138. do {
  139. if (!BN_rand_range(priv_key, dh->q))
  140. goto err;
  141. }
  142. while (BN_is_zero(priv_key) || BN_is_one(priv_key));
  143. } else {
  144. /* secret exponent length */
  145. l = dh->length ? dh->length : BN_num_bits(dh->p) - 1;
  146. if (!BN_rand(priv_key, l, 0, 0))
  147. goto err;
  148. }
  149. }
  150. {
  151. BIGNUM *local_prk = NULL;
  152. BIGNUM *prk;
  153. if ((dh->flags & DH_FLAG_NO_EXP_CONSTTIME) == 0) {
  154. local_prk = prk = BN_new();
  155. BN_with_flags(prk, priv_key, BN_FLG_CONSTTIME);
  156. } else
  157. prk = priv_key;
  158. if (!dh->meth->bn_mod_exp(dh, pub_key, dh->g, prk, dh->p, ctx, mont)) {
  159. BN_free(local_prk);
  160. goto err;
  161. }
  162. BN_free(local_prk);
  163. }
  164. dh->pub_key = pub_key;
  165. dh->priv_key = priv_key;
  166. ok = 1;
  167. err:
  168. if (ok != 1)
  169. DHerr(DH_F_GENERATE_KEY, ERR_R_BN_LIB);
  170. if (pub_key != dh->pub_key)
  171. BN_free(pub_key);
  172. if (priv_key != dh->priv_key)
  173. BN_free(priv_key);
  174. BN_CTX_free(ctx);
  175. return (ok);
  176. }
  177. static int compute_key(unsigned char *key, const BIGNUM *pub_key, DH *dh)
  178. {
  179. BN_CTX *ctx = NULL;
  180. BN_MONT_CTX *mont = NULL;
  181. BIGNUM *tmp;
  182. int ret = -1;
  183. int check_result;
  184. if (BN_num_bits(dh->p) > OPENSSL_DH_MAX_MODULUS_BITS) {
  185. DHerr(DH_F_COMPUTE_KEY, DH_R_MODULUS_TOO_LARGE);
  186. goto err;
  187. }
  188. ctx = BN_CTX_new();
  189. if (ctx == NULL)
  190. goto err;
  191. BN_CTX_start(ctx);
  192. tmp = BN_CTX_get(ctx);
  193. if (dh->priv_key == NULL) {
  194. DHerr(DH_F_COMPUTE_KEY, DH_R_NO_PRIVATE_VALUE);
  195. goto err;
  196. }
  197. if (dh->flags & DH_FLAG_CACHE_MONT_P) {
  198. mont = BN_MONT_CTX_set_locked(&dh->method_mont_p,
  199. CRYPTO_LOCK_DH, dh->p, ctx);
  200. if ((dh->flags & DH_FLAG_NO_EXP_CONSTTIME) == 0) {
  201. /* XXX */
  202. BN_set_flags(dh->priv_key, BN_FLG_CONSTTIME);
  203. }
  204. if (!mont)
  205. goto err;
  206. }
  207. if (!DH_check_pub_key(dh, pub_key, &check_result) || check_result) {
  208. DHerr(DH_F_COMPUTE_KEY, DH_R_INVALID_PUBKEY);
  209. goto err;
  210. }
  211. if (!dh->
  212. meth->bn_mod_exp(dh, tmp, pub_key, dh->priv_key, dh->p, ctx, mont)) {
  213. DHerr(DH_F_COMPUTE_KEY, ERR_R_BN_LIB);
  214. goto err;
  215. }
  216. ret = BN_bn2bin(tmp, key);
  217. err:
  218. if (ctx != NULL) {
  219. BN_CTX_end(ctx);
  220. BN_CTX_free(ctx);
  221. }
  222. return (ret);
  223. }
  224. static int dh_bn_mod_exp(const DH *dh, BIGNUM *r,
  225. const BIGNUM *a, const BIGNUM *p,
  226. const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx)
  227. {
  228. /*
  229. * If a is only one word long and constant time is false, use the faster
  230. * exponenentiation function.
  231. */
  232. if (bn_get_top(a) == 1 && ((dh->flags & DH_FLAG_NO_EXP_CONSTTIME) != 0)) {
  233. BN_ULONG A = bn_get_words(a)[0];
  234. return BN_mod_exp_mont_word(r, A, p, m, ctx, m_ctx);
  235. } else
  236. return BN_mod_exp_mont(r, a, p, m, ctx, m_ctx);
  237. }
  238. static int dh_init(DH *dh)
  239. {
  240. dh->flags |= DH_FLAG_CACHE_MONT_P;
  241. return (1);
  242. }
  243. static int dh_finish(DH *dh)
  244. {
  245. BN_MONT_CTX_free(dh->method_mont_p);
  246. return (1);
  247. }