2 * Copyright 2002-2020 The OpenSSL Project Authors. All Rights Reserved.
3 * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved
5 * Licensed under the Apache License 2.0 (the "License"). You may not use
6 * this file except in compliance with the License. You can obtain a copy
7 * in the file LICENSE in the source distribution or at
8 * https://www.openssl.org/source/license.html
12 * ECDSA low level APIs are deprecated for public use, but still ok for
15 #include "internal/deprecated.h"
17 #include <openssl/err.h>
19 #include "crypto/bn.h"
22 #ifndef OPENSSL_NO_EC2M
25 * Initialize a GF(2^m)-based EC_GROUP structure. Note that all other members
26 * are handled by EC_GROUP_new.
28 int ec_GF2m_simple_group_init(EC_GROUP
*group
)
30 group
->field
= BN_new();
34 if (group
->field
== NULL
|| group
->a
== NULL
|| group
->b
== NULL
) {
35 BN_free(group
->field
);
44 * Free a GF(2^m)-based EC_GROUP structure. Note that all other members are
45 * handled by EC_GROUP_free.
47 void ec_GF2m_simple_group_finish(EC_GROUP
*group
)
49 BN_free(group
->field
);
55 * Clear and free a GF(2^m)-based EC_GROUP structure. Note that all other
56 * members are handled by EC_GROUP_clear_free.
58 void ec_GF2m_simple_group_clear_finish(EC_GROUP
*group
)
60 BN_clear_free(group
->field
);
61 BN_clear_free(group
->a
);
62 BN_clear_free(group
->b
);
72 * Copy a GF(2^m)-based EC_GROUP structure. Note that all other members are
73 * handled by EC_GROUP_copy.
75 int ec_GF2m_simple_group_copy(EC_GROUP
*dest
, const EC_GROUP
*src
)
77 if (!BN_copy(dest
->field
, src
->field
))
79 if (!BN_copy(dest
->a
, src
->a
))
81 if (!BN_copy(dest
->b
, src
->b
))
83 dest
->poly
[0] = src
->poly
[0];
84 dest
->poly
[1] = src
->poly
[1];
85 dest
->poly
[2] = src
->poly
[2];
86 dest
->poly
[3] = src
->poly
[3];
87 dest
->poly
[4] = src
->poly
[4];
88 dest
->poly
[5] = src
->poly
[5];
89 if (bn_wexpand(dest
->a
, (int)(dest
->poly
[0] + BN_BITS2
- 1) / BN_BITS2
) ==
92 if (bn_wexpand(dest
->b
, (int)(dest
->poly
[0] + BN_BITS2
- 1) / BN_BITS2
) ==
95 bn_set_all_zero(dest
->a
);
96 bn_set_all_zero(dest
->b
);
100 /* Set the curve parameters of an EC_GROUP structure. */
101 int ec_GF2m_simple_group_set_curve(EC_GROUP
*group
,
102 const BIGNUM
*p
, const BIGNUM
*a
,
103 const BIGNUM
*b
, BN_CTX
*ctx
)
108 if (!BN_copy(group
->field
, p
))
110 i
= BN_GF2m_poly2arr(group
->field
, group
->poly
, 6) - 1;
111 if ((i
!= 5) && (i
!= 3)) {
112 ECerr(EC_F_EC_GF2M_SIMPLE_GROUP_SET_CURVE
, EC_R_UNSUPPORTED_FIELD
);
117 if (!BN_GF2m_mod_arr(group
->a
, a
, group
->poly
))
119 if (bn_wexpand(group
->a
, (int)(group
->poly
[0] + BN_BITS2
- 1) / BN_BITS2
)
122 bn_set_all_zero(group
->a
);
125 if (!BN_GF2m_mod_arr(group
->b
, b
, group
->poly
))
127 if (bn_wexpand(group
->b
, (int)(group
->poly
[0] + BN_BITS2
- 1) / BN_BITS2
)
130 bn_set_all_zero(group
->b
);
138 * Get the curve parameters of an EC_GROUP structure. If p, a, or b are NULL
139 * then there values will not be set but the method will return with success.
141 int ec_GF2m_simple_group_get_curve(const EC_GROUP
*group
, BIGNUM
*p
,
142 BIGNUM
*a
, BIGNUM
*b
, BN_CTX
*ctx
)
147 if (!BN_copy(p
, group
->field
))
152 if (!BN_copy(a
, group
->a
))
157 if (!BN_copy(b
, group
->b
))
168 * Gets the degree of the field. For a curve over GF(2^m) this is the value
171 int ec_GF2m_simple_group_get_degree(const EC_GROUP
*group
)
173 return BN_num_bits(group
->field
) - 1;
177 * Checks the discriminant of the curve. y^2 + x*y = x^3 + a*x^2 + b is an
178 * elliptic curve <=> b != 0 (mod p)
180 int ec_GF2m_simple_group_check_discriminant(const EC_GROUP
*group
,
186 BN_CTX
*new_ctx
= NULL
;
189 ctx
= new_ctx
= BN_CTX_new();
191 ECerr(EC_F_EC_GF2M_SIMPLE_GROUP_CHECK_DISCRIMINANT
,
192 ERR_R_MALLOC_FAILURE
);
202 if (!BN_GF2m_mod_arr(b
, group
->b
, group
->poly
))
206 * check the discriminant: y^2 + x*y = x^3 + a*x^2 + b is an elliptic
207 * curve <=> b != 0 (mod p)
217 BN_CTX_free(new_ctx
);
222 /* Initializes an EC_POINT. */
223 int ec_GF2m_simple_point_init(EC_POINT
*point
)
229 if (point
->X
== NULL
|| point
->Y
== NULL
|| point
->Z
== NULL
) {
238 /* Frees an EC_POINT. */
239 void ec_GF2m_simple_point_finish(EC_POINT
*point
)
246 /* Clears and frees an EC_POINT. */
247 void ec_GF2m_simple_point_clear_finish(EC_POINT
*point
)
249 BN_clear_free(point
->X
);
250 BN_clear_free(point
->Y
);
251 BN_clear_free(point
->Z
);
256 * Copy the contents of one EC_POINT into another. Assumes dest is
259 int ec_GF2m_simple_point_copy(EC_POINT
*dest
, const EC_POINT
*src
)
261 if (!BN_copy(dest
->X
, src
->X
))
263 if (!BN_copy(dest
->Y
, src
->Y
))
265 if (!BN_copy(dest
->Z
, src
->Z
))
267 dest
->Z_is_one
= src
->Z_is_one
;
268 dest
->curve_name
= src
->curve_name
;
274 * Set an EC_POINT to the point at infinity. A point at infinity is
275 * represented by having Z=0.
277 int ec_GF2m_simple_point_set_to_infinity(const EC_GROUP
*group
,
286 * Set the coordinates of an EC_POINT using affine coordinates. Note that
287 * the simple implementation only uses affine coordinates.
289 int ec_GF2m_simple_point_set_affine_coordinates(const EC_GROUP
*group
,
292 const BIGNUM
*y
, BN_CTX
*ctx
)
295 if (x
== NULL
|| y
== NULL
) {
296 ECerr(EC_F_EC_GF2M_SIMPLE_POINT_SET_AFFINE_COORDINATES
,
297 ERR_R_PASSED_NULL_PARAMETER
);
301 if (!BN_copy(point
->X
, x
))
303 BN_set_negative(point
->X
, 0);
304 if (!BN_copy(point
->Y
, y
))
306 BN_set_negative(point
->Y
, 0);
307 if (!BN_copy(point
->Z
, BN_value_one()))
309 BN_set_negative(point
->Z
, 0);
318 * Gets the affine coordinates of an EC_POINT. Note that the simple
319 * implementation only uses affine coordinates.
321 int ec_GF2m_simple_point_get_affine_coordinates(const EC_GROUP
*group
,
322 const EC_POINT
*point
,
323 BIGNUM
*x
, BIGNUM
*y
,
328 if (EC_POINT_is_at_infinity(group
, point
)) {
329 ECerr(EC_F_EC_GF2M_SIMPLE_POINT_GET_AFFINE_COORDINATES
,
330 EC_R_POINT_AT_INFINITY
);
334 if (BN_cmp(point
->Z
, BN_value_one())) {
335 ECerr(EC_F_EC_GF2M_SIMPLE_POINT_GET_AFFINE_COORDINATES
,
336 ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED
);
340 if (!BN_copy(x
, point
->X
))
342 BN_set_negative(x
, 0);
345 if (!BN_copy(y
, point
->Y
))
347 BN_set_negative(y
, 0);
356 * Computes a + b and stores the result in r. r could be a or b, a could be
357 * b. Uses algorithm A.10.2 of IEEE P1363.
359 int ec_GF2m_simple_add(const EC_GROUP
*group
, EC_POINT
*r
, const EC_POINT
*a
,
360 const EC_POINT
*b
, BN_CTX
*ctx
)
362 BIGNUM
*x0
, *y0
, *x1
, *y1
, *x2
, *y2
, *s
, *t
;
365 BN_CTX
*new_ctx
= NULL
;
368 if (EC_POINT_is_at_infinity(group
, a
)) {
369 if (!EC_POINT_copy(r
, b
))
374 if (EC_POINT_is_at_infinity(group
, b
)) {
375 if (!EC_POINT_copy(r
, a
))
382 ctx
= new_ctx
= BN_CTX_new();
389 x0
= BN_CTX_get(ctx
);
390 y0
= BN_CTX_get(ctx
);
391 x1
= BN_CTX_get(ctx
);
392 y1
= BN_CTX_get(ctx
);
393 x2
= BN_CTX_get(ctx
);
394 y2
= BN_CTX_get(ctx
);
401 if (!BN_copy(x0
, a
->X
))
403 if (!BN_copy(y0
, a
->Y
))
406 if (!EC_POINT_get_affine_coordinates(group
, a
, x0
, y0
, ctx
))
410 if (!BN_copy(x1
, b
->X
))
412 if (!BN_copy(y1
, b
->Y
))
415 if (!EC_POINT_get_affine_coordinates(group
, b
, x1
, y1
, ctx
))
419 if (BN_GF2m_cmp(x0
, x1
)) {
420 if (!BN_GF2m_add(t
, x0
, x1
))
422 if (!BN_GF2m_add(s
, y0
, y1
))
424 if (!group
->meth
->field_div(group
, s
, s
, t
, ctx
))
426 if (!group
->meth
->field_sqr(group
, x2
, s
, ctx
))
428 if (!BN_GF2m_add(x2
, x2
, group
->a
))
430 if (!BN_GF2m_add(x2
, x2
, s
))
432 if (!BN_GF2m_add(x2
, x2
, t
))
435 if (BN_GF2m_cmp(y0
, y1
) || BN_is_zero(x1
)) {
436 if (!EC_POINT_set_to_infinity(group
, r
))
441 if (!group
->meth
->field_div(group
, s
, y1
, x1
, ctx
))
443 if (!BN_GF2m_add(s
, s
, x1
))
446 if (!group
->meth
->field_sqr(group
, x2
, s
, ctx
))
448 if (!BN_GF2m_add(x2
, x2
, s
))
450 if (!BN_GF2m_add(x2
, x2
, group
->a
))
454 if (!BN_GF2m_add(y2
, x1
, x2
))
456 if (!group
->meth
->field_mul(group
, y2
, y2
, s
, ctx
))
458 if (!BN_GF2m_add(y2
, y2
, x2
))
460 if (!BN_GF2m_add(y2
, y2
, y1
))
463 if (!EC_POINT_set_affine_coordinates(group
, r
, x2
, y2
, ctx
))
471 BN_CTX_free(new_ctx
);
477 * Computes 2 * a and stores the result in r. r could be a. Uses algorithm
478 * A.10.2 of IEEE P1363.
480 int ec_GF2m_simple_dbl(const EC_GROUP
*group
, EC_POINT
*r
, const EC_POINT
*a
,
483 return ec_GF2m_simple_add(group
, r
, a
, a
, ctx
);
486 int ec_GF2m_simple_invert(const EC_GROUP
*group
, EC_POINT
*point
, BN_CTX
*ctx
)
488 if (EC_POINT_is_at_infinity(group
, point
) || BN_is_zero(point
->Y
))
489 /* point is its own inverse */
492 if (group
->meth
->make_affine
== NULL
493 || !group
->meth
->make_affine(group
, point
, ctx
))
495 return BN_GF2m_add(point
->Y
, point
->X
, point
->Y
);
498 /* Indicates whether the given point is the point at infinity. */
499 int ec_GF2m_simple_is_at_infinity(const EC_GROUP
*group
,
500 const EC_POINT
*point
)
502 return BN_is_zero(point
->Z
);
506 * Determines whether the given EC_POINT is an actual point on the curve defined
507 * in the EC_GROUP. A point is valid if it satisfies the Weierstrass equation:
508 * y^2 + x*y = x^3 + a*x^2 + b.
510 int ec_GF2m_simple_is_on_curve(const EC_GROUP
*group
, const EC_POINT
*point
,
515 int (*field_mul
) (const EC_GROUP
*, BIGNUM
*, const BIGNUM
*,
516 const BIGNUM
*, BN_CTX
*);
517 int (*field_sqr
) (const EC_GROUP
*, BIGNUM
*, const BIGNUM
*, BN_CTX
*);
519 BN_CTX
*new_ctx
= NULL
;
522 if (EC_POINT_is_at_infinity(group
, point
))
525 field_mul
= group
->meth
->field_mul
;
526 field_sqr
= group
->meth
->field_sqr
;
528 /* only support affine coordinates */
529 if (!point
->Z_is_one
)
534 ctx
= new_ctx
= BN_CTX_new();
541 y2
= BN_CTX_get(ctx
);
542 lh
= BN_CTX_get(ctx
);
547 * We have a curve defined by a Weierstrass equation
548 * y^2 + x*y = x^3 + a*x^2 + b.
549 * <=> x^3 + a*x^2 + x*y + b + y^2 = 0
550 * <=> ((x + a) * x + y ) * x + b + y^2 = 0
552 if (!BN_GF2m_add(lh
, point
->X
, group
->a
))
554 if (!field_mul(group
, lh
, lh
, point
->X
, ctx
))
556 if (!BN_GF2m_add(lh
, lh
, point
->Y
))
558 if (!field_mul(group
, lh
, lh
, point
->X
, ctx
))
560 if (!BN_GF2m_add(lh
, lh
, group
->b
))
562 if (!field_sqr(group
, y2
, point
->Y
, ctx
))
564 if (!BN_GF2m_add(lh
, lh
, y2
))
566 ret
= BN_is_zero(lh
);
571 BN_CTX_free(new_ctx
);
577 * Indicates whether two points are equal.
580 * 0 equal (in affine coordinates)
583 int ec_GF2m_simple_cmp(const EC_GROUP
*group
, const EC_POINT
*a
,
584 const EC_POINT
*b
, BN_CTX
*ctx
)
586 BIGNUM
*aX
, *aY
, *bX
, *bY
;
589 BN_CTX
*new_ctx
= NULL
;
592 if (EC_POINT_is_at_infinity(group
, a
)) {
593 return EC_POINT_is_at_infinity(group
, b
) ? 0 : 1;
596 if (EC_POINT_is_at_infinity(group
, b
))
599 if (a
->Z_is_one
&& b
->Z_is_one
) {
600 return ((BN_cmp(a
->X
, b
->X
) == 0) && BN_cmp(a
->Y
, b
->Y
) == 0) ? 0 : 1;
605 ctx
= new_ctx
= BN_CTX_new();
612 aX
= BN_CTX_get(ctx
);
613 aY
= BN_CTX_get(ctx
);
614 bX
= BN_CTX_get(ctx
);
615 bY
= BN_CTX_get(ctx
);
619 if (!EC_POINT_get_affine_coordinates(group
, a
, aX
, aY
, ctx
))
621 if (!EC_POINT_get_affine_coordinates(group
, b
, bX
, bY
, ctx
))
623 ret
= ((BN_cmp(aX
, bX
) == 0) && BN_cmp(aY
, bY
) == 0) ? 0 : 1;
628 BN_CTX_free(new_ctx
);
633 /* Forces the given EC_POINT to internally use affine coordinates. */
634 int ec_GF2m_simple_make_affine(const EC_GROUP
*group
, EC_POINT
*point
,
640 BN_CTX
*new_ctx
= NULL
;
643 if (point
->Z_is_one
|| EC_POINT_is_at_infinity(group
, point
))
648 ctx
= new_ctx
= BN_CTX_new();
660 if (!EC_POINT_get_affine_coordinates(group
, point
, x
, y
, ctx
))
662 if (!BN_copy(point
->X
, x
))
664 if (!BN_copy(point
->Y
, y
))
666 if (!BN_one(point
->Z
))
675 BN_CTX_free(new_ctx
);
681 * Forces each of the EC_POINTs in the given array to use affine coordinates.
683 int ec_GF2m_simple_points_make_affine(const EC_GROUP
*group
, size_t num
,
684 EC_POINT
*points
[], BN_CTX
*ctx
)
688 for (i
= 0; i
< num
; i
++) {
689 if (!group
->meth
->make_affine(group
, points
[i
], ctx
))
696 /* Wrapper to simple binary polynomial field multiplication implementation. */
697 int ec_GF2m_simple_field_mul(const EC_GROUP
*group
, BIGNUM
*r
,
698 const BIGNUM
*a
, const BIGNUM
*b
, BN_CTX
*ctx
)
700 return BN_GF2m_mod_mul_arr(r
, a
, b
, group
->poly
, ctx
);
703 /* Wrapper to simple binary polynomial field squaring implementation. */
704 int ec_GF2m_simple_field_sqr(const EC_GROUP
*group
, BIGNUM
*r
,
705 const BIGNUM
*a
, BN_CTX
*ctx
)
707 return BN_GF2m_mod_sqr_arr(r
, a
, group
->poly
, ctx
);
710 /* Wrapper to simple binary polynomial field division implementation. */
711 int ec_GF2m_simple_field_div(const EC_GROUP
*group
, BIGNUM
*r
,
712 const BIGNUM
*a
, const BIGNUM
*b
, BN_CTX
*ctx
)
714 return BN_GF2m_mod_div(r
, a
, b
, group
->field
, ctx
);
718 * Lopez-Dahab ladder, pre step.
719 * See e.g. "Guide to ECC" Alg 3.40.
720 * Modified to blind s and r independently.
724 int ec_GF2m_simple_ladder_pre(const EC_GROUP
*group
,
725 EC_POINT
*r
, EC_POINT
*s
,
726 EC_POINT
*p
, BN_CTX
*ctx
)
728 /* if p is not affine, something is wrong */
729 if (p
->Z_is_one
== 0)
732 /* s blinding: make sure lambda (s->Z here) is not zero */
734 if (!BN_priv_rand_ex(s
->Z
, BN_num_bits(group
->field
) - 1,
735 BN_RAND_TOP_ANY
, BN_RAND_BOTTOM_ANY
, ctx
)) {
736 ECerr(EC_F_EC_GF2M_SIMPLE_LADDER_PRE
, ERR_R_BN_LIB
);
739 } while (BN_is_zero(s
->Z
));
741 /* if field_encode defined convert between representations */
742 if ((group
->meth
->field_encode
!= NULL
743 && !group
->meth
->field_encode(group
, s
->Z
, s
->Z
, ctx
))
744 || !group
->meth
->field_mul(group
, s
->X
, p
->X
, s
->Z
, ctx
))
747 /* r blinding: make sure lambda (r->Y here for storage) is not zero */
749 if (!BN_priv_rand_ex(r
->Y
, BN_num_bits(group
->field
) - 1,
750 BN_RAND_TOP_ANY
, BN_RAND_BOTTOM_ANY
, ctx
)) {
751 ECerr(EC_F_EC_GF2M_SIMPLE_LADDER_PRE
, ERR_R_BN_LIB
);
754 } while (BN_is_zero(r
->Y
));
756 if ((group
->meth
->field_encode
!= NULL
757 && !group
->meth
->field_encode(group
, r
->Y
, r
->Y
, ctx
))
758 || !group
->meth
->field_sqr(group
, r
->Z
, p
->X
, ctx
)
759 || !group
->meth
->field_sqr(group
, r
->X
, r
->Z
, ctx
)
760 || !BN_GF2m_add(r
->X
, r
->X
, group
->b
)
761 || !group
->meth
->field_mul(group
, r
->Z
, r
->Z
, r
->Y
, ctx
)
762 || !group
->meth
->field_mul(group
, r
->X
, r
->X
, r
->Y
, ctx
))
772 * Ladder step: differential addition-and-doubling, mixed Lopez-Dahab coords.
773 * http://www.hyperelliptic.org/EFD/g12o/auto-code/shortw/xz/ladder/mladd-2003-s.op3
774 * s := r + s, r := 2r
777 int ec_GF2m_simple_ladder_step(const EC_GROUP
*group
,
778 EC_POINT
*r
, EC_POINT
*s
,
779 EC_POINT
*p
, BN_CTX
*ctx
)
781 if (!group
->meth
->field_mul(group
, r
->Y
, r
->Z
, s
->X
, ctx
)
782 || !group
->meth
->field_mul(group
, s
->X
, r
->X
, s
->Z
, ctx
)
783 || !group
->meth
->field_sqr(group
, s
->Y
, r
->Z
, ctx
)
784 || !group
->meth
->field_sqr(group
, r
->Z
, r
->X
, ctx
)
785 || !BN_GF2m_add(s
->Z
, r
->Y
, s
->X
)
786 || !group
->meth
->field_sqr(group
, s
->Z
, s
->Z
, ctx
)
787 || !group
->meth
->field_mul(group
, s
->X
, r
->Y
, s
->X
, ctx
)
788 || !group
->meth
->field_mul(group
, r
->Y
, s
->Z
, p
->X
, ctx
)
789 || !BN_GF2m_add(s
->X
, s
->X
, r
->Y
)
790 || !group
->meth
->field_sqr(group
, r
->Y
, r
->Z
, ctx
)
791 || !group
->meth
->field_mul(group
, r
->Z
, r
->Z
, s
->Y
, ctx
)
792 || !group
->meth
->field_sqr(group
, s
->Y
, s
->Y
, ctx
)
793 || !group
->meth
->field_mul(group
, s
->Y
, s
->Y
, group
->b
, ctx
)
794 || !BN_GF2m_add(r
->X
, r
->Y
, s
->Y
))
801 * Recover affine (x,y) result from Lopez-Dahab r and s, affine p.
802 * See e.g. "Fast Multiplication on Elliptic Curves over GF(2**m)
803 * without Precomputation" (Lopez and Dahab, CHES 1999),
807 int ec_GF2m_simple_ladder_post(const EC_GROUP
*group
,
808 EC_POINT
*r
, EC_POINT
*s
,
809 EC_POINT
*p
, BN_CTX
*ctx
)
812 BIGNUM
*t0
, *t1
, *t2
= NULL
;
814 if (BN_is_zero(r
->Z
))
815 return EC_POINT_set_to_infinity(group
, r
);
817 if (BN_is_zero(s
->Z
)) {
818 if (!EC_POINT_copy(r
, p
)
819 || !EC_POINT_invert(group
, r
, ctx
)) {
820 ECerr(EC_F_EC_GF2M_SIMPLE_LADDER_POST
, ERR_R_EC_LIB
);
827 t0
= BN_CTX_get(ctx
);
828 t1
= BN_CTX_get(ctx
);
829 t2
= BN_CTX_get(ctx
);
831 ECerr(EC_F_EC_GF2M_SIMPLE_LADDER_POST
, ERR_R_MALLOC_FAILURE
);
835 if (!group
->meth
->field_mul(group
, t0
, r
->Z
, s
->Z
, ctx
)
836 || !group
->meth
->field_mul(group
, t1
, p
->X
, r
->Z
, ctx
)
837 || !BN_GF2m_add(t1
, r
->X
, t1
)
838 || !group
->meth
->field_mul(group
, t2
, p
->X
, s
->Z
, ctx
)
839 || !group
->meth
->field_mul(group
, r
->Z
, r
->X
, t2
, ctx
)
840 || !BN_GF2m_add(t2
, t2
, s
->X
)
841 || !group
->meth
->field_mul(group
, t1
, t1
, t2
, ctx
)
842 || !group
->meth
->field_sqr(group
, t2
, p
->X
, ctx
)
843 || !BN_GF2m_add(t2
, p
->Y
, t2
)
844 || !group
->meth
->field_mul(group
, t2
, t2
, t0
, ctx
)
845 || !BN_GF2m_add(t1
, t2
, t1
)
846 || !group
->meth
->field_mul(group
, t2
, p
->X
, t0
, ctx
)
847 || !group
->meth
->field_inv(group
, t2
, t2
, ctx
)
848 || !group
->meth
->field_mul(group
, t1
, t1
, t2
, ctx
)
849 || !group
->meth
->field_mul(group
, r
->X
, r
->Z
, t2
, ctx
)
850 || !BN_GF2m_add(t2
, p
->X
, r
->X
)
851 || !group
->meth
->field_mul(group
, t2
, t2
, t1
, ctx
)
852 || !BN_GF2m_add(r
->Y
, p
->Y
, t2
)
858 /* GF(2^m) field elements should always have BIGNUM::neg = 0 */
859 BN_set_negative(r
->X
, 0);
860 BN_set_negative(r
->Y
, 0);
870 int ec_GF2m_simple_points_mul(const EC_GROUP
*group
, EC_POINT
*r
,
871 const BIGNUM
*scalar
, size_t num
,
872 const EC_POINT
*points
[],
873 const BIGNUM
*scalars
[],
880 * We limit use of the ladder only to the following cases:
882 * Fixed point mul: scalar != NULL && num == 0;
883 * - r := scalars[0] * points[0]
884 * Variable point mul: scalar == NULL && num == 1;
885 * - r := scalar * G + scalars[0] * points[0]
886 * used, e.g., in ECDSA verification: scalar != NULL && num == 1
888 * In any other case (num > 1) we use the default wNAF implementation.
890 * We also let the default implementation handle degenerate cases like group
891 * order or cofactor set to 0.
893 if (num
> 1 || BN_is_zero(group
->order
) || BN_is_zero(group
->cofactor
))
894 return ec_wNAF_mul(group
, r
, scalar
, num
, points
, scalars
, ctx
);
896 if (scalar
!= NULL
&& num
== 0)
897 /* Fixed point multiplication */
898 return ec_scalar_mul_ladder(group
, r
, scalar
, NULL
, ctx
);
900 if (scalar
== NULL
&& num
== 1)
901 /* Variable point multiplication */
902 return ec_scalar_mul_ladder(group
, r
, scalars
[0], points
[0], ctx
);
905 * Double point multiplication:
906 * r := scalar * G + scalars[0] * points[0]
909 if ((t
= EC_POINT_new(group
)) == NULL
) {
910 ECerr(EC_F_EC_GF2M_SIMPLE_POINTS_MUL
, ERR_R_MALLOC_FAILURE
);
914 if (!ec_scalar_mul_ladder(group
, t
, scalar
, NULL
, ctx
)
915 || !ec_scalar_mul_ladder(group
, r
, scalars
[0], points
[0], ctx
)
916 || !EC_POINT_add(group
, r
, t
, r
, ctx
))
927 * Computes the multiplicative inverse of a in GF(2^m), storing the result in r.
928 * If a is zero (or equivalent), you'll get a EC_R_CANNOT_INVERT error.
929 * SCA hardening is with blinding: BN_GF2m_mod_inv does that.
931 static int ec_GF2m_simple_field_inv(const EC_GROUP
*group
, BIGNUM
*r
,
932 const BIGNUM
*a
, BN_CTX
*ctx
)
936 if (!(ret
= BN_GF2m_mod_inv(r
, a
, group
->field
, ctx
)))
937 ECerr(EC_F_EC_GF2M_SIMPLE_FIELD_INV
, EC_R_CANNOT_INVERT
);
941 const EC_METHOD
*EC_GF2m_simple_method(void)
943 static const EC_METHOD ret
= {
944 EC_FLAGS_DEFAULT_OCT
,
945 NID_X9_62_characteristic_two_field
,
946 ec_GF2m_simple_group_init
,
947 ec_GF2m_simple_group_finish
,
948 ec_GF2m_simple_group_clear_finish
,
949 ec_GF2m_simple_group_copy
,
950 ec_GF2m_simple_group_set_curve
,
951 ec_GF2m_simple_group_get_curve
,
952 ec_GF2m_simple_group_get_degree
,
953 ec_group_simple_order_bits
,
954 ec_GF2m_simple_group_check_discriminant
,
955 ec_GF2m_simple_point_init
,
956 ec_GF2m_simple_point_finish
,
957 ec_GF2m_simple_point_clear_finish
,
958 ec_GF2m_simple_point_copy
,
959 ec_GF2m_simple_point_set_to_infinity
,
960 ec_GF2m_simple_point_set_affine_coordinates
,
961 ec_GF2m_simple_point_get_affine_coordinates
,
962 0, /* point_set_compressed_coordinates */
967 ec_GF2m_simple_invert
,
968 ec_GF2m_simple_is_at_infinity
,
969 ec_GF2m_simple_is_on_curve
,
971 ec_GF2m_simple_make_affine
,
972 ec_GF2m_simple_points_make_affine
,
973 ec_GF2m_simple_points_mul
,
974 0, /* precompute_mult */
975 0, /* have_precompute_mult */
976 ec_GF2m_simple_field_mul
,
977 ec_GF2m_simple_field_sqr
,
978 ec_GF2m_simple_field_div
,
979 ec_GF2m_simple_field_inv
,
980 0, /* field_encode */
981 0, /* field_decode */
982 0, /* field_set_to_one */
983 ec_key_simple_priv2oct
,
984 ec_key_simple_oct2priv
,
986 ec_key_simple_generate_key
,
987 ec_key_simple_check_key
,
988 ec_key_simple_generate_public_key
,
991 ecdh_simple_compute_key
,
992 ecdsa_simple_sign_setup
,
993 ecdsa_simple_sign_sig
,
994 ecdsa_simple_verify_sig
,
995 0, /* field_inverse_mod_ord */
996 0, /* blind_coordinates */
997 ec_GF2m_simple_ladder_pre
,
998 ec_GF2m_simple_ladder_step
,
999 ec_GF2m_simple_ladder_post