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>
73 const EC_METHOD
*EC_GFp_mont_method(void)
76 return fips_ec_gfp_mont_method();
78 static const EC_METHOD ret
= {
80 NID_X9_62_prime_field
,
81 ec_GFp_mont_group_init
,
82 ec_GFp_mont_group_finish
,
83 ec_GFp_mont_group_clear_finish
,
84 ec_GFp_mont_group_copy
,
85 ec_GFp_mont_group_set_curve
,
86 ec_GFp_simple_group_get_curve
,
87 ec_GFp_simple_group_get_degree
,
88 ec_GFp_simple_group_check_discriminant
,
89 ec_GFp_simple_point_init
,
90 ec_GFp_simple_point_finish
,
91 ec_GFp_simple_point_clear_finish
,
92 ec_GFp_simple_point_copy
,
93 ec_GFp_simple_point_set_to_infinity
,
94 ec_GFp_simple_set_Jprojective_coordinates_GFp
,
95 ec_GFp_simple_get_Jprojective_coordinates_GFp
,
96 ec_GFp_simple_point_set_affine_coordinates
,
97 ec_GFp_simple_point_get_affine_coordinates
,
101 ec_GFp_simple_invert
,
102 ec_GFp_simple_is_at_infinity
,
103 ec_GFp_simple_is_on_curve
,
105 ec_GFp_simple_make_affine
,
106 ec_GFp_simple_points_make_affine
,
108 0 /* precompute_mult */,
109 0 /* have_precompute_mult */,
110 ec_GFp_mont_field_mul
,
111 ec_GFp_mont_field_sqr
,
113 ec_GFp_mont_field_encode
,
114 ec_GFp_mont_field_decode
,
115 ec_GFp_mont_field_set_to_one
};
123 int ec_GFp_mont_group_init(EC_GROUP
*group
)
127 ok
= ec_GFp_simple_group_init(group
);
128 group
->field_data1
= NULL
;
129 group
->field_data2
= NULL
;
134 void ec_GFp_mont_group_finish(EC_GROUP
*group
)
136 if (group
->field_data1
!= NULL
)
138 BN_MONT_CTX_free(group
->field_data1
);
139 group
->field_data1
= NULL
;
141 if (group
->field_data2
!= NULL
)
143 BN_free(group
->field_data2
);
144 group
->field_data2
= NULL
;
146 ec_GFp_simple_group_finish(group
);
150 void ec_GFp_mont_group_clear_finish(EC_GROUP
*group
)
152 if (group
->field_data1
!= NULL
)
154 BN_MONT_CTX_free(group
->field_data1
);
155 group
->field_data1
= NULL
;
157 if (group
->field_data2
!= NULL
)
159 BN_clear_free(group
->field_data2
);
160 group
->field_data2
= NULL
;
162 ec_GFp_simple_group_clear_finish(group
);
166 int ec_GFp_mont_group_copy(EC_GROUP
*dest
, const EC_GROUP
*src
)
168 if (dest
->field_data1
!= NULL
)
170 BN_MONT_CTX_free(dest
->field_data1
);
171 dest
->field_data1
= NULL
;
173 if (dest
->field_data2
!= NULL
)
175 BN_clear_free(dest
->field_data2
);
176 dest
->field_data2
= NULL
;
179 if (!ec_GFp_simple_group_copy(dest
, src
)) return 0;
181 if (src
->field_data1
!= NULL
)
183 dest
->field_data1
= BN_MONT_CTX_new();
184 if (dest
->field_data1
== NULL
) return 0;
185 if (!BN_MONT_CTX_copy(dest
->field_data1
, src
->field_data1
)) goto err
;
187 if (src
->field_data2
!= NULL
)
189 dest
->field_data2
= BN_dup(src
->field_data2
);
190 if (dest
->field_data2
== NULL
) goto err
;
196 if (dest
->field_data1
!= NULL
)
198 BN_MONT_CTX_free(dest
->field_data1
);
199 dest
->field_data1
= NULL
;
205 int ec_GFp_mont_group_set_curve(EC_GROUP
*group
, const BIGNUM
*p
, const BIGNUM
*a
, const BIGNUM
*b
, BN_CTX
*ctx
)
207 BN_CTX
*new_ctx
= NULL
;
208 BN_MONT_CTX
*mont
= NULL
;
212 if (group
->field_data1
!= NULL
)
214 BN_MONT_CTX_free(group
->field_data1
);
215 group
->field_data1
= NULL
;
217 if (group
->field_data2
!= NULL
)
219 BN_free(group
->field_data2
);
220 group
->field_data2
= NULL
;
225 ctx
= new_ctx
= BN_CTX_new();
230 mont
= BN_MONT_CTX_new();
231 if (mont
== NULL
) goto err
;
232 if (!BN_MONT_CTX_set(mont
, p
, ctx
))
234 ECerr(EC_F_EC_GFP_MONT_GROUP_SET_CURVE
, ERR_R_BN_LIB
);
238 if (one
== NULL
) goto err
;
239 if (!BN_to_montgomery(one
, BN_value_one(), mont
, ctx
)) goto err
;
241 group
->field_data1
= mont
;
243 group
->field_data2
= one
;
246 ret
= ec_GFp_simple_group_set_curve(group
, p
, a
, b
, ctx
);
250 BN_MONT_CTX_free(group
->field_data1
);
251 group
->field_data1
= NULL
;
252 BN_free(group
->field_data2
);
253 group
->field_data2
= NULL
;
258 BN_CTX_free(new_ctx
);
260 BN_MONT_CTX_free(mont
);
265 int ec_GFp_mont_field_mul(const EC_GROUP
*group
, BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, BN_CTX
*ctx
)
267 if (group
->field_data1
== NULL
)
269 ECerr(EC_F_EC_GFP_MONT_FIELD_MUL
, EC_R_NOT_INITIALIZED
);
273 return BN_mod_mul_montgomery(r
, a
, b
, group
->field_data1
, ctx
);
277 int ec_GFp_mont_field_sqr(const EC_GROUP
*group
, BIGNUM
*r
, const BIGNUM
*a
, BN_CTX
*ctx
)
279 if (group
->field_data1
== NULL
)
281 ECerr(EC_F_EC_GFP_MONT_FIELD_SQR
, EC_R_NOT_INITIALIZED
);
285 return BN_mod_mul_montgomery(r
, a
, a
, group
->field_data1
, ctx
);
289 int ec_GFp_mont_field_encode(const EC_GROUP
*group
, BIGNUM
*r
, const BIGNUM
*a
, BN_CTX
*ctx
)
291 if (group
->field_data1
== NULL
)
293 ECerr(EC_F_EC_GFP_MONT_FIELD_ENCODE
, EC_R_NOT_INITIALIZED
);
297 return BN_to_montgomery(r
, a
, (BN_MONT_CTX
*)group
->field_data1
, ctx
);
301 int ec_GFp_mont_field_decode(const EC_GROUP
*group
, BIGNUM
*r
, const BIGNUM
*a
, BN_CTX
*ctx
)
303 if (group
->field_data1
== NULL
)
305 ECerr(EC_F_EC_GFP_MONT_FIELD_DECODE
, EC_R_NOT_INITIALIZED
);
309 return BN_from_montgomery(r
, a
, group
->field_data1
, ctx
);
313 int ec_GFp_mont_field_set_to_one(const EC_GROUP
*group
, BIGNUM
*r
, BN_CTX
*ctx
)
315 if (group
->field_data2
== NULL
)
317 ECerr(EC_F_EC_GFP_MONT_FIELD_SET_TO_ONE
, EC_R_NOT_INITIALIZED
);
321 if (!BN_copy(r
, group
->field_data2
)) return 0;