dsa_ossl.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380
  1. /* crypto/dsa/dsa_ossl.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. /* Original version from Steven Schoch <schoch@sheba.arc.nasa.gov> */
  59. #include <stdio.h>
  60. #include "cryptlib.h"
  61. #include <openssl/bn.h>
  62. #include <openssl/dsa.h>
  63. #include <openssl/rand.h>
  64. #include <openssl/asn1.h>
  65. static DSA_SIG *dsa_do_sign(const unsigned char *dgst, int dlen, DSA *dsa);
  66. static int dsa_sign_setup(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp, BIGNUM **rp);
  67. static int dsa_do_verify(const unsigned char *dgst, int dgst_len, DSA_SIG *sig,
  68. DSA *dsa);
  69. static int dsa_init(DSA *dsa);
  70. static int dsa_finish(DSA *dsa);
  71. static DSA_METHOD openssl_dsa_meth = {
  72. "OpenSSL DSA method",
  73. dsa_do_sign,
  74. dsa_sign_setup,
  75. dsa_do_verify,
  76. NULL, /* dsa_mod_exp, */
  77. NULL, /* dsa_bn_mod_exp, */
  78. dsa_init,
  79. dsa_finish,
  80. 0,
  81. NULL,
  82. NULL,
  83. NULL
  84. };
  85. /* These macro wrappers replace attempts to use the dsa_mod_exp() and
  86. * bn_mod_exp() handlers in the DSA_METHOD structure. We avoid the problem of
  87. * having a the macro work as an expression by bundling an "err_instr". So;
  88. *
  89. * if (!dsa->meth->bn_mod_exp(dsa, r,dsa->g,&k,dsa->p,ctx,
  90. * dsa->method_mont_p)) goto err;
  91. *
  92. * can be replaced by;
  93. *
  94. * DSA_BN_MOD_EXP(goto err, dsa, r, dsa->g, &k, dsa->p, ctx,
  95. * dsa->method_mont_p);
  96. */
  97. #define DSA_MOD_EXP(err_instr,dsa,rr,a1,p1,a2,p2,m,ctx,in_mont) \
  98. do { \
  99. int _tmp_res53; \
  100. if((dsa)->meth->dsa_mod_exp) \
  101. _tmp_res53 = (dsa)->meth->dsa_mod_exp((dsa), (rr), (a1), (p1), \
  102. (a2), (p2), (m), (ctx), (in_mont)); \
  103. else \
  104. _tmp_res53 = BN_mod_exp2_mont((rr), (a1), (p1), (a2), (p2), \
  105. (m), (ctx), (in_mont)); \
  106. if(!_tmp_res53) err_instr; \
  107. } while(0)
  108. #define DSA_BN_MOD_EXP(err_instr,dsa,r,a,p,m,ctx,m_ctx) \
  109. do { \
  110. int _tmp_res53; \
  111. if((dsa)->meth->bn_mod_exp) \
  112. _tmp_res53 = (dsa)->meth->bn_mod_exp((dsa), (r), (a), (p), \
  113. (m), (ctx), (m_ctx)); \
  114. else \
  115. _tmp_res53 = BN_mod_exp_mont((r), (a), (p), (m), (ctx), (m_ctx)); \
  116. if(!_tmp_res53) err_instr; \
  117. } while(0)
  118. const DSA_METHOD *DSA_OpenSSL(void)
  119. {
  120. return &openssl_dsa_meth;
  121. }
  122. static DSA_SIG *dsa_do_sign(const unsigned char *dgst, int dlen, DSA *dsa)
  123. {
  124. BIGNUM *kinv=NULL,*r=NULL,*s=NULL;
  125. BIGNUM m;
  126. BIGNUM xr;
  127. BN_CTX *ctx=NULL;
  128. int i,reason=ERR_R_BN_LIB;
  129. DSA_SIG *ret=NULL;
  130. BN_init(&m);
  131. BN_init(&xr);
  132. if (!dsa->p || !dsa->q || !dsa->g)
  133. {
  134. reason=DSA_R_MISSING_PARAMETERS;
  135. goto err;
  136. }
  137. s=BN_new();
  138. if (s == NULL) goto err;
  139. i=BN_num_bytes(dsa->q); /* should be 20 */
  140. if ((dlen > i) || (dlen > 50))
  141. {
  142. reason=DSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE;
  143. goto err;
  144. }
  145. ctx=BN_CTX_new();
  146. if (ctx == NULL) goto err;
  147. if ((dsa->kinv == NULL) || (dsa->r == NULL))
  148. {
  149. if (!DSA_sign_setup(dsa,ctx,&kinv,&r)) goto err;
  150. }
  151. else
  152. {
  153. kinv=dsa->kinv;
  154. dsa->kinv=NULL;
  155. r=dsa->r;
  156. dsa->r=NULL;
  157. }
  158. if (BN_bin2bn(dgst,dlen,&m) == NULL) goto err;
  159. /* Compute s = inv(k) (m + xr) mod q */
  160. if (!BN_mod_mul(&xr,dsa->priv_key,r,dsa->q,ctx)) goto err;/* s = xr */
  161. if (!BN_add(s, &xr, &m)) goto err; /* s = m + xr */
  162. if (BN_cmp(s,dsa->q) > 0)
  163. BN_sub(s,s,dsa->q);
  164. if (!BN_mod_mul(s,s,kinv,dsa->q,ctx)) goto err;
  165. ret=DSA_SIG_new();
  166. if (ret == NULL) goto err;
  167. ret->r = r;
  168. ret->s = s;
  169. err:
  170. if (!ret)
  171. {
  172. DSAerr(DSA_F_DSA_DO_SIGN,reason);
  173. BN_free(r);
  174. BN_free(s);
  175. }
  176. if (ctx != NULL) BN_CTX_free(ctx);
  177. BN_clear_free(&m);
  178. BN_clear_free(&xr);
  179. if (kinv != NULL) /* dsa->kinv is NULL now if we used it */
  180. BN_clear_free(kinv);
  181. return(ret);
  182. }
  183. static int dsa_sign_setup(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp, BIGNUM **rp)
  184. {
  185. BN_CTX *ctx;
  186. BIGNUM k,kq,*K,*kinv=NULL,*r=NULL;
  187. int ret=0;
  188. if (!dsa->p || !dsa->q || !dsa->g)
  189. {
  190. DSAerr(DSA_F_DSA_SIGN_SETUP,DSA_R_MISSING_PARAMETERS);
  191. return 0;
  192. }
  193. BN_init(&k);
  194. BN_init(&kq);
  195. if (ctx_in == NULL)
  196. {
  197. if ((ctx=BN_CTX_new()) == NULL) goto err;
  198. }
  199. else
  200. ctx=ctx_in;
  201. if ((r=BN_new()) == NULL) goto err;
  202. /* Get random k */
  203. do
  204. if (!BN_rand_range(&k, dsa->q)) goto err;
  205. while (BN_is_zero(&k));
  206. if ((dsa->flags & DSA_FLAG_NO_EXP_CONSTTIME) == 0)
  207. {
  208. BN_set_flags(&k, BN_FLG_EXP_CONSTTIME);
  209. }
  210. if (dsa->flags & DSA_FLAG_CACHE_MONT_P)
  211. {
  212. if (!BN_MONT_CTX_set_locked(&dsa->method_mont_p,
  213. CRYPTO_LOCK_DSA,
  214. dsa->p, ctx))
  215. goto err;
  216. }
  217. /* Compute r = (g^k mod p) mod q */
  218. if ((dsa->flags & DSA_FLAG_NO_EXP_CONSTTIME) == 0)
  219. {
  220. if (!BN_copy(&kq, &k)) goto err;
  221. /* We do not want timing information to leak the length of k,
  222. * so we compute g^k using an equivalent exponent of fixed length.
  223. *
  224. * (This is a kludge that we need because the BN_mod_exp_mont()
  225. * does not let us specify the desired timing behaviour.) */
  226. if (!BN_add(&kq, &kq, dsa->q)) goto err;
  227. if (BN_num_bits(&kq) <= BN_num_bits(dsa->q))
  228. {
  229. if (!BN_add(&kq, &kq, dsa->q)) goto err;
  230. }
  231. K = &kq;
  232. }
  233. else
  234. {
  235. K = &k;
  236. }
  237. DSA_BN_MOD_EXP(goto err, dsa, r, dsa->g, K, dsa->p, ctx,
  238. dsa->method_mont_p);
  239. if (!BN_mod(r,r,dsa->q,ctx)) goto err;
  240. /* Compute part of 's = inv(k) (m + xr) mod q' */
  241. if ((kinv=BN_mod_inverse(NULL,&k,dsa->q,ctx)) == NULL) goto err;
  242. if (*kinvp != NULL) BN_clear_free(*kinvp);
  243. *kinvp=kinv;
  244. kinv=NULL;
  245. if (*rp != NULL) BN_clear_free(*rp);
  246. *rp=r;
  247. ret=1;
  248. err:
  249. if (!ret)
  250. {
  251. DSAerr(DSA_F_DSA_SIGN_SETUP,ERR_R_BN_LIB);
  252. if (r != NULL)
  253. BN_clear_free(r);
  254. }
  255. if (ctx_in == NULL) BN_CTX_free(ctx);
  256. BN_clear_free(&k);
  257. BN_clear_free(&kq);
  258. return(ret);
  259. }
  260. static int dsa_do_verify(const unsigned char *dgst, int dgst_len, DSA_SIG *sig,
  261. DSA *dsa)
  262. {
  263. BN_CTX *ctx;
  264. BIGNUM u1,u2,t1;
  265. BN_MONT_CTX *mont=NULL;
  266. int ret = -1;
  267. if (!dsa->p || !dsa->q || !dsa->g)
  268. {
  269. DSAerr(DSA_F_DSA_DO_VERIFY,DSA_R_MISSING_PARAMETERS);
  270. return -1;
  271. }
  272. BN_init(&u1);
  273. BN_init(&u2);
  274. BN_init(&t1);
  275. if ((ctx=BN_CTX_new()) == NULL) goto err;
  276. if (BN_is_zero(sig->r) || BN_is_negative(sig->r) ||
  277. BN_ucmp(sig->r, dsa->q) >= 0)
  278. {
  279. ret = 0;
  280. goto err;
  281. }
  282. if (BN_is_zero(sig->s) || BN_is_negative(sig->s) ||
  283. BN_ucmp(sig->s, dsa->q) >= 0)
  284. {
  285. ret = 0;
  286. goto err;
  287. }
  288. /* Calculate W = inv(S) mod Q
  289. * save W in u2 */
  290. if ((BN_mod_inverse(&u2,sig->s,dsa->q,ctx)) == NULL) goto err;
  291. /* save M in u1 */
  292. if (BN_bin2bn(dgst,dgst_len,&u1) == NULL) goto err;
  293. /* u1 = M * w mod q */
  294. if (!BN_mod_mul(&u1,&u1,&u2,dsa->q,ctx)) goto err;
  295. /* u2 = r * w mod q */
  296. if (!BN_mod_mul(&u2,sig->r,&u2,dsa->q,ctx)) goto err;
  297. if (dsa->flags & DSA_FLAG_CACHE_MONT_P)
  298. {
  299. mont = BN_MONT_CTX_set_locked(&dsa->method_mont_p,
  300. CRYPTO_LOCK_DSA, dsa->p, ctx);
  301. if (!mont)
  302. goto err;
  303. }
  304. DSA_MOD_EXP(goto err, dsa, &t1, dsa->g, &u1, dsa->pub_key, &u2, dsa->p, ctx, mont);
  305. /* BN_copy(&u1,&t1); */
  306. /* let u1 = u1 mod q */
  307. if (!BN_mod(&u1,&t1,dsa->q,ctx)) goto err;
  308. /* V is now in u1. If the signature is correct, it will be
  309. * equal to R. */
  310. ret=(BN_ucmp(&u1, sig->r) == 0);
  311. err:
  312. /* XXX: surely this is wrong - if ret is 0, it just didn't verify;
  313. there is no error in BN. Test should be ret == -1 (Ben) */
  314. if (ret != 1) DSAerr(DSA_F_DSA_DO_VERIFY,ERR_R_BN_LIB);
  315. if (ctx != NULL) BN_CTX_free(ctx);
  316. BN_free(&u1);
  317. BN_free(&u2);
  318. BN_free(&t1);
  319. return(ret);
  320. }
  321. static int dsa_init(DSA *dsa)
  322. {
  323. dsa->flags|=DSA_FLAG_CACHE_MONT_P;
  324. return(1);
  325. }
  326. static int dsa_finish(DSA *dsa)
  327. {
  328. if(dsa->method_mont_p)
  329. BN_MONT_CTX_free(dsa->method_mont_p);
  330. return(1);
  331. }