You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

281 lines
7.9 KiB

  1. /* Originally written by Bodo Moeller and Nils Larsch for the OpenSSL project.
  2. * ====================================================================
  3. * Copyright (c) 1998-2005 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. /* ====================================================================
  56. * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
  57. *
  58. * Portions of the attached software ("Contribution") are developed by
  59. * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
  60. *
  61. * The Contribution is licensed pursuant to the OpenSSL open source
  62. * license provided above.
  63. *
  64. * The elliptic curve binary polynomial software is originally written by
  65. * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems
  66. * Laboratories. */
  67. #include <openssl/ec.h>
  68. #include <openssl/bn.h>
  69. #include <openssl/err.h>
  70. #include <openssl/mem.h>
  71. #include "internal.h"
  72. int ec_GFp_mont_group_init(EC_GROUP *group) {
  73. int ok;
  74. ok = ec_GFp_simple_group_init(group);
  75. group->mont = NULL;
  76. group->one = NULL;
  77. return ok;
  78. }
  79. void ec_GFp_mont_group_finish(EC_GROUP *group) {
  80. BN_MONT_CTX_free(group->mont);
  81. group->mont = NULL;
  82. BN_free(group->one);
  83. group->one = NULL;
  84. ec_GFp_simple_group_finish(group);
  85. }
  86. void ec_GFp_mont_group_clear_finish(EC_GROUP *group) {
  87. BN_MONT_CTX_free(group->mont);
  88. group->mont = NULL;
  89. BN_clear_free(group->one);
  90. group->one = NULL;
  91. ec_GFp_simple_group_clear_finish(group);
  92. }
  93. int ec_GFp_mont_group_copy(EC_GROUP *dest, const EC_GROUP *src) {
  94. BN_MONT_CTX_free(dest->mont);
  95. dest->mont = NULL;
  96. BN_clear_free(dest->one);
  97. dest->one = NULL;
  98. if (!ec_GFp_simple_group_copy(dest, src)) {
  99. return 0;
  100. }
  101. if (src->mont != NULL) {
  102. dest->mont = BN_MONT_CTX_new();
  103. if (dest->mont == NULL) {
  104. return 0;
  105. }
  106. if (!BN_MONT_CTX_copy(dest->mont, src->mont)) {
  107. goto err;
  108. }
  109. }
  110. if (src->one != NULL) {
  111. dest->one = BN_dup(src->one);
  112. if (dest->one == NULL) {
  113. goto err;
  114. }
  115. }
  116. return 1;
  117. err:
  118. BN_MONT_CTX_free(dest->mont);
  119. dest->mont = NULL;
  120. return 0;
  121. }
  122. int ec_GFp_mont_group_set_curve(EC_GROUP *group, const BIGNUM *p,
  123. const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx) {
  124. BN_CTX *new_ctx = NULL;
  125. BN_MONT_CTX *mont = NULL;
  126. BIGNUM *one = NULL;
  127. int ret = 0;
  128. BN_MONT_CTX_free(group->mont);
  129. group->mont = NULL;
  130. BN_free(group->one);
  131. group->one = NULL;
  132. if (ctx == NULL) {
  133. ctx = new_ctx = BN_CTX_new();
  134. if (ctx == NULL) {
  135. return 0;
  136. }
  137. }
  138. mont = BN_MONT_CTX_new();
  139. if (mont == NULL) {
  140. goto err;
  141. }
  142. if (!BN_MONT_CTX_set(mont, p, ctx)) {
  143. OPENSSL_PUT_ERROR(EC, ERR_R_BN_LIB);
  144. goto err;
  145. }
  146. one = BN_new();
  147. if (one == NULL || !BN_to_montgomery(one, BN_value_one(), mont, ctx)) {
  148. goto err;
  149. }
  150. group->mont = mont;
  151. mont = NULL;
  152. group->one = one;
  153. one = NULL;
  154. ret = ec_GFp_simple_group_set_curve(group, p, a, b, ctx);
  155. if (!ret) {
  156. BN_MONT_CTX_free(group->mont);
  157. group->mont = NULL;
  158. BN_free(group->one);
  159. group->one = NULL;
  160. }
  161. err:
  162. BN_CTX_free(new_ctx);
  163. BN_MONT_CTX_free(mont);
  164. BN_free(one);
  165. return ret;
  166. }
  167. int ec_GFp_mont_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
  168. const BIGNUM *b, BN_CTX *ctx) {
  169. if (group->mont == NULL) {
  170. OPENSSL_PUT_ERROR(EC, EC_R_NOT_INITIALIZED);
  171. return 0;
  172. }
  173. return BN_mod_mul_montgomery(r, a, b, group->mont, ctx);
  174. }
  175. int ec_GFp_mont_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
  176. BN_CTX *ctx) {
  177. if (group->mont == NULL) {
  178. OPENSSL_PUT_ERROR(EC, EC_R_NOT_INITIALIZED);
  179. return 0;
  180. }
  181. return BN_mod_mul_montgomery(r, a, a, group->mont, ctx);
  182. }
  183. int ec_GFp_mont_field_encode(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
  184. BN_CTX *ctx) {
  185. if (group->mont == NULL) {
  186. OPENSSL_PUT_ERROR(EC, EC_R_NOT_INITIALIZED);
  187. return 0;
  188. }
  189. return BN_to_montgomery(r, a, group->mont, ctx);
  190. }
  191. int ec_GFp_mont_field_decode(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
  192. BN_CTX *ctx) {
  193. if (group->mont == NULL) {
  194. OPENSSL_PUT_ERROR(EC, EC_R_NOT_INITIALIZED);
  195. return 0;
  196. }
  197. return BN_from_montgomery(r, a, group->mont, ctx);
  198. }
  199. int ec_GFp_mont_field_set_to_one(const EC_GROUP *group, BIGNUM *r,
  200. BN_CTX *ctx) {
  201. if (group->one == NULL) {
  202. OPENSSL_PUT_ERROR(EC, EC_R_NOT_INITIALIZED);
  203. return 0;
  204. }
  205. if (!BN_copy(r, group->one)) {
  206. return 0;
  207. }
  208. return 1;
  209. }
  210. static int ec_GFp_mont_check_pub_key_order(const EC_GROUP *group,
  211. const EC_POINT* pub_key,
  212. BN_CTX *ctx) {
  213. EC_POINT *point = EC_POINT_new(group);
  214. int ret = 0;
  215. if (point == NULL ||
  216. !ec_wNAF_mul(group, point, NULL, pub_key, EC_GROUP_get0_order(group),
  217. ctx) ||
  218. !EC_POINT_is_at_infinity(group, point)) {
  219. goto err;
  220. }
  221. ret = 1;
  222. err:
  223. EC_POINT_free(point);
  224. return ret;
  225. }
  226. const EC_METHOD *EC_GFp_mont_method(void) {
  227. static const EC_METHOD ret = {
  228. ec_GFp_mont_group_init,
  229. ec_GFp_mont_group_finish,
  230. ec_GFp_mont_group_clear_finish,
  231. ec_GFp_mont_group_copy,
  232. ec_GFp_mont_group_set_curve,
  233. ec_GFp_simple_point_get_affine_coordinates,
  234. ec_wNAF_mul /* XXX: Not constant time. */,
  235. ec_GFp_mont_check_pub_key_order,
  236. ec_GFp_mont_field_mul,
  237. ec_GFp_mont_field_sqr,
  238. ec_GFp_mont_field_encode,
  239. ec_GFp_mont_field_decode,
  240. ec_GFp_mont_field_set_to_one,
  241. };
  242. return &ret;
  243. }