fips_dh_key.c 6.9 KB

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