dh_key.c 7.9 KB

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