2 * Originally written by Bodo Moeller for the OpenSSL project.
4 /* ====================================================================
5 * Copyright (c) 1998-2001 The OpenSSL Project. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in
16 * the documentation and/or other materials provided with the
19 * 3. All advertising materials mentioning features or use of this
20 * software must display the following acknowledgment:
21 * "This product includes software developed by the OpenSSL Project
22 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
24 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
25 * endorse or promote products derived from this software without
26 * prior written permission. For written permission, please contact
27 * openssl-core@openssl.org.
29 * 5. Products derived from this software may not be called "OpenSSL"
30 * nor may "OpenSSL" appear in their names without prior written
31 * permission of the OpenSSL Project.
33 * 6. Redistributions of any form whatsoever must retain the following
35 * "This product includes software developed by the OpenSSL Project
36 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
38 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
39 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
40 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
41 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
42 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
43 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
44 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
45 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
46 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
47 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
48 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
49 * OF THE POSSIBILITY OF SUCH DAMAGE.
50 * ====================================================================
52 * This product includes cryptographic software written by Eric Young
53 * (eay@cryptsoft.com). This product includes software written by Tim
54 * Hudson (tjh@cryptsoft.com).
57 /* ====================================================================
58 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
59 * Portions of this software developed by SUN MICROSYSTEMS, INC.,
60 * and contributed to the OpenSSL project.
63 #include <openssl/err.h>
67 const EC_METHOD *EC_GFp_mont_method(void)
69 static const EC_METHOD ret = {
71 NID_X9_62_prime_field,
72 ec_GFp_mont_group_init,
73 ec_GFp_mont_group_finish,
74 ec_GFp_mont_group_clear_finish,
75 ec_GFp_mont_group_copy,
76 ec_GFp_mont_group_set_curve,
77 ec_GFp_simple_group_get_curve,
78 ec_GFp_simple_group_get_degree,
79 ec_GFp_simple_group_check_discriminant,
80 ec_GFp_simple_point_init,
81 ec_GFp_simple_point_finish,
82 ec_GFp_simple_point_clear_finish,
83 ec_GFp_simple_point_copy,
84 ec_GFp_simple_point_set_to_infinity,
85 ec_GFp_simple_set_Jprojective_coordinates_GFp,
86 ec_GFp_simple_get_Jprojective_coordinates_GFp,
87 ec_GFp_simple_point_set_affine_coordinates,
88 ec_GFp_simple_point_get_affine_coordinates,
93 ec_GFp_simple_is_at_infinity,
94 ec_GFp_simple_is_on_curve,
96 ec_GFp_simple_make_affine,
97 ec_GFp_simple_points_make_affine,
99 0 /* precompute_mult */ ,
100 0 /* have_precompute_mult */ ,
101 ec_GFp_mont_field_mul,
102 ec_GFp_mont_field_sqr,
104 ec_GFp_mont_field_encode,
105 ec_GFp_mont_field_decode,
106 ec_GFp_mont_field_set_to_one
112 int ec_GFp_mont_group_init(EC_GROUP *group)
116 ok = ec_GFp_simple_group_init(group);
117 group->field_data1 = NULL;
118 group->field_data2 = NULL;
122 void ec_GFp_mont_group_finish(EC_GROUP *group)
124 BN_MONT_CTX_free(group->field_data1);
125 group->field_data1 = NULL;
126 BN_free(group->field_data2);
127 group->field_data2 = NULL;
128 ec_GFp_simple_group_finish(group);
131 void ec_GFp_mont_group_clear_finish(EC_GROUP *group)
133 BN_MONT_CTX_free(group->field_data1);
134 group->field_data1 = NULL;
135 BN_clear_free(group->field_data2);
136 group->field_data2 = NULL;
137 ec_GFp_simple_group_clear_finish(group);
140 int ec_GFp_mont_group_copy(EC_GROUP *dest, const EC_GROUP *src)
142 BN_MONT_CTX_free(dest->field_data1);
143 dest->field_data1 = NULL;
144 BN_clear_free(dest->field_data2);
145 dest->field_data2 = NULL;
147 if (!ec_GFp_simple_group_copy(dest, src))
150 if (src->field_data1 != NULL) {
151 dest->field_data1 = BN_MONT_CTX_new();
152 if (dest->field_data1 == NULL)
154 if (!BN_MONT_CTX_copy(dest->field_data1, src->field_data1))
157 if (src->field_data2 != NULL) {
158 dest->field_data2 = BN_dup(src->field_data2);
159 if (dest->field_data2 == NULL)
166 BN_MONT_CTX_free(dest->field_data1);
167 dest->field_data1 = NULL;
171 int ec_GFp_mont_group_set_curve(EC_GROUP *group, const BIGNUM *p,
172 const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
174 BN_CTX *new_ctx = NULL;
175 BN_MONT_CTX *mont = NULL;
179 BN_MONT_CTX_free(group->field_data1);
180 group->field_data1 = NULL;
181 BN_free(group->field_data2);
182 group->field_data2 = NULL;
185 ctx = new_ctx = BN_CTX_new();
190 mont = BN_MONT_CTX_new();
193 if (!BN_MONT_CTX_set(mont, p, ctx)) {
194 ECerr(EC_F_EC_GFP_MONT_GROUP_SET_CURVE, ERR_R_BN_LIB);
200 if (!BN_to_montgomery(one, BN_value_one(), mont, ctx))
203 group->field_data1 = mont;
205 group->field_data2 = one;
208 ret = ec_GFp_simple_group_set_curve(group, p, a, b, ctx);
211 BN_MONT_CTX_free(group->field_data1);
212 group->field_data1 = NULL;
213 BN_free(group->field_data2);
214 group->field_data2 = NULL;
218 BN_CTX_free(new_ctx);
219 BN_MONT_CTX_free(mont);
223 int ec_GFp_mont_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
224 const BIGNUM *b, BN_CTX *ctx)
226 if (group->field_data1 == NULL) {
227 ECerr(EC_F_EC_GFP_MONT_FIELD_MUL, EC_R_NOT_INITIALIZED);
231 return BN_mod_mul_montgomery(r, a, b, group->field_data1, ctx);
234 int ec_GFp_mont_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
237 if (group->field_data1 == NULL) {
238 ECerr(EC_F_EC_GFP_MONT_FIELD_SQR, EC_R_NOT_INITIALIZED);
242 return BN_mod_mul_montgomery(r, a, a, group->field_data1, ctx);
245 int ec_GFp_mont_field_encode(const EC_GROUP *group, BIGNUM *r,
246 const BIGNUM *a, BN_CTX *ctx)
248 if (group->field_data1 == NULL) {
249 ECerr(EC_F_EC_GFP_MONT_FIELD_ENCODE, EC_R_NOT_INITIALIZED);
253 return BN_to_montgomery(r, a, (BN_MONT_CTX *)group->field_data1, ctx);
256 int ec_GFp_mont_field_decode(const EC_GROUP *group, BIGNUM *r,
257 const BIGNUM *a, BN_CTX *ctx)
259 if (group->field_data1 == NULL) {
260 ECerr(EC_F_EC_GFP_MONT_FIELD_DECODE, EC_R_NOT_INITIALIZED);
264 return BN_from_montgomery(r, a, group->field_data1, ctx);
267 int ec_GFp_mont_field_set_to_one(const EC_GROUP *group, BIGNUM *r,
270 if (group->field_data2 == NULL) {
271 ECerr(EC_F_EC_GFP_MONT_FIELD_SET_TO_ONE, EC_R_NOT_INITIALIZED);
275 if (!BN_copy(r, group->field_data2))