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_group_simple_order_bits,
80 ec_GFp_simple_group_check_discriminant,
81 ec_GFp_simple_point_init,
82 ec_GFp_simple_point_finish,
83 ec_GFp_simple_point_clear_finish,
84 ec_GFp_simple_point_copy,
85 ec_GFp_simple_point_set_to_infinity,
86 ec_GFp_simple_set_Jprojective_coordinates_GFp,
87 ec_GFp_simple_get_Jprojective_coordinates_GFp,
88 ec_GFp_simple_point_set_affine_coordinates,
89 ec_GFp_simple_point_get_affine_coordinates,
94 ec_GFp_simple_is_at_infinity,
95 ec_GFp_simple_is_on_curve,
97 ec_GFp_simple_make_affine,
98 ec_GFp_simple_points_make_affine,
100 0 /* precompute_mult */ ,
101 0 /* have_precompute_mult */ ,
102 ec_GFp_mont_field_mul,
103 ec_GFp_mont_field_sqr,
105 ec_GFp_mont_field_encode,
106 ec_GFp_mont_field_decode,
107 ec_GFp_mont_field_set_to_one,
108 ec_key_simple_priv2oct,
109 ec_key_simple_oct2priv,
111 ec_key_simple_generate_key,
112 ec_key_simple_check_key,
113 ec_key_simple_generate_public_key,
116 ecdh_simple_compute_key
122 int ec_GFp_mont_group_init(EC_GROUP *group)
126 ok = ec_GFp_simple_group_init(group);
127 group->field_data1 = NULL;
128 group->field_data2 = NULL;
132 void ec_GFp_mont_group_finish(EC_GROUP *group)
134 BN_MONT_CTX_free(group->field_data1);
135 group->field_data1 = NULL;
136 BN_free(group->field_data2);
137 group->field_data2 = NULL;
138 ec_GFp_simple_group_finish(group);
141 void ec_GFp_mont_group_clear_finish(EC_GROUP *group)
143 BN_MONT_CTX_free(group->field_data1);
144 group->field_data1 = NULL;
145 BN_clear_free(group->field_data2);
146 group->field_data2 = NULL;
147 ec_GFp_simple_group_clear_finish(group);
150 int ec_GFp_mont_group_copy(EC_GROUP *dest, const EC_GROUP *src)
152 BN_MONT_CTX_free(dest->field_data1);
153 dest->field_data1 = NULL;
154 BN_clear_free(dest->field_data2);
155 dest->field_data2 = NULL;
157 if (!ec_GFp_simple_group_copy(dest, src))
160 if (src->field_data1 != NULL) {
161 dest->field_data1 = BN_MONT_CTX_new();
162 if (dest->field_data1 == NULL)
164 if (!BN_MONT_CTX_copy(dest->field_data1, src->field_data1))
167 if (src->field_data2 != NULL) {
168 dest->field_data2 = BN_dup(src->field_data2);
169 if (dest->field_data2 == NULL)
176 BN_MONT_CTX_free(dest->field_data1);
177 dest->field_data1 = NULL;
181 int ec_GFp_mont_group_set_curve(EC_GROUP *group, const BIGNUM *p,
182 const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
184 BN_CTX *new_ctx = NULL;
185 BN_MONT_CTX *mont = NULL;
189 BN_MONT_CTX_free(group->field_data1);
190 group->field_data1 = NULL;
191 BN_free(group->field_data2);
192 group->field_data2 = NULL;
195 ctx = new_ctx = BN_CTX_new();
200 mont = BN_MONT_CTX_new();
203 if (!BN_MONT_CTX_set(mont, p, ctx)) {
204 ECerr(EC_F_EC_GFP_MONT_GROUP_SET_CURVE, ERR_R_BN_LIB);
210 if (!BN_to_montgomery(one, BN_value_one(), mont, ctx))
213 group->field_data1 = mont;
215 group->field_data2 = one;
218 ret = ec_GFp_simple_group_set_curve(group, p, a, b, ctx);
221 BN_MONT_CTX_free(group->field_data1);
222 group->field_data1 = NULL;
223 BN_free(group->field_data2);
224 group->field_data2 = NULL;
228 BN_CTX_free(new_ctx);
229 BN_MONT_CTX_free(mont);
233 int ec_GFp_mont_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
234 const BIGNUM *b, BN_CTX *ctx)
236 if (group->field_data1 == NULL) {
237 ECerr(EC_F_EC_GFP_MONT_FIELD_MUL, EC_R_NOT_INITIALIZED);
241 return BN_mod_mul_montgomery(r, a, b, group->field_data1, ctx);
244 int ec_GFp_mont_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
247 if (group->field_data1 == NULL) {
248 ECerr(EC_F_EC_GFP_MONT_FIELD_SQR, EC_R_NOT_INITIALIZED);
252 return BN_mod_mul_montgomery(r, a, a, group->field_data1, ctx);
255 int ec_GFp_mont_field_encode(const EC_GROUP *group, BIGNUM *r,
256 const BIGNUM *a, BN_CTX *ctx)
258 if (group->field_data1 == NULL) {
259 ECerr(EC_F_EC_GFP_MONT_FIELD_ENCODE, EC_R_NOT_INITIALIZED);
263 return BN_to_montgomery(r, a, (BN_MONT_CTX *)group->field_data1, ctx);
266 int ec_GFp_mont_field_decode(const EC_GROUP *group, BIGNUM *r,
267 const BIGNUM *a, BN_CTX *ctx)
269 if (group->field_data1 == NULL) {
270 ECerr(EC_F_EC_GFP_MONT_FIELD_DECODE, EC_R_NOT_INITIALIZED);
274 return BN_from_montgomery(r, a, group->field_data1, ctx);
277 int ec_GFp_mont_field_set_to_one(const EC_GROUP *group, BIGNUM *r,
280 if (group->field_data2 == NULL) {
281 ECerr(EC_F_EC_GFP_MONT_FIELD_SET_TO_ONE, EC_R_NOT_INITIALIZED);
285 if (!BN_copy(r, group->field_data2))