diff options
Diffstat (limited to 'src/lib/libcrypto/ec/ecp_mont.c')
| -rw-r--r-- | src/lib/libcrypto/ec/ecp_mont.c | 294 |
1 files changed, 0 insertions, 294 deletions
diff --git a/src/lib/libcrypto/ec/ecp_mont.c b/src/lib/libcrypto/ec/ecp_mont.c deleted file mode 100644 index a3ad4e1ce9..0000000000 --- a/src/lib/libcrypto/ec/ecp_mont.c +++ /dev/null | |||
| @@ -1,294 +0,0 @@ | |||
| 1 | /* $OpenBSD: ecp_mont.c,v 1.10 2015/02/13 00:46:03 beck Exp $ */ | ||
| 2 | /* | ||
| 3 | * Originally written by Bodo Moeller for the OpenSSL project. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1998-2001 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.openssl.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * openssl-core@openssl.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.openssl.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | /* ==================================================================== | ||
| 59 | * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED. | ||
| 60 | * Portions of this software developed by SUN MICROSYSTEMS, INC., | ||
| 61 | * and contributed to the OpenSSL project. | ||
| 62 | */ | ||
| 63 | |||
| 64 | #include <openssl/err.h> | ||
| 65 | |||
| 66 | #include "ec_lcl.h" | ||
| 67 | |||
| 68 | |||
| 69 | const EC_METHOD * | ||
| 70 | EC_GFp_mont_method(void) | ||
| 71 | { | ||
| 72 | static const EC_METHOD ret = { | ||
| 73 | .flags = EC_FLAGS_DEFAULT_OCT, | ||
| 74 | .field_type = NID_X9_62_prime_field, | ||
| 75 | .group_init = ec_GFp_mont_group_init, | ||
| 76 | .group_finish = ec_GFp_mont_group_finish, | ||
| 77 | .group_clear_finish = ec_GFp_mont_group_clear_finish, | ||
| 78 | .group_copy = ec_GFp_mont_group_copy, | ||
| 79 | .group_set_curve = ec_GFp_mont_group_set_curve, | ||
| 80 | .group_get_curve = ec_GFp_simple_group_get_curve, | ||
| 81 | .group_get_degree = ec_GFp_simple_group_get_degree, | ||
| 82 | .group_check_discriminant = | ||
| 83 | ec_GFp_simple_group_check_discriminant, | ||
| 84 | .point_init = ec_GFp_simple_point_init, | ||
| 85 | .point_finish = ec_GFp_simple_point_finish, | ||
| 86 | .point_clear_finish = ec_GFp_simple_point_clear_finish, | ||
| 87 | .point_copy = ec_GFp_simple_point_copy, | ||
| 88 | .point_set_to_infinity = ec_GFp_simple_point_set_to_infinity, | ||
| 89 | .point_set_Jprojective_coordinates_GFp = | ||
| 90 | ec_GFp_simple_set_Jprojective_coordinates_GFp, | ||
| 91 | .point_get_Jprojective_coordinates_GFp = | ||
| 92 | ec_GFp_simple_get_Jprojective_coordinates_GFp, | ||
| 93 | .point_set_affine_coordinates = | ||
| 94 | ec_GFp_simple_point_set_affine_coordinates, | ||
| 95 | .point_get_affine_coordinates = | ||
| 96 | ec_GFp_simple_point_get_affine_coordinates, | ||
| 97 | .add = ec_GFp_simple_add, | ||
| 98 | .dbl = ec_GFp_simple_dbl, | ||
| 99 | .invert = ec_GFp_simple_invert, | ||
| 100 | .is_at_infinity = ec_GFp_simple_is_at_infinity, | ||
| 101 | .is_on_curve = ec_GFp_simple_is_on_curve, | ||
| 102 | .point_cmp = ec_GFp_simple_cmp, | ||
| 103 | .make_affine = ec_GFp_simple_make_affine, | ||
| 104 | .points_make_affine = ec_GFp_simple_points_make_affine, | ||
| 105 | .field_mul = ec_GFp_mont_field_mul, | ||
| 106 | .field_sqr = ec_GFp_mont_field_sqr, | ||
| 107 | .field_encode = ec_GFp_mont_field_encode, | ||
| 108 | .field_decode = ec_GFp_mont_field_decode, | ||
| 109 | .field_set_to_one = ec_GFp_mont_field_set_to_one | ||
| 110 | }; | ||
| 111 | |||
| 112 | return &ret; | ||
| 113 | } | ||
| 114 | |||
| 115 | |||
| 116 | int | ||
| 117 | ec_GFp_mont_group_init(EC_GROUP * group) | ||
| 118 | { | ||
| 119 | int ok; | ||
| 120 | |||
| 121 | ok = ec_GFp_simple_group_init(group); | ||
| 122 | group->field_data1 = NULL; | ||
| 123 | group->field_data2 = NULL; | ||
| 124 | return ok; | ||
| 125 | } | ||
| 126 | |||
| 127 | |||
| 128 | void | ||
| 129 | ec_GFp_mont_group_finish(EC_GROUP * group) | ||
| 130 | { | ||
| 131 | BN_MONT_CTX_free(group->field_data1); | ||
| 132 | group->field_data1 = NULL; | ||
| 133 | BN_free(group->field_data2); | ||
| 134 | group->field_data2 = NULL; | ||
| 135 | ec_GFp_simple_group_finish(group); | ||
| 136 | } | ||
| 137 | |||
| 138 | |||
| 139 | void | ||
| 140 | ec_GFp_mont_group_clear_finish(EC_GROUP * group) | ||
| 141 | { | ||
| 142 | BN_MONT_CTX_free(group->field_data1); | ||
| 143 | group->field_data1 = NULL; | ||
| 144 | BN_clear_free(group->field_data2); | ||
| 145 | group->field_data2 = NULL; | ||
| 146 | ec_GFp_simple_group_clear_finish(group); | ||
| 147 | } | ||
| 148 | |||
| 149 | |||
| 150 | int | ||
| 151 | ec_GFp_mont_group_copy(EC_GROUP * dest, const EC_GROUP * src) | ||
| 152 | { | ||
| 153 | BN_MONT_CTX_free(dest->field_data1); | ||
| 154 | dest->field_data1 = NULL; | ||
| 155 | BN_clear_free(dest->field_data2); | ||
| 156 | dest->field_data2 = NULL; | ||
| 157 | |||
| 158 | if (!ec_GFp_simple_group_copy(dest, src)) | ||
| 159 | return 0; | ||
| 160 | |||
| 161 | if (src->field_data1 != NULL) { | ||
| 162 | dest->field_data1 = BN_MONT_CTX_new(); | ||
| 163 | if (dest->field_data1 == NULL) | ||
| 164 | return 0; | ||
| 165 | if (!BN_MONT_CTX_copy(dest->field_data1, src->field_data1)) | ||
| 166 | goto err; | ||
| 167 | } | ||
| 168 | if (src->field_data2 != NULL) { | ||
| 169 | dest->field_data2 = BN_dup(src->field_data2); | ||
| 170 | if (dest->field_data2 == NULL) | ||
| 171 | goto err; | ||
| 172 | } | ||
| 173 | return 1; | ||
| 174 | |||
| 175 | err: | ||
| 176 | if (dest->field_data1 != NULL) { | ||
| 177 | BN_MONT_CTX_free(dest->field_data1); | ||
| 178 | dest->field_data1 = NULL; | ||
| 179 | } | ||
| 180 | return 0; | ||
| 181 | } | ||
| 182 | |||
| 183 | |||
| 184 | int | ||
| 185 | ec_GFp_mont_group_set_curve(EC_GROUP *group, const BIGNUM *p, const BIGNUM *a, | ||
| 186 | const BIGNUM *b, BN_CTX *ctx) | ||
| 187 | { | ||
| 188 | BN_CTX *new_ctx = NULL; | ||
| 189 | BN_MONT_CTX *mont = NULL; | ||
| 190 | BIGNUM *one = NULL; | ||
| 191 | int ret = 0; | ||
| 192 | |||
| 193 | BN_MONT_CTX_free(group->field_data1); | ||
| 194 | group->field_data1 = NULL; | ||
| 195 | BN_free(group->field_data2); | ||
| 196 | group->field_data2 = NULL; | ||
| 197 | if (ctx == NULL) { | ||
| 198 | ctx = new_ctx = BN_CTX_new(); | ||
| 199 | if (ctx == NULL) | ||
| 200 | return 0; | ||
| 201 | } | ||
| 202 | mont = BN_MONT_CTX_new(); | ||
| 203 | if (mont == NULL) | ||
| 204 | goto err; | ||
| 205 | if (!BN_MONT_CTX_set(mont, p, ctx)) { | ||
| 206 | ECerr(EC_F_EC_GFP_MONT_GROUP_SET_CURVE, ERR_R_BN_LIB); | ||
| 207 | goto err; | ||
| 208 | } | ||
| 209 | one = BN_new(); | ||
| 210 | if (one == NULL) | ||
| 211 | goto err; | ||
| 212 | if (!BN_to_montgomery(one, BN_value_one(), mont, ctx)) | ||
| 213 | goto err; | ||
| 214 | |||
| 215 | group->field_data1 = mont; | ||
| 216 | mont = NULL; | ||
| 217 | group->field_data2 = one; | ||
| 218 | one = NULL; | ||
| 219 | |||
| 220 | ret = ec_GFp_simple_group_set_curve(group, p, a, b, ctx); | ||
| 221 | |||
| 222 | if (!ret) { | ||
| 223 | BN_MONT_CTX_free(group->field_data1); | ||
| 224 | group->field_data1 = NULL; | ||
| 225 | BN_free(group->field_data2); | ||
| 226 | group->field_data2 = NULL; | ||
| 227 | } | ||
| 228 | err: | ||
| 229 | BN_CTX_free(new_ctx); | ||
| 230 | BN_MONT_CTX_free(mont); | ||
| 231 | BN_free(one); | ||
| 232 | return ret; | ||
| 233 | } | ||
| 234 | |||
| 235 | |||
| 236 | int | ||
| 237 | ec_GFp_mont_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a, | ||
| 238 | const BIGNUM *b, BN_CTX *ctx) | ||
| 239 | { | ||
| 240 | if (group->field_data1 == NULL) { | ||
| 241 | ECerr(EC_F_EC_GFP_MONT_FIELD_MUL, EC_R_NOT_INITIALIZED); | ||
| 242 | return 0; | ||
| 243 | } | ||
| 244 | return BN_mod_mul_montgomery(r, a, b, group->field_data1, ctx); | ||
| 245 | } | ||
| 246 | |||
| 247 | |||
| 248 | int | ||
| 249 | ec_GFp_mont_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a, | ||
| 250 | BN_CTX *ctx) | ||
| 251 | { | ||
| 252 | if (group->field_data1 == NULL) { | ||
| 253 | ECerr(EC_F_EC_GFP_MONT_FIELD_SQR, EC_R_NOT_INITIALIZED); | ||
| 254 | return 0; | ||
| 255 | } | ||
| 256 | return BN_mod_mul_montgomery(r, a, a, group->field_data1, ctx); | ||
| 257 | } | ||
| 258 | |||
| 259 | |||
| 260 | int | ||
| 261 | ec_GFp_mont_field_encode(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a, | ||
| 262 | BN_CTX *ctx) | ||
| 263 | { | ||
| 264 | if (group->field_data1 == NULL) { | ||
| 265 | ECerr(EC_F_EC_GFP_MONT_FIELD_ENCODE, EC_R_NOT_INITIALIZED); | ||
| 266 | return 0; | ||
| 267 | } | ||
| 268 | return BN_to_montgomery(r, a, (BN_MONT_CTX *) group->field_data1, ctx); | ||
| 269 | } | ||
| 270 | |||
| 271 | |||
| 272 | int | ||
| 273 | ec_GFp_mont_field_decode(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a, | ||
| 274 | BN_CTX *ctx) | ||
| 275 | { | ||
| 276 | if (group->field_data1 == NULL) { | ||
| 277 | ECerr(EC_F_EC_GFP_MONT_FIELD_DECODE, EC_R_NOT_INITIALIZED); | ||
| 278 | return 0; | ||
| 279 | } | ||
| 280 | return BN_from_montgomery(r, a, group->field_data1, ctx); | ||
| 281 | } | ||
| 282 | |||
| 283 | |||
| 284 | int | ||
| 285 | ec_GFp_mont_field_set_to_one(const EC_GROUP *group, BIGNUM *r, BN_CTX *ctx) | ||
| 286 | { | ||
| 287 | if (group->field_data2 == NULL) { | ||
| 288 | ECerr(EC_F_EC_GFP_MONT_FIELD_SET_TO_ONE, EC_R_NOT_INITIALIZED); | ||
| 289 | return 0; | ||
| 290 | } | ||
| 291 | if (!BN_copy(r, group->field_data2)) | ||
| 292 | return 0; | ||
| 293 | return 1; | ||
| 294 | } | ||
