1 /* crypto/ec/ecp_mont.c */
3 * Originally written by Bodo Moeller for the OpenSSL project.
5 /* ====================================================================
6 * Copyright (c) 1998-2001 The OpenSSL Project. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
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
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/)"
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.
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.
34 * 6. Redistributions of any form whatsoever must retain the following
36 * "This product includes software developed by the OpenSSL Project
37 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
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 * ====================================================================
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).
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.
64 #include <openssl/err.h>
67 # include <openssl/fips.h>
72 const EC_METHOD *EC_GFp_mont_method(void)
74 static const EC_METHOD ret = {
76 NID_X9_62_prime_field,
77 ec_GFp_mont_group_init,
78 ec_GFp_mont_group_finish,
79 ec_GFp_mont_group_clear_finish,
80 ec_GFp_mont_group_copy,
81 ec_GFp_mont_group_set_curve,
82 ec_GFp_simple_group_get_curve,
83 ec_GFp_simple_group_get_degree,
84 ec_GFp_simple_group_check_discriminant,
85 ec_GFp_simple_point_init,
86 ec_GFp_simple_point_finish,
87 ec_GFp_simple_point_clear_finish,
88 ec_GFp_simple_point_copy,
89 ec_GFp_simple_point_set_to_infinity,
90 ec_GFp_simple_set_Jprojective_coordinates_GFp,
91 ec_GFp_simple_get_Jprojective_coordinates_GFp,
92 ec_GFp_simple_point_set_affine_coordinates,
93 ec_GFp_simple_point_get_affine_coordinates,
98 ec_GFp_simple_is_at_infinity,
99 ec_GFp_simple_is_on_curve,
101 ec_GFp_simple_make_affine,
102 ec_GFp_simple_points_make_affine,
104 0 /* precompute_mult */ ,
105 0 /* have_precompute_mult */ ,
106 ec_GFp_mont_field_mul,
107 ec_GFp_mont_field_sqr,
109 ec_GFp_mont_field_encode,
110 ec_GFp_mont_field_decode,
111 ec_GFp_mont_field_set_to_one
116 return fips_ec_gfp_mont_method();
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 if (group->field_data1 != NULL) {
135 BN_MONT_CTX_free(group->field_data1);
136 group->field_data1 = NULL;
138 if (group->field_data2 != NULL) {
139 BN_free(group->field_data2);
140 group->field_data2 = NULL;
142 ec_GFp_simple_group_finish(group);
145 void ec_GFp_mont_group_clear_finish(EC_GROUP *group)
147 if (group->field_data1 != NULL) {
148 BN_MONT_CTX_free(group->field_data1);
149 group->field_data1 = NULL;
151 if (group->field_data2 != NULL) {
152 BN_clear_free(group->field_data2);
153 group->field_data2 = NULL;
155 ec_GFp_simple_group_clear_finish(group);
158 int ec_GFp_mont_group_copy(EC_GROUP *dest, const EC_GROUP *src)
160 if (dest->field_data1 != NULL) {
161 BN_MONT_CTX_free(dest->field_data1);
162 dest->field_data1 = NULL;
164 if (dest->field_data2 != NULL) {
165 BN_clear_free(dest->field_data2);
166 dest->field_data2 = NULL;
169 if (!ec_GFp_simple_group_copy(dest, src))
172 if (src->field_data1 != NULL) {
173 dest->field_data1 = BN_MONT_CTX_new();
174 if (dest->field_data1 == NULL)
176 if (!BN_MONT_CTX_copy(dest->field_data1, src->field_data1))
179 if (src->field_data2 != NULL) {
180 dest->field_data2 = BN_dup(src->field_data2);
181 if (dest->field_data2 == NULL)
188 if (dest->field_data1 != NULL) {
189 BN_MONT_CTX_free(dest->field_data1);
190 dest->field_data1 = NULL;
195 int ec_GFp_mont_group_set_curve(EC_GROUP *group, const BIGNUM *p,
196 const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
198 BN_CTX *new_ctx = NULL;
199 BN_MONT_CTX *mont = NULL;
203 if (group->field_data1 != NULL) {
204 BN_MONT_CTX_free(group->field_data1);
205 group->field_data1 = NULL;
207 if (group->field_data2 != NULL) {
208 BN_free(group->field_data2);
209 group->field_data2 = NULL;
213 ctx = new_ctx = BN_CTX_new();
218 mont = BN_MONT_CTX_new();
221 if (!BN_MONT_CTX_set(mont, p, ctx)) {
222 ECerr(EC_F_EC_GFP_MONT_GROUP_SET_CURVE, ERR_R_BN_LIB);
228 if (!BN_to_montgomery(one, BN_value_one(), mont, ctx))
231 group->field_data1 = mont;
233 group->field_data2 = one;
236 ret = ec_GFp_simple_group_set_curve(group, p, a, b, ctx);
239 BN_MONT_CTX_free(group->field_data1);
240 group->field_data1 = NULL;
241 BN_free(group->field_data2);
242 group->field_data2 = NULL;
247 BN_CTX_free(new_ctx);
249 BN_MONT_CTX_free(mont);
253 int ec_GFp_mont_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
254 const BIGNUM *b, BN_CTX *ctx)
256 if (group->field_data1 == NULL) {
257 ECerr(EC_F_EC_GFP_MONT_FIELD_MUL, EC_R_NOT_INITIALIZED);
261 return BN_mod_mul_montgomery(r, a, b, group->field_data1, ctx);
264 int ec_GFp_mont_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
267 if (group->field_data1 == NULL) {
268 ECerr(EC_F_EC_GFP_MONT_FIELD_SQR, EC_R_NOT_INITIALIZED);
272 return BN_mod_mul_montgomery(r, a, a, group->field_data1, ctx);
275 int ec_GFp_mont_field_encode(const EC_GROUP *group, BIGNUM *r,
276 const BIGNUM *a, BN_CTX *ctx)
278 if (group->field_data1 == NULL) {
279 ECerr(EC_F_EC_GFP_MONT_FIELD_ENCODE, EC_R_NOT_INITIALIZED);
283 return BN_to_montgomery(r, a, (BN_MONT_CTX *)group->field_data1, ctx);
286 int ec_GFp_mont_field_decode(const EC_GROUP *group, BIGNUM *r,
287 const BIGNUM *a, BN_CTX *ctx)
289 if (group->field_data1 == NULL) {
290 ECerr(EC_F_EC_GFP_MONT_FIELD_DECODE, EC_R_NOT_INITIALIZED);
294 return BN_from_montgomery(r, a, group->field_data1, ctx);
297 int ec_GFp_mont_field_set_to_one(const EC_GROUP *group, BIGNUM *r,
300 if (group->field_data2 == NULL) {
301 ECerr(EC_F_EC_GFP_MONT_FIELD_SET_TO_ONE, EC_R_NOT_INITIALIZED);
305 if (!BN_copy(r, group->field_data2))