bn_blind.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386
  1. /* crypto/bn/bn_blind.c */
  2. /* ====================================================================
  3. * Copyright (c) 1998-2006 The OpenSSL Project. All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. *
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. *
  12. * 2. Redistributions in binary form must reproduce the above copyright
  13. * notice, this list of conditions and the following disclaimer in
  14. * the documentation and/or other materials provided with the
  15. * distribution.
  16. *
  17. * 3. All advertising materials mentioning features or use of this
  18. * software must display the following acknowledgment:
  19. * "This product includes software developed by the OpenSSL Project
  20. * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
  21. *
  22. * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
  23. * endorse or promote products derived from this software without
  24. * prior written permission. For written permission, please contact
  25. * openssl-core@openssl.org.
  26. *
  27. * 5. Products derived from this software may not be called "OpenSSL"
  28. * nor may "OpenSSL" appear in their names without prior written
  29. * permission of the OpenSSL Project.
  30. *
  31. * 6. Redistributions of any form whatsoever must retain the following
  32. * acknowledgment:
  33. * "This product includes software developed by the OpenSSL Project
  34. * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
  35. *
  36. * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
  37. * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  38. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  39. * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
  40. * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  41. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  42. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  43. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  44. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  45. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  46. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
  47. * OF THE POSSIBILITY OF SUCH DAMAGE.
  48. * ====================================================================
  49. *
  50. * This product includes cryptographic software written by Eric Young
  51. * (eay@cryptsoft.com). This product includes software written by Tim
  52. * Hudson (tjh@cryptsoft.com).
  53. *
  54. */
  55. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  56. * All rights reserved.
  57. *
  58. * This package is an SSL implementation written
  59. * by Eric Young (eay@cryptsoft.com).
  60. * The implementation was written so as to conform with Netscapes SSL.
  61. *
  62. * This library is free for commercial and non-commercial use as long as
  63. * the following conditions are aheared to. The following conditions
  64. * apply to all code found in this distribution, be it the RC4, RSA,
  65. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  66. * included with this distribution is covered by the same copyright terms
  67. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  68. *
  69. * Copyright remains Eric Young's, and as such any Copyright notices in
  70. * the code are not to be removed.
  71. * If this package is used in a product, Eric Young should be given attribution
  72. * as the author of the parts of the library used.
  73. * This can be in the form of a textual message at program startup or
  74. * in documentation (online or textual) provided with the package.
  75. *
  76. * Redistribution and use in source and binary forms, with or without
  77. * modification, are permitted provided that the following conditions
  78. * are met:
  79. * 1. Redistributions of source code must retain the copyright
  80. * notice, this list of conditions and the following disclaimer.
  81. * 2. Redistributions in binary form must reproduce the above copyright
  82. * notice, this list of conditions and the following disclaimer in the
  83. * documentation and/or other materials provided with the distribution.
  84. * 3. All advertising materials mentioning features or use of this software
  85. * must display the following acknowledgement:
  86. * "This product includes cryptographic software written by
  87. * Eric Young (eay@cryptsoft.com)"
  88. * The word 'cryptographic' can be left out if the rouines from the library
  89. * being used are not cryptographic related :-).
  90. * 4. If you include any Windows specific code (or a derivative thereof) from
  91. * the apps directory (application code) you must include an acknowledgement:
  92. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  93. *
  94. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  95. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  96. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  97. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  98. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  99. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  100. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  101. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  102. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  103. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  104. * SUCH DAMAGE.
  105. *
  106. * The licence and distribution terms for any publically available version or
  107. * derivative of this code cannot be changed. i.e. this code cannot simply be
  108. * copied and put under another distribution licence
  109. * [including the GNU Public Licence.]
  110. */
  111. #include <stdio.h>
  112. #include "cryptlib.h"
  113. #include "bn_lcl.h"
  114. #define BN_BLINDING_COUNTER 32
  115. struct bn_blinding_st {
  116. BIGNUM *A;
  117. BIGNUM *Ai;
  118. BIGNUM *e;
  119. BIGNUM *mod; /* just a reference */
  120. #ifndef OPENSSL_NO_DEPRECATED
  121. unsigned long thread_id; /* added in OpenSSL 0.9.6j and 0.9.7b; used
  122. * only by crypto/rsa/rsa_eay.c, rsa_lib.c */
  123. #endif
  124. CRYPTO_THREADID tid;
  125. int counter;
  126. unsigned long flags;
  127. BN_MONT_CTX *m_ctx;
  128. int (*bn_mod_exp) (BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
  129. const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
  130. };
  131. BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod)
  132. {
  133. BN_BLINDING *ret = NULL;
  134. bn_check_top(mod);
  135. if ((ret = (BN_BLINDING *)OPENSSL_malloc(sizeof(BN_BLINDING))) == NULL) {
  136. BNerr(BN_F_BN_BLINDING_NEW, ERR_R_MALLOC_FAILURE);
  137. return (NULL);
  138. }
  139. memset(ret, 0, sizeof(BN_BLINDING));
  140. if (A != NULL) {
  141. if ((ret->A = BN_dup(A)) == NULL)
  142. goto err;
  143. }
  144. if (Ai != NULL) {
  145. if ((ret->Ai = BN_dup(Ai)) == NULL)
  146. goto err;
  147. }
  148. /* save a copy of mod in the BN_BLINDING structure */
  149. if ((ret->mod = BN_dup(mod)) == NULL)
  150. goto err;
  151. if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0)
  152. BN_set_flags(ret->mod, BN_FLG_CONSTTIME);
  153. /*
  154. * Set the counter to the special value -1 to indicate that this is
  155. * never-used fresh blinding that does not need updating before first
  156. * use.
  157. */
  158. ret->counter = -1;
  159. CRYPTO_THREADID_current(&ret->tid);
  160. return (ret);
  161. err:
  162. if (ret != NULL)
  163. BN_BLINDING_free(ret);
  164. return (NULL);
  165. }
  166. void BN_BLINDING_free(BN_BLINDING *r)
  167. {
  168. if (r == NULL)
  169. return;
  170. if (r->A != NULL)
  171. BN_free(r->A);
  172. if (r->Ai != NULL)
  173. BN_free(r->Ai);
  174. if (r->e != NULL)
  175. BN_free(r->e);
  176. if (r->mod != NULL)
  177. BN_free(r->mod);
  178. OPENSSL_free(r);
  179. }
  180. int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx)
  181. {
  182. int ret = 0;
  183. if ((b->A == NULL) || (b->Ai == NULL)) {
  184. BNerr(BN_F_BN_BLINDING_UPDATE, BN_R_NOT_INITIALIZED);
  185. goto err;
  186. }
  187. if (b->counter == -1)
  188. b->counter = 0;
  189. if (++b->counter == BN_BLINDING_COUNTER && b->e != NULL &&
  190. !(b->flags & BN_BLINDING_NO_RECREATE)) {
  191. /* re-create blinding parameters */
  192. if (!BN_BLINDING_create_param(b, NULL, NULL, ctx, NULL, NULL))
  193. goto err;
  194. } else if (!(b->flags & BN_BLINDING_NO_UPDATE)) {
  195. if (!BN_mod_mul(b->A, b->A, b->A, b->mod, ctx))
  196. goto err;
  197. if (!BN_mod_mul(b->Ai, b->Ai, b->Ai, b->mod, ctx))
  198. goto err;
  199. }
  200. ret = 1;
  201. err:
  202. if (b->counter == BN_BLINDING_COUNTER)
  203. b->counter = 0;
  204. return (ret);
  205. }
  206. int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
  207. {
  208. return BN_BLINDING_convert_ex(n, NULL, b, ctx);
  209. }
  210. int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
  211. {
  212. int ret = 1;
  213. bn_check_top(n);
  214. if ((b->A == NULL) || (b->Ai == NULL)) {
  215. BNerr(BN_F_BN_BLINDING_CONVERT_EX, BN_R_NOT_INITIALIZED);
  216. return (0);
  217. }
  218. if (b->counter == -1)
  219. /* Fresh blinding, doesn't need updating. */
  220. b->counter = 0;
  221. else if (!BN_BLINDING_update(b, ctx))
  222. return (0);
  223. if (r != NULL) {
  224. if (!BN_copy(r, b->Ai))
  225. ret = 0;
  226. }
  227. if (!BN_mod_mul(n, n, b->A, b->mod, ctx))
  228. ret = 0;
  229. return ret;
  230. }
  231. int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
  232. {
  233. return BN_BLINDING_invert_ex(n, NULL, b, ctx);
  234. }
  235. int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
  236. BN_CTX *ctx)
  237. {
  238. int ret;
  239. bn_check_top(n);
  240. if (r != NULL)
  241. ret = BN_mod_mul(n, n, r, b->mod, ctx);
  242. else {
  243. if (b->Ai == NULL) {
  244. BNerr(BN_F_BN_BLINDING_INVERT_EX, BN_R_NOT_INITIALIZED);
  245. return (0);
  246. }
  247. ret = BN_mod_mul(n, n, b->Ai, b->mod, ctx);
  248. }
  249. bn_check_top(n);
  250. return (ret);
  251. }
  252. #ifndef OPENSSL_NO_DEPRECATED
  253. unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *b)
  254. {
  255. return b->thread_id;
  256. }
  257. void BN_BLINDING_set_thread_id(BN_BLINDING *b, unsigned long n)
  258. {
  259. b->thread_id = n;
  260. }
  261. #endif
  262. CRYPTO_THREADID *BN_BLINDING_thread_id(BN_BLINDING *b)
  263. {
  264. return &b->tid;
  265. }
  266. unsigned long BN_BLINDING_get_flags(const BN_BLINDING *b)
  267. {
  268. return b->flags;
  269. }
  270. void BN_BLINDING_set_flags(BN_BLINDING *b, unsigned long flags)
  271. {
  272. b->flags = flags;
  273. }
  274. BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
  275. const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
  276. int (*bn_mod_exp) (BIGNUM *r,
  277. const BIGNUM *a,
  278. const BIGNUM *p,
  279. const BIGNUM *m,
  280. BN_CTX *ctx,
  281. BN_MONT_CTX *m_ctx),
  282. BN_MONT_CTX *m_ctx)
  283. {
  284. int retry_counter = 32;
  285. BN_BLINDING *ret = NULL;
  286. if (b == NULL)
  287. ret = BN_BLINDING_new(NULL, NULL, m);
  288. else
  289. ret = b;
  290. if (ret == NULL)
  291. goto err;
  292. if (ret->A == NULL && (ret->A = BN_new()) == NULL)
  293. goto err;
  294. if (ret->Ai == NULL && (ret->Ai = BN_new()) == NULL)
  295. goto err;
  296. if (e != NULL) {
  297. if (ret->e != NULL)
  298. BN_free(ret->e);
  299. ret->e = BN_dup(e);
  300. }
  301. if (ret->e == NULL)
  302. goto err;
  303. if (bn_mod_exp != NULL)
  304. ret->bn_mod_exp = bn_mod_exp;
  305. if (m_ctx != NULL)
  306. ret->m_ctx = m_ctx;
  307. do {
  308. if (!BN_rand_range(ret->A, ret->mod))
  309. goto err;
  310. if (BN_mod_inverse(ret->Ai, ret->A, ret->mod, ctx) == NULL) {
  311. /*
  312. * this should almost never happen for good RSA keys
  313. */
  314. unsigned long error = ERR_peek_last_error();
  315. if (ERR_GET_REASON(error) == BN_R_NO_INVERSE) {
  316. if (retry_counter-- == 0) {
  317. BNerr(BN_F_BN_BLINDING_CREATE_PARAM,
  318. BN_R_TOO_MANY_ITERATIONS);
  319. goto err;
  320. }
  321. ERR_clear_error();
  322. } else
  323. goto err;
  324. } else
  325. break;
  326. } while (1);
  327. if (ret->bn_mod_exp != NULL && ret->m_ctx != NULL) {
  328. if (!ret->bn_mod_exp
  329. (ret->A, ret->A, ret->e, ret->mod, ctx, ret->m_ctx))
  330. goto err;
  331. } else {
  332. if (!BN_mod_exp(ret->A, ret->A, ret->e, ret->mod, ctx))
  333. goto err;
  334. }
  335. return ret;
  336. err:
  337. if (b == NULL && ret != NULL) {
  338. BN_BLINDING_free(ret);
  339. ret = NULL;
  340. }
  341. return ret;
  342. }