1 /* crypto/ec/ecp_mont.c */
2 /* ====================================================================
3 * Copyright (c) 1998-2001 The OpenSSL Project. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
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
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/)"
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.
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.
31 * 6. Redistributions of any form whatsoever must retain the following
33 * "This product includes software developed by the OpenSSL Project
34 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
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 * ====================================================================
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).
56 #include <openssl/err.h>
61 const EC_METHOD *EC_GFp_mont_method(void)
63 static const EC_METHOD ret = {
64 ec_GFp_mont_group_init,
65 ec_GFp_mont_group_finish,
66 ec_GFp_mont_group_clear_finish,
67 ec_GFp_mont_group_copy,
68 ec_GFp_mont_group_set_curve_GFp,
69 ec_GFp_simple_group_get_curve_GFp,
70 ec_GFp_simple_group_set_generator,
71 ec_GFp_simple_group_get0_generator,
72 ec_GFp_simple_group_get_order,
73 ec_GFp_simple_group_get_cofactor,
74 ec_GFp_simple_group_check,
75 ec_GFp_simple_point_init,
76 ec_GFp_simple_point_finish,
77 ec_GFp_simple_point_clear_finish,
78 ec_GFp_simple_point_copy,
79 ec_GFp_simple_point_set_to_infinity,
80 ec_GFp_simple_set_Jprojective_coordinates_GFp,
81 ec_GFp_simple_get_Jprojective_coordinates_GFp,
82 ec_GFp_simple_point_set_affine_coordinates_GFp,
83 ec_GFp_simple_point_get_affine_coordinates_GFp,
84 ec_GFp_simple_set_compressed_coordinates_GFp,
85 ec_GFp_simple_point2oct,
86 ec_GFp_simple_oct2point,
90 ec_GFp_simple_is_at_infinity,
91 ec_GFp_simple_is_on_curve,
93 ec_GFp_simple_make_affine,
94 ec_GFp_simple_points_make_affine,
95 ec_GFp_mont_field_mul,
96 ec_GFp_mont_field_sqr,
97 ec_GFp_mont_field_encode,
98 ec_GFp_mont_field_decode,
99 ec_GFp_mont_field_set_to_one };
105 int ec_GFp_mont_group_init(EC_GROUP *group)
109 ok = ec_GFp_simple_group_init(group);
110 group->field_data1 = NULL;
111 group->field_data2 = NULL;
116 int ec_GFp_mont_group_set_curve_GFp(EC_GROUP *group, const BIGNUM *p, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
118 BN_CTX *new_ctx = NULL;
119 BN_MONT_CTX *mont = NULL;
123 if (group->field_data1 != NULL)
125 BN_MONT_CTX_free(group->field_data1);
126 group->field_data1 = NULL;
128 if (group->field_data2 != NULL)
130 BN_free(group->field_data2);
131 group->field_data2 = NULL;
136 ctx = new_ctx = BN_CTX_new();
141 mont = BN_MONT_CTX_new();
142 if (mont == NULL) goto err;
143 if (!BN_MONT_CTX_set(mont, p, ctx))
145 ECerr(EC_F_GFP_MONT_GROUP_SET_CURVE_GFP, ERR_R_BN_LIB);
149 if (one == NULL) goto err;
150 if (!BN_to_montgomery(one, BN_value_one(), mont, ctx)) goto err;
152 group->field_data1 = mont;
154 group->field_data2 = one;
157 ret = ec_GFp_simple_group_set_curve_GFp(group, p, a, b, ctx);
161 BN_MONT_CTX_free(group->field_data1);
162 group->field_data1 = NULL;
163 BN_free(group->field_data2);
164 group->field_data2 = NULL;
169 BN_CTX_free(new_ctx);
171 BN_MONT_CTX_free(mont);
176 void ec_GFp_mont_group_finish(EC_GROUP *group)
178 if (group->field_data1 != NULL)
180 BN_MONT_CTX_free(group->field_data1);
181 group->field_data1 = NULL;
183 if (group->field_data2 != NULL)
185 BN_free(group->field_data2);
186 group->field_data2 = NULL;
188 ec_GFp_simple_group_finish(group);
192 void ec_GFp_mont_group_clear_finish(EC_GROUP *group)
194 if (group->field_data1 != NULL)
196 BN_MONT_CTX_free(group->field_data1);
197 group->field_data1 = NULL;
199 if (group->field_data2 != NULL)
201 BN_clear_free(group->field_data2);
202 group->field_data2 = NULL;
204 ec_GFp_simple_group_clear_finish(group);
208 int ec_GFp_mont_group_copy(EC_GROUP *dest, const EC_GROUP *src)
210 if (dest->field_data1 != NULL)
212 BN_MONT_CTX_free(dest->field_data1);
213 dest->field_data1 = NULL;
215 if (dest->field_data2 != NULL)
217 BN_clear_free(dest->field_data2);
218 dest->field_data2 = NULL;
221 if (!ec_GFp_simple_group_copy(dest, src)) return 0;
223 if (src->field_data1 != NULL)
225 dest->field_data1 = BN_MONT_CTX_new();
226 if (dest->field_data1 == NULL) return 0;
227 if (!BN_MONT_CTX_copy(dest->field_data1, src->field_data1)) goto err;
229 if (src->field_data2 != NULL)
231 dest->field_data2 = BN_dup(src->field_data2);
232 if (dest->field_data2 == NULL) goto err;
238 if (dest->field_data1 != NULL)
240 BN_MONT_CTX_free(dest->field_data1);
241 dest->field_data1 = NULL;
247 int ec_GFp_mont_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
249 if (group->field_data1 == NULL)
251 ECerr(EC_F_EC_GFP_MONT_FIELD_MUL, EC_R_NOT_INITIALIZED);
255 return BN_mod_mul_montgomery(r, a, b, group->field_data1, ctx);
259 int ec_GFp_mont_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
261 if (group->field_data1 == NULL)
263 ECerr(EC_F_EC_GFP_MONT_FIELD_SQR, EC_R_NOT_INITIALIZED);
267 return BN_mod_mul_montgomery(r, a, a, group->field_data1, ctx);
271 int ec_GFp_mont_field_encode(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
273 if (group->field_data1 == NULL)
275 ECerr(EC_F_EC_GFP_MONT_FIELD_ENCODE, EC_R_NOT_INITIALIZED);
279 return BN_to_montgomery(r, a, (BN_MONT_CTX *)group->field_data1, ctx);
283 int ec_GFp_mont_field_decode(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
285 if (group->field_data1 == NULL)
287 ECerr(EC_F_EC_GFP_MONT_FIELD_DECODE, EC_R_NOT_INITIALIZED);
291 return BN_from_montgomery(r, a, group->field_data1, ctx);
295 int ec_GFp_mont_field_set_to_one(const EC_GROUP *group, BIGNUM *r, BN_CTX *ctx)
297 if (group->field_data2 == NULL)
299 ECerr(EC_F_EC_GFP_MONT_FIELD_DECODE, EC_R_NOT_INITIALIZED);
303 if (!BN_copy(r, group->field_data2)) return 0;