1 /* crypto/ec/ec2_mult.c */
2 /* ====================================================================
3 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
5 * The Elliptic Curve Public-Key Crypto Library (ECC Code) included
6 * herein is developed by SUN MICROSYSTEMS, INC., and is contributed
7 * to the OpenSSL project.
9 * The ECC Code is licensed pursuant to the OpenSSL open source
10 * license provided below.
12 * The software is originally written by Sheueling Chang Shantz and
13 * Douglas Stebila of Sun Microsystems Laboratories.
16 /* ====================================================================
17 * Copyright (c) 1998-2003 The OpenSSL Project. All rights reserved.
19 * Redistribution and use in source and binary forms, with or without
20 * modification, are permitted provided that the following conditions
23 * 1. Redistributions of source code must retain the above copyright
24 * notice, this list of conditions and the following disclaimer.
26 * 2. Redistributions in binary form must reproduce the above copyright
27 * notice, this list of conditions and the following disclaimer in
28 * the documentation and/or other materials provided with the
31 * 3. All advertising materials mentioning features or use of this
32 * software must display the following acknowledgment:
33 * "This product includes software developed by the OpenSSL Project
34 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
36 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
37 * endorse or promote products derived from this software without
38 * prior written permission. For written permission, please contact
39 * openssl-core@openssl.org.
41 * 5. Products derived from this software may not be called "OpenSSL"
42 * nor may "OpenSSL" appear in their names without prior written
43 * permission of the OpenSSL Project.
45 * 6. Redistributions of any form whatsoever must retain the following
47 * "This product includes software developed by the OpenSSL Project
48 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
50 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
51 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
52 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
53 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
54 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
55 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
56 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
57 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
58 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
59 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
60 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
61 * OF THE POSSIBILITY OF SUCH DAMAGE.
62 * ====================================================================
64 * This product includes cryptographic software written by Eric Young
65 * (eay@cryptsoft.com). This product includes software written by Tim
66 * Hudson (tjh@cryptsoft.com).
70 #include <openssl/err.h>
74 #ifndef OPENSSL_NO_EC2M
77 * Compute the x-coordinate x/z for the point 2*(x/z) in Montgomery projective
79 * Uses algorithm Mdouble in appendix of
80 * Lopez, J. and Dahab, R. "Fast multiplication on elliptic curves over
81 * GF(2^m) without precomputation" (CHES '99, LNCS 1717).
82 * modified to not require precomputation of c=b^{2^{m-1}}.
84 static int gf2m_Mdouble(const EC_GROUP *group, BIGNUM *x, BIGNUM *z,
90 /* Since Mdouble is static we can guarantee that ctx != NULL. */
96 if (!group->meth->field_sqr(group, x, x, ctx))
98 if (!group->meth->field_sqr(group, t1, z, ctx))
100 if (!group->meth->field_mul(group, z, x, t1, ctx))
102 if (!group->meth->field_sqr(group, x, x, ctx))
104 if (!group->meth->field_sqr(group, t1, t1, ctx))
106 if (!group->meth->field_mul(group, t1, &group->b, t1, ctx))
108 if (!BN_GF2m_add(x, x, t1))
119 * Compute the x-coordinate x1/z1 for the point (x1/z1)+(x2/x2) in Montgomery
120 * projective coordinates.
121 * Uses algorithm Madd in appendix of
122 * Lopez, J. and Dahab, R. "Fast multiplication on elliptic curves over
123 * GF(2^m) without precomputation" (CHES '99, LNCS 1717).
125 static int gf2m_Madd(const EC_GROUP *group, const BIGNUM *x, BIGNUM *x1,
126 BIGNUM *z1, const BIGNUM *x2, const BIGNUM *z2,
132 /* Since Madd is static we can guarantee that ctx != NULL. */
134 t1 = BN_CTX_get(ctx);
135 t2 = BN_CTX_get(ctx);
141 if (!group->meth->field_mul(group, x1, x1, z2, ctx))
143 if (!group->meth->field_mul(group, z1, z1, x2, ctx))
145 if (!group->meth->field_mul(group, t2, x1, z1, ctx))
147 if (!BN_GF2m_add(z1, z1, x1))
149 if (!group->meth->field_sqr(group, z1, z1, ctx))
151 if (!group->meth->field_mul(group, x1, z1, t1, ctx))
153 if (!BN_GF2m_add(x1, x1, t2))
164 * Compute the x, y affine coordinates from the point (x1, z1) (x2, z2)
165 * using Montgomery point multiplication algorithm Mxy() in appendix of
166 * Lopez, J. and Dahab, R. "Fast multiplication on elliptic curves over
167 * GF(2^m) without precomputation" (CHES '99, LNCS 1717).
170 * 1 if return value should be the point at infinity
173 static int gf2m_Mxy(const EC_GROUP *group, const BIGNUM *x, const BIGNUM *y,
174 BIGNUM *x1, BIGNUM *z1, BIGNUM *x2, BIGNUM *z2,
177 BIGNUM *t3, *t4, *t5;
180 if (BN_is_zero(z1)) {
186 if (BN_is_zero(z2)) {
189 if (!BN_GF2m_add(z2, x, y))
194 /* Since Mxy is static we can guarantee that ctx != NULL. */
196 t3 = BN_CTX_get(ctx);
197 t4 = BN_CTX_get(ctx);
198 t5 = BN_CTX_get(ctx);
205 if (!group->meth->field_mul(group, t3, z1, z2, ctx))
208 if (!group->meth->field_mul(group, z1, z1, x, ctx))
210 if (!BN_GF2m_add(z1, z1, x1))
212 if (!group->meth->field_mul(group, z2, z2, x, ctx))
214 if (!group->meth->field_mul(group, x1, z2, x1, ctx))
216 if (!BN_GF2m_add(z2, z2, x2))
219 if (!group->meth->field_mul(group, z2, z2, z1, ctx))
221 if (!group->meth->field_sqr(group, t4, x, ctx))
223 if (!BN_GF2m_add(t4, t4, y))
225 if (!group->meth->field_mul(group, t4, t4, t3, ctx))
227 if (!BN_GF2m_add(t4, t4, z2))
230 if (!group->meth->field_mul(group, t3, t3, x, ctx))
232 if (!group->meth->field_div(group, t3, t5, t3, ctx))
234 if (!group->meth->field_mul(group, t4, t3, t4, ctx))
236 if (!group->meth->field_mul(group, x2, x1, t3, ctx))
238 if (!BN_GF2m_add(z2, x2, x))
241 if (!group->meth->field_mul(group, z2, z2, t4, ctx))
243 if (!BN_GF2m_add(z2, z2, y))
254 * Computes scalar*point and stores the result in r.
255 * point can not equal r.
256 * Uses a modified algorithm 2P of
257 * Lopez, J. and Dahab, R. "Fast multiplication on elliptic curves over
258 * GF(2^m) without precomputation" (CHES '99, LNCS 1717).
260 * To protect against side-channel attack the function uses constant time swap,
261 * avoiding conditional branches.
263 static int ec_GF2m_montgomery_point_multiply(const EC_GROUP *group,
265 const BIGNUM *scalar,
266 const EC_POINT *point,
269 BIGNUM *x1, *x2, *z1, *z2;
270 int ret = 0, i, group_top;
274 ECerr(EC_F_EC_GF2M_MONTGOMERY_POINT_MULTIPLY, EC_R_INVALID_ARGUMENT);
278 /* if result should be point at infinity */
279 if ((scalar == NULL) || BN_is_zero(scalar) || (point == NULL) ||
280 EC_POINT_is_at_infinity(group, point)) {
281 return EC_POINT_set_to_infinity(group, r);
284 /* only support affine coordinates */
285 if (!point->Z_is_one)
289 * Since point_multiply is static we can guarantee that ctx != NULL.
292 x1 = BN_CTX_get(ctx);
293 z1 = BN_CTX_get(ctx);
300 group_top = group->field.top;
301 if (bn_wexpand(x1, group_top) == NULL
302 || bn_wexpand(z1, group_top) == NULL
303 || bn_wexpand(x2, group_top) == NULL
304 || bn_wexpand(z2, group_top) == NULL)
307 if (!BN_GF2m_mod_arr(x1, &point->X, group->poly))
308 goto err; /* x1 = x */
310 goto err; /* z1 = 1 */
311 if (!group->meth->field_sqr(group, z2, x1, ctx))
312 goto err; /* z2 = x1^2 = x^2 */
313 if (!group->meth->field_sqr(group, x2, z2, ctx))
315 if (!BN_GF2m_add(x2, x2, &group->b))
316 goto err; /* x2 = x^4 + b */
318 /* find top most bit and go one past it */
322 while (!(word & mask))
325 /* if top most bit was at word break, go to next word */
331 for (; i >= 0; i--) {
334 BN_consttime_swap(word & mask, x1, x2, group_top);
335 BN_consttime_swap(word & mask, z1, z2, group_top);
336 if (!gf2m_Madd(group, &point->X, x2, z2, x1, z1, ctx))
338 if (!gf2m_Mdouble(group, x1, z1, ctx))
340 BN_consttime_swap(word & mask, x1, x2, group_top);
341 BN_consttime_swap(word & mask, z1, z2, group_top);
347 /* convert out of "projective" coordinates */
348 i = gf2m_Mxy(group, &point->X, &point->Y, x1, z1, x2, z2, ctx);
352 if (!EC_POINT_set_to_infinity(group, r))
360 /* GF(2^m) field elements should always have BIGNUM::neg = 0 */
361 BN_set_negative(&r->X, 0);
362 BN_set_negative(&r->Y, 0);
373 * scalar*group->generator + scalars[0]*points[0] + ... + scalars[num-1]*points[num-1]
374 * gracefully ignoring NULL scalar values.
376 int ec_GF2m_simple_mul(const EC_GROUP *group, EC_POINT *r,
377 const BIGNUM *scalar, size_t num,
378 const EC_POINT *points[], const BIGNUM *scalars[],
381 BN_CTX *new_ctx = NULL;
385 EC_POINT *acc = NULL;
388 ctx = new_ctx = BN_CTX_new();
394 * This implementation is more efficient than the wNAF implementation for
395 * 2 or fewer points. Use the ec_wNAF_mul implementation for 3 or more
396 * points, or if we can perform a fast multiplication based on
399 if ((scalar && (num > 1)) || (num > 2)
400 || (num == 0 && EC_GROUP_have_precompute_mult(group))) {
401 ret = ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx);
405 if ((p = EC_POINT_new(group)) == NULL)
407 if ((acc = EC_POINT_new(group)) == NULL)
410 if (!EC_POINT_set_to_infinity(group, acc))
414 if (!ec_GF2m_montgomery_point_multiply
415 (group, p, scalar, group->generator, ctx))
417 if (BN_is_negative(scalar))
418 if (!group->meth->invert(group, p, ctx))
420 if (!group->meth->add(group, acc, acc, p, ctx))
424 for (i = 0; i < num; i++) {
425 if (!ec_GF2m_montgomery_point_multiply
426 (group, p, scalars[i], points[i], ctx))
428 if (BN_is_negative(scalars[i]))
429 if (!group->meth->invert(group, p, ctx))
431 if (!group->meth->add(group, acc, acc, p, ctx))
435 if (!EC_POINT_copy(r, acc))
446 BN_CTX_free(new_ctx);
451 * Precomputation for point multiplication: fall back to wNAF methods because
452 * ec_GF2m_simple_mul() uses ec_wNAF_mul() if appropriate
455 int ec_GF2m_precompute_mult(EC_GROUP *group, BN_CTX *ctx)
457 return ec_wNAF_precompute_mult(group, ctx);
460 int ec_GF2m_have_precompute_mult(const EC_GROUP *group)
462 return ec_wNAF_have_precompute_mult(group);