1 /* crypto/ec/ecp_smpl.c */
2 /* Includes code written by Lenka Fibikova <fibikova@exp-math.uni-essen.de>
3 * for the OpenSSL project.
4 * Includes code written by Bodo Moeller for the OpenSSL project.
6 /* ====================================================================
7 * Copyright (c) 1998-2002 The OpenSSL Project. All rights reserved.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in
18 * the documentation and/or other materials provided with the
21 * 3. All advertising materials mentioning features or use of this
22 * software must display the following acknowledgment:
23 * "This product includes software developed by the OpenSSL Project
24 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
26 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
27 * endorse or promote products derived from this software without
28 * prior written permission. For written permission, please contact
29 * openssl-core@openssl.org.
31 * 5. Products derived from this software may not be called "OpenSSL"
32 * nor may "OpenSSL" appear in their names without prior written
33 * permission of the OpenSSL Project.
35 * 6. Redistributions of any form whatsoever must retain the following
37 * "This product includes software developed by the OpenSSL Project
38 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
40 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
41 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
43 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
44 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
45 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
46 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
47 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
49 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
50 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
51 * OF THE POSSIBILITY OF SUCH DAMAGE.
52 * ====================================================================
54 * This product includes cryptographic software written by Eric Young
55 * (eay@cryptsoft.com). This product includes software written by Tim
56 * Hudson (tjh@cryptsoft.com).
59 /* ====================================================================
60 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
61 * Portions of this software developed by SUN MICROSYSTEMS, INC.,
62 * and contributed to the OpenSSL project.
65 #include <openssl/err.h>
66 #include <openssl/symhacks.h>
70 const EC_METHOD *EC_GFp_simple_method(void)
72 static const EC_METHOD ret = {
73 NID_X9_62_prime_field,
74 ec_GFp_simple_group_init,
75 ec_GFp_simple_group_finish,
76 ec_GFp_simple_group_clear_finish,
77 ec_GFp_simple_group_copy,
78 ec_GFp_simple_group_set_curve,
79 ec_GFp_simple_group_get_curve,
80 ec_GFp_simple_group_get_degree,
81 ec_GFp_simple_group_check_discriminant,
82 ec_GFp_simple_point_init,
83 ec_GFp_simple_point_finish,
84 ec_GFp_simple_point_clear_finish,
85 ec_GFp_simple_point_copy,
86 ec_GFp_simple_point_set_to_infinity,
87 ec_GFp_simple_set_Jprojective_coordinates_GFp,
88 ec_GFp_simple_get_Jprojective_coordinates_GFp,
89 ec_GFp_simple_point_set_affine_coordinates,
90 ec_GFp_simple_point_get_affine_coordinates,
91 ec_GFp_simple_set_compressed_coordinates,
92 ec_GFp_simple_point2oct,
93 ec_GFp_simple_oct2point,
97 ec_GFp_simple_is_at_infinity,
98 ec_GFp_simple_is_on_curve,
100 ec_GFp_simple_make_affine,
101 ec_GFp_simple_points_make_affine,
103 0 /* precompute_mult */,
104 0 /* have_precompute_mult */,
105 ec_GFp_simple_field_mul,
106 ec_GFp_simple_field_sqr,
108 0 /* field_encode */,
109 0 /* field_decode */,
110 0 /* field_set_to_one */ };
116 /* Most method functions in this file are designed to work with
117 * non-trivial representations of field elements if necessary
118 * (see ecp_mont.c): while standard modular addition and subtraction
119 * are used, the field_mul and field_sqr methods will be used for
120 * multiplication, and field_encode and field_decode (if defined)
121 * will be used for converting between representations.
123 * Functions ec_GFp_simple_points_make_affine() and
124 * ec_GFp_simple_point_get_affine_coordinates() specifically assume
125 * that if a non-trivial representation is used, it is a Montgomery
126 * representation (i.e. 'encoding' means multiplying by some factor R).
130 int ec_GFp_simple_group_init(EC_GROUP *group)
132 BN_init(&group->field);
135 group->a_is_minus3 = 0;
140 void ec_GFp_simple_group_finish(EC_GROUP *group)
142 BN_free(&group->field);
148 void ec_GFp_simple_group_clear_finish(EC_GROUP *group)
150 BN_clear_free(&group->field);
151 BN_clear_free(&group->a);
152 BN_clear_free(&group->b);
156 int ec_GFp_simple_group_copy(EC_GROUP *dest, const EC_GROUP *src)
158 if (!BN_copy(&dest->field, &src->field)) return 0;
159 if (!BN_copy(&dest->a, &src->a)) return 0;
160 if (!BN_copy(&dest->b, &src->b)) return 0;
162 dest->a_is_minus3 = src->a_is_minus3;
168 int ec_GFp_simple_group_set_curve(EC_GROUP *group,
169 const BIGNUM *p, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
172 BN_CTX *new_ctx = NULL;
175 /* p must be a prime > 3 */
176 if (BN_num_bits(p) <= 2 || !BN_is_odd(p))
178 ECerr(EC_F_EC_GFP_SIMPLE_GROUP_SET_CURVE, EC_R_INVALID_FIELD);
184 ctx = new_ctx = BN_CTX_new();
190 tmp_a = BN_CTX_get(ctx);
191 if (tmp_a == NULL) goto err;
194 if (!BN_copy(&group->field, p)) goto err;
195 BN_set_negative(&group->field, 0);
198 if (!BN_nnmod(tmp_a, a, p, ctx)) goto err;
199 if (group->meth->field_encode)
200 { if (!group->meth->field_encode(group, &group->a, tmp_a, ctx)) goto err; }
202 if (!BN_copy(&group->a, tmp_a)) goto err;
205 if (!BN_nnmod(&group->b, b, p, ctx)) goto err;
206 if (group->meth->field_encode)
207 if (!group->meth->field_encode(group, &group->b, &group->b, ctx)) goto err;
209 /* group->a_is_minus3 */
210 if (!BN_add_word(tmp_a, 3)) goto err;
211 group->a_is_minus3 = (0 == BN_cmp(tmp_a, &group->field));
218 BN_CTX_free(new_ctx);
223 int ec_GFp_simple_group_get_curve(const EC_GROUP *group, BIGNUM *p, BIGNUM *a, BIGNUM *b, BN_CTX *ctx)
226 BN_CTX *new_ctx = NULL;
230 if (!BN_copy(p, &group->field)) return 0;
233 if (a != NULL || b != NULL)
235 if (group->meth->field_decode)
239 ctx = new_ctx = BN_CTX_new();
245 if (!group->meth->field_decode(group, a, &group->a, ctx)) goto err;
249 if (!group->meth->field_decode(group, b, &group->b, ctx)) goto err;
256 if (!BN_copy(a, &group->a)) goto err;
260 if (!BN_copy(b, &group->b)) goto err;
269 BN_CTX_free(new_ctx);
274 int ec_GFp_simple_group_get_degree(const EC_GROUP *group)
276 return BN_num_bits(&group->field);
280 int ec_GFp_simple_group_check_discriminant(const EC_GROUP *group, BN_CTX *ctx)
283 BIGNUM *a,*b,*order,*tmp_1,*tmp_2;
284 const BIGNUM *p = &group->field;
285 BN_CTX *new_ctx = NULL;
289 ctx = new_ctx = BN_CTX_new();
292 ECerr(EC_F_EC_GFP_SIMPLE_GROUP_CHECK_DISCRIMINANT, ERR_R_MALLOC_FAILURE);
299 tmp_1 = BN_CTX_get(ctx);
300 tmp_2 = BN_CTX_get(ctx);
301 order = BN_CTX_get(ctx);
302 if (order == NULL) goto err;
304 if (group->meth->field_decode)
306 if (!group->meth->field_decode(group, a, &group->a, ctx)) goto err;
307 if (!group->meth->field_decode(group, b, &group->b, ctx)) goto err;
311 if (!BN_copy(a, &group->a)) goto err;
312 if (!BN_copy(b, &group->b)) goto err;
315 /* check the discriminant:
316 * y^2 = x^3 + a*x + b is an elliptic curve <=> 4*a^3 + 27*b^2 != 0 (mod p)
320 if (BN_is_zero(b)) goto err;
322 else if (!BN_is_zero(b))
324 if (!BN_mod_sqr(tmp_1, a, p, ctx)) goto err;
325 if (!BN_mod_mul(tmp_2, tmp_1, a, p, ctx)) goto err;
326 if (!BN_lshift(tmp_1, tmp_2, 2)) goto err;
329 if (!BN_mod_sqr(tmp_2, b, p, ctx)) goto err;
330 if (!BN_mul_word(tmp_2, 27)) goto err;
333 if (!BN_mod_add(a, tmp_1, tmp_2, p, ctx)) goto err;
334 if (BN_is_zero(a)) goto err;
341 BN_CTX_free(new_ctx);
346 int ec_GFp_simple_point_init(EC_POINT *point)
357 void ec_GFp_simple_point_finish(EC_POINT *point)
365 void ec_GFp_simple_point_clear_finish(EC_POINT *point)
367 BN_clear_free(&point->X);
368 BN_clear_free(&point->Y);
369 BN_clear_free(&point->Z);
374 int ec_GFp_simple_point_copy(EC_POINT *dest, const EC_POINT *src)
376 if (!BN_copy(&dest->X, &src->X)) return 0;
377 if (!BN_copy(&dest->Y, &src->Y)) return 0;
378 if (!BN_copy(&dest->Z, &src->Z)) return 0;
379 dest->Z_is_one = src->Z_is_one;
385 int ec_GFp_simple_point_set_to_infinity(const EC_GROUP *group, EC_POINT *point)
393 int ec_GFp_simple_set_Jprojective_coordinates_GFp(const EC_GROUP *group, EC_POINT *point,
394 const BIGNUM *x, const BIGNUM *y, const BIGNUM *z, BN_CTX *ctx)
396 BN_CTX *new_ctx = NULL;
401 ctx = new_ctx = BN_CTX_new();
408 if (!BN_nnmod(&point->X, x, &group->field, ctx)) goto err;
409 if (group->meth->field_encode)
411 if (!group->meth->field_encode(group, &point->X, &point->X, ctx)) goto err;
417 if (!BN_nnmod(&point->Y, y, &group->field, ctx)) goto err;
418 if (group->meth->field_encode)
420 if (!group->meth->field_encode(group, &point->Y, &point->Y, ctx)) goto err;
428 if (!BN_nnmod(&point->Z, z, &group->field, ctx)) goto err;
429 Z_is_one = BN_is_one(&point->Z);
430 if (group->meth->field_encode)
432 if (Z_is_one && (group->meth->field_set_to_one != 0))
434 if (!group->meth->field_set_to_one(group, &point->Z, ctx)) goto err;
438 if (!group->meth->field_encode(group, &point->Z, &point->Z, ctx)) goto err;
441 point->Z_is_one = Z_is_one;
448 BN_CTX_free(new_ctx);
453 int ec_GFp_simple_get_Jprojective_coordinates_GFp(const EC_GROUP *group, const EC_POINT *point,
454 BIGNUM *x, BIGNUM *y, BIGNUM *z, BN_CTX *ctx)
456 BN_CTX *new_ctx = NULL;
459 if (group->meth->field_decode != 0)
463 ctx = new_ctx = BN_CTX_new();
470 if (!group->meth->field_decode(group, x, &point->X, ctx)) goto err;
474 if (!group->meth->field_decode(group, y, &point->Y, ctx)) goto err;
478 if (!group->meth->field_decode(group, z, &point->Z, ctx)) goto err;
485 if (!BN_copy(x, &point->X)) goto err;
489 if (!BN_copy(y, &point->Y)) goto err;
493 if (!BN_copy(z, &point->Z)) goto err;
501 BN_CTX_free(new_ctx);
506 int ec_GFp_simple_point_set_affine_coordinates(const EC_GROUP *group, EC_POINT *point,
507 const BIGNUM *x, const BIGNUM *y, BN_CTX *ctx)
509 if (x == NULL || y == NULL)
511 /* unlike for projective coordinates, we do not tolerate this */
512 ECerr(EC_F_EC_GFP_SIMPLE_POINT_SET_AFFINE_COORDINATES, ERR_R_PASSED_NULL_PARAMETER);
516 return EC_POINT_set_Jprojective_coordinates_GFp(group, point, x, y, BN_value_one(), ctx);
520 int ec_GFp_simple_point_get_affine_coordinates(const EC_GROUP *group, const EC_POINT *point,
521 BIGNUM *x, BIGNUM *y, BN_CTX *ctx)
523 BN_CTX *new_ctx = NULL;
524 BIGNUM *Z, *Z_1, *Z_2, *Z_3;
528 if (EC_POINT_is_at_infinity(group, point))
530 ECerr(EC_F_EC_GFP_SIMPLE_POINT_GET_AFFINE_COORDINATES, EC_R_POINT_AT_INFINITY);
536 ctx = new_ctx = BN_CTX_new();
543 Z_1 = BN_CTX_get(ctx);
544 Z_2 = BN_CTX_get(ctx);
545 Z_3 = BN_CTX_get(ctx);
546 if (Z_3 == NULL) goto err;
548 /* transform (X, Y, Z) into (x, y) := (X/Z^2, Y/Z^3) */
550 if (group->meth->field_decode)
552 if (!group->meth->field_decode(group, Z, &point->Z, ctx)) goto err;
562 if (group->meth->field_decode)
566 if (!group->meth->field_decode(group, x, &point->X, ctx)) goto err;
570 if (!group->meth->field_decode(group, y, &point->Y, ctx)) goto err;
577 if (!BN_copy(x, &point->X)) goto err;
581 if (!BN_copy(y, &point->Y)) goto err;
587 if (!BN_mod_inverse(Z_1, Z_, &group->field, ctx))
589 ECerr(EC_F_EC_GFP_SIMPLE_POINT_GET_AFFINE_COORDINATES, ERR_R_BN_LIB);
593 if (group->meth->field_encode == 0)
595 /* field_sqr works on standard representation */
596 if (!group->meth->field_sqr(group, Z_2, Z_1, ctx)) goto err;
600 if (!BN_mod_sqr(Z_2, Z_1, &group->field, ctx)) goto err;
605 /* in the Montgomery case, field_mul will cancel out Montgomery factor in X: */
606 if (!group->meth->field_mul(group, x, &point->X, Z_2, ctx)) goto err;
611 if (group->meth->field_encode == 0)
613 /* field_mul works on standard representation */
614 if (!group->meth->field_mul(group, Z_3, Z_2, Z_1, ctx)) goto err;
618 if (!BN_mod_mul(Z_3, Z_2, Z_1, &group->field, ctx)) goto err;
621 /* in the Montgomery case, field_mul will cancel out Montgomery factor in Y: */
622 if (!group->meth->field_mul(group, y, &point->Y, Z_3, ctx)) goto err;
631 BN_CTX_free(new_ctx);
636 int ec_GFp_simple_set_compressed_coordinates(const EC_GROUP *group, EC_POINT *point,
637 const BIGNUM *x_, int y_bit, BN_CTX *ctx)
639 BN_CTX *new_ctx = NULL;
640 BIGNUM *tmp1, *tmp2, *x, *y;
643 /* clear error queue*/
648 ctx = new_ctx = BN_CTX_new();
653 y_bit = (y_bit != 0);
656 tmp1 = BN_CTX_get(ctx);
657 tmp2 = BN_CTX_get(ctx);
660 if (y == NULL) goto err;
662 /* Recover y. We have a Weierstrass equation
663 * y^2 = x^3 + a*x + b,
664 * so y is one of the square roots of x^3 + a*x + b.
668 if (!BN_nnmod(x, x_, &group->field,ctx)) goto err;
669 if (group->meth->field_decode == 0)
671 /* field_{sqr,mul} work on standard representation */
672 if (!group->meth->field_sqr(group, tmp2, x_, ctx)) goto err;
673 if (!group->meth->field_mul(group, tmp1, tmp2, x_, ctx)) goto err;
677 if (!BN_mod_sqr(tmp2, x_, &group->field, ctx)) goto err;
678 if (!BN_mod_mul(tmp1, tmp2, x_, &group->field, ctx)) goto err;
681 /* tmp1 := tmp1 + a*x */
682 if (group->a_is_minus3)
684 if (!BN_mod_lshift1_quick(tmp2, x, &group->field)) goto err;
685 if (!BN_mod_add_quick(tmp2, tmp2, x, &group->field)) goto err;
686 if (!BN_mod_sub_quick(tmp1, tmp1, tmp2, &group->field)) goto err;
690 if (group->meth->field_decode)
692 if (!group->meth->field_decode(group, tmp2, &group->a, ctx)) goto err;
693 if (!BN_mod_mul(tmp2, tmp2, x, &group->field, ctx)) goto err;
697 /* field_mul works on standard representation */
698 if (!group->meth->field_mul(group, tmp2, &group->a, x, ctx)) goto err;
701 if (!BN_mod_add_quick(tmp1, tmp1, tmp2, &group->field)) goto err;
704 /* tmp1 := tmp1 + b */
705 if (group->meth->field_decode)
707 if (!group->meth->field_decode(group, tmp2, &group->b, ctx)) goto err;
708 if (!BN_mod_add_quick(tmp1, tmp1, tmp2, &group->field)) goto err;
712 if (!BN_mod_add_quick(tmp1, tmp1, &group->b, &group->field)) goto err;
715 if (!BN_mod_sqrt(y, tmp1, &group->field, ctx))
717 unsigned long err = ERR_peek_last_error();
719 if (ERR_GET_LIB(err) == ERR_LIB_BN && ERR_GET_REASON(err) == BN_R_NOT_A_SQUARE)
722 ECerr(EC_F_EC_GFP_SIMPLE_SET_COMPRESSED_COORDINATES, EC_R_INVALID_COMPRESSED_POINT);
725 ECerr(EC_F_EC_GFP_SIMPLE_SET_COMPRESSED_COORDINATES, ERR_R_BN_LIB);
729 if (y_bit != BN_is_odd(y))
735 kron = BN_kronecker(x, &group->field, ctx);
736 if (kron == -2) goto err;
739 ECerr(EC_F_EC_GFP_SIMPLE_SET_COMPRESSED_COORDINATES, EC_R_INVALID_COMPRESSION_BIT);
741 /* BN_mod_sqrt() should have cought this error (not a square) */
742 ECerr(EC_F_EC_GFP_SIMPLE_SET_COMPRESSED_COORDINATES, EC_R_INVALID_COMPRESSED_POINT);
745 if (!BN_usub(y, &group->field, y)) goto err;
747 if (y_bit != BN_is_odd(y))
749 ECerr(EC_F_EC_GFP_SIMPLE_SET_COMPRESSED_COORDINATES, ERR_R_INTERNAL_ERROR);
753 if (!EC_POINT_set_affine_coordinates_GFp(group, point, x, y, ctx)) goto err;
760 BN_CTX_free(new_ctx);
765 size_t ec_GFp_simple_point2oct(const EC_GROUP *group, const EC_POINT *point, point_conversion_form_t form,
766 unsigned char *buf, size_t len, BN_CTX *ctx)
769 BN_CTX *new_ctx = NULL;
772 size_t field_len, i, skip;
774 if ((form != POINT_CONVERSION_COMPRESSED)
775 && (form != POINT_CONVERSION_UNCOMPRESSED)
776 && (form != POINT_CONVERSION_HYBRID))
778 ECerr(EC_F_EC_GFP_SIMPLE_POINT2OCT, EC_R_INVALID_FORM);
782 if (EC_POINT_is_at_infinity(group, point))
784 /* encodes to a single 0 octet */
789 ECerr(EC_F_EC_GFP_SIMPLE_POINT2OCT, EC_R_BUFFER_TOO_SMALL);
798 /* ret := required output buffer length */
799 field_len = BN_num_bytes(&group->field);
800 ret = (form == POINT_CONVERSION_COMPRESSED) ? 1 + field_len : 1 + 2*field_len;
802 /* if 'buf' is NULL, just return required length */
807 ECerr(EC_F_EC_GFP_SIMPLE_POINT2OCT, EC_R_BUFFER_TOO_SMALL);
813 ctx = new_ctx = BN_CTX_new();
822 if (y == NULL) goto err;
824 if (!EC_POINT_get_affine_coordinates_GFp(group, point, x, y, ctx)) goto err;
826 if ((form == POINT_CONVERSION_COMPRESSED || form == POINT_CONVERSION_HYBRID) && BN_is_odd(y))
833 skip = field_len - BN_num_bytes(x);
834 if (skip > field_len)
836 ECerr(EC_F_EC_GFP_SIMPLE_POINT2OCT, ERR_R_INTERNAL_ERROR);
844 skip = BN_bn2bin(x, buf + i);
846 if (i != 1 + field_len)
848 ECerr(EC_F_EC_GFP_SIMPLE_POINT2OCT, ERR_R_INTERNAL_ERROR);
852 if (form == POINT_CONVERSION_UNCOMPRESSED || form == POINT_CONVERSION_HYBRID)
854 skip = field_len - BN_num_bytes(y);
855 if (skip > field_len)
857 ECerr(EC_F_EC_GFP_SIMPLE_POINT2OCT, ERR_R_INTERNAL_ERROR);
865 skip = BN_bn2bin(y, buf + i);
871 ECerr(EC_F_EC_GFP_SIMPLE_POINT2OCT, ERR_R_INTERNAL_ERROR);
879 BN_CTX_free(new_ctx);
886 BN_CTX_free(new_ctx);
891 int ec_GFp_simple_oct2point(const EC_GROUP *group, EC_POINT *point,
892 const unsigned char *buf, size_t len, BN_CTX *ctx)
894 point_conversion_form_t form;
896 BN_CTX *new_ctx = NULL;
898 size_t field_len, enc_len;
903 ECerr(EC_F_EC_GFP_SIMPLE_OCT2POINT, EC_R_BUFFER_TOO_SMALL);
909 if ((form != 0) && (form != POINT_CONVERSION_COMPRESSED)
910 && (form != POINT_CONVERSION_UNCOMPRESSED)
911 && (form != POINT_CONVERSION_HYBRID))
913 ECerr(EC_F_EC_GFP_SIMPLE_OCT2POINT, EC_R_INVALID_ENCODING);
916 if ((form == 0 || form == POINT_CONVERSION_UNCOMPRESSED) && y_bit)
918 ECerr(EC_F_EC_GFP_SIMPLE_OCT2POINT, EC_R_INVALID_ENCODING);
926 ECerr(EC_F_EC_GFP_SIMPLE_OCT2POINT, EC_R_INVALID_ENCODING);
930 return EC_POINT_set_to_infinity(group, point);
933 field_len = BN_num_bytes(&group->field);
934 enc_len = (form == POINT_CONVERSION_COMPRESSED) ? 1 + field_len : 1 + 2*field_len;
938 ECerr(EC_F_EC_GFP_SIMPLE_OCT2POINT, EC_R_INVALID_ENCODING);
944 ctx = new_ctx = BN_CTX_new();
952 if (y == NULL) goto err;
954 if (!BN_bin2bn(buf + 1, field_len, x)) goto err;
955 if (BN_ucmp(x, &group->field) >= 0)
957 ECerr(EC_F_EC_GFP_SIMPLE_OCT2POINT, EC_R_INVALID_ENCODING);
961 if (form == POINT_CONVERSION_COMPRESSED)
963 if (!EC_POINT_set_compressed_coordinates_GFp(group, point, x, y_bit, ctx)) goto err;
967 if (!BN_bin2bn(buf + 1 + field_len, field_len, y)) goto err;
968 if (BN_ucmp(y, &group->field) >= 0)
970 ECerr(EC_F_EC_GFP_SIMPLE_OCT2POINT, EC_R_INVALID_ENCODING);
973 if (form == POINT_CONVERSION_HYBRID)
975 if (y_bit != BN_is_odd(y))
977 ECerr(EC_F_EC_GFP_SIMPLE_OCT2POINT, EC_R_INVALID_ENCODING);
982 if (!EC_POINT_set_affine_coordinates_GFp(group, point, x, y, ctx)) goto err;
985 if (!EC_POINT_is_on_curve(group, point, ctx)) /* test required by X9.62 */
987 ECerr(EC_F_EC_GFP_SIMPLE_OCT2POINT, EC_R_POINT_IS_NOT_ON_CURVE);
996 BN_CTX_free(new_ctx);
1001 int ec_GFp_simple_add(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a, const EC_POINT *b, BN_CTX *ctx)
1003 int (*field_mul)(const EC_GROUP *, BIGNUM *, const BIGNUM *, const BIGNUM *, BN_CTX *);
1004 int (*field_sqr)(const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *);
1006 BN_CTX *new_ctx = NULL;
1007 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6;
1011 return EC_POINT_dbl(group, r, a, ctx);
1012 if (EC_POINT_is_at_infinity(group, a))
1013 return EC_POINT_copy(r, b);
1014 if (EC_POINT_is_at_infinity(group, b))
1015 return EC_POINT_copy(r, a);
1017 field_mul = group->meth->field_mul;
1018 field_sqr = group->meth->field_sqr;
1023 ctx = new_ctx = BN_CTX_new();
1029 n0 = BN_CTX_get(ctx);
1030 n1 = BN_CTX_get(ctx);
1031 n2 = BN_CTX_get(ctx);
1032 n3 = BN_CTX_get(ctx);
1033 n4 = BN_CTX_get(ctx);
1034 n5 = BN_CTX_get(ctx);
1035 n6 = BN_CTX_get(ctx);
1036 if (n6 == NULL) goto end;
1038 /* Note that in this function we must not read components of 'a' or 'b'
1039 * once we have written the corresponding components of 'r'.
1040 * ('r' might be one of 'a' or 'b'.)
1046 if (!BN_copy(n1, &a->X)) goto end;
1047 if (!BN_copy(n2, &a->Y)) goto end;
1053 if (!field_sqr(group, n0, &b->Z, ctx)) goto end;
1054 if (!field_mul(group, n1, &a->X, n0, ctx)) goto end;
1055 /* n1 = X_a * Z_b^2 */
1057 if (!field_mul(group, n0, n0, &b->Z, ctx)) goto end;
1058 if (!field_mul(group, n2, &a->Y, n0, ctx)) goto end;
1059 /* n2 = Y_a * Z_b^3 */
1065 if (!BN_copy(n3, &b->X)) goto end;
1066 if (!BN_copy(n4, &b->Y)) goto end;
1072 if (!field_sqr(group, n0, &a->Z, ctx)) goto end;
1073 if (!field_mul(group, n3, &b->X, n0, ctx)) goto end;
1074 /* n3 = X_b * Z_a^2 */
1076 if (!field_mul(group, n0, n0, &a->Z, ctx)) goto end;
1077 if (!field_mul(group, n4, &b->Y, n0, ctx)) goto end;
1078 /* n4 = Y_b * Z_a^3 */
1082 if (!BN_mod_sub_quick(n5, n1, n3, p)) goto end;
1083 if (!BN_mod_sub_quick(n6, n2, n4, p)) goto end;
1091 /* a is the same point as b */
1093 ret = EC_POINT_dbl(group, r, a, ctx);
1099 /* a is the inverse of b */
1108 if (!BN_mod_add_quick(n1, n1, n3, p)) goto end;
1109 if (!BN_mod_add_quick(n2, n2, n4, p)) goto end;
1110 /* 'n7' = n1 + n3 */
1111 /* 'n8' = n2 + n4 */
1114 if (a->Z_is_one && b->Z_is_one)
1116 if (!BN_copy(&r->Z, n5)) goto end;
1121 { if (!BN_copy(n0, &b->Z)) goto end; }
1122 else if (b->Z_is_one)
1123 { if (!BN_copy(n0, &a->Z)) goto end; }
1125 { if (!field_mul(group, n0, &a->Z, &b->Z, ctx)) goto end; }
1126 if (!field_mul(group, &r->Z, n0, n5, ctx)) goto end;
1129 /* Z_r = Z_a * Z_b * n5 */
1132 if (!field_sqr(group, n0, n6, ctx)) goto end;
1133 if (!field_sqr(group, n4, n5, ctx)) goto end;
1134 if (!field_mul(group, n3, n1, n4, ctx)) goto end;
1135 if (!BN_mod_sub_quick(&r->X, n0, n3, p)) goto end;
1136 /* X_r = n6^2 - n5^2 * 'n7' */
1139 if (!BN_mod_lshift1_quick(n0, &r->X, p)) goto end;
1140 if (!BN_mod_sub_quick(n0, n3, n0, p)) goto end;
1141 /* n9 = n5^2 * 'n7' - 2 * X_r */
1144 if (!field_mul(group, n0, n0, n6, ctx)) goto end;
1145 if (!field_mul(group, n5, n4, n5, ctx)) goto end; /* now n5 is n5^3 */
1146 if (!field_mul(group, n1, n2, n5, ctx)) goto end;
1147 if (!BN_mod_sub_quick(n0, n0, n1, p)) goto end;
1149 if (!BN_add(n0, n0, p)) goto end;
1150 /* now 0 <= n0 < 2*p, and n0 is even */
1151 if (!BN_rshift1(&r->Y, n0)) goto end;
1152 /* Y_r = (n6 * 'n9' - 'n8' * 'n5^3') / 2 */
1157 if (ctx) /* otherwise we already called BN_CTX_end */
1159 if (new_ctx != NULL)
1160 BN_CTX_free(new_ctx);
1165 int ec_GFp_simple_dbl(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a, BN_CTX *ctx)
1167 int (*field_mul)(const EC_GROUP *, BIGNUM *, const BIGNUM *, const BIGNUM *, BN_CTX *);
1168 int (*field_sqr)(const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *);
1170 BN_CTX *new_ctx = NULL;
1171 BIGNUM *n0, *n1, *n2, *n3;
1174 if (EC_POINT_is_at_infinity(group, a))
1181 field_mul = group->meth->field_mul;
1182 field_sqr = group->meth->field_sqr;
1187 ctx = new_ctx = BN_CTX_new();
1193 n0 = BN_CTX_get(ctx);
1194 n1 = BN_CTX_get(ctx);
1195 n2 = BN_CTX_get(ctx);
1196 n3 = BN_CTX_get(ctx);
1197 if (n3 == NULL) goto err;
1199 /* Note that in this function we must not read components of 'a'
1200 * once we have written the corresponding components of 'r'.
1201 * ('r' might the same as 'a'.)
1207 if (!field_sqr(group, n0, &a->X, ctx)) goto err;
1208 if (!BN_mod_lshift1_quick(n1, n0, p)) goto err;
1209 if (!BN_mod_add_quick(n0, n0, n1, p)) goto err;
1210 if (!BN_mod_add_quick(n1, n0, &group->a, p)) goto err;
1211 /* n1 = 3 * X_a^2 + a_curve */
1213 else if (group->a_is_minus3)
1215 if (!field_sqr(group, n1, &a->Z, ctx)) goto err;
1216 if (!BN_mod_add_quick(n0, &a->X, n1, p)) goto err;
1217 if (!BN_mod_sub_quick(n2, &a->X, n1, p)) goto err;
1218 if (!field_mul(group, n1, n0, n2, ctx)) goto err;
1219 if (!BN_mod_lshift1_quick(n0, n1, p)) goto err;
1220 if (!BN_mod_add_quick(n1, n0, n1, p)) goto err;
1221 /* n1 = 3 * (X_a + Z_a^2) * (X_a - Z_a^2)
1222 * = 3 * X_a^2 - 3 * Z_a^4 */
1226 if (!field_sqr(group, n0, &a->X, ctx)) goto err;
1227 if (!BN_mod_lshift1_quick(n1, n0, p)) goto err;
1228 if (!BN_mod_add_quick(n0, n0, n1, p)) goto err;
1229 if (!field_sqr(group, n1, &a->Z, ctx)) goto err;
1230 if (!field_sqr(group, n1, n1, ctx)) goto err;
1231 if (!field_mul(group, n1, n1, &group->a, ctx)) goto err;
1232 if (!BN_mod_add_quick(n1, n1, n0, p)) goto err;
1233 /* n1 = 3 * X_a^2 + a_curve * Z_a^4 */
1239 if (!BN_copy(n0, &a->Y)) goto err;
1243 if (!field_mul(group, n0, &a->Y, &a->Z, ctx)) goto err;
1245 if (!BN_mod_lshift1_quick(&r->Z, n0, p)) goto err;
1247 /* Z_r = 2 * Y_a * Z_a */
1250 if (!field_sqr(group, n3, &a->Y, ctx)) goto err;
1251 if (!field_mul(group, n2, &a->X, n3, ctx)) goto err;
1252 if (!BN_mod_lshift_quick(n2, n2, 2, p)) goto err;
1253 /* n2 = 4 * X_a * Y_a^2 */
1256 if (!BN_mod_lshift1_quick(n0, n2, p)) goto err;
1257 if (!field_sqr(group, &r->X, n1, ctx)) goto err;
1258 if (!BN_mod_sub_quick(&r->X, &r->X, n0, p)) goto err;
1259 /* X_r = n1^2 - 2 * n2 */
1262 if (!field_sqr(group, n0, n3, ctx)) goto err;
1263 if (!BN_mod_lshift_quick(n3, n0, 3, p)) goto err;
1264 /* n3 = 8 * Y_a^4 */
1267 if (!BN_mod_sub_quick(n0, n2, &r->X, p)) goto err;
1268 if (!field_mul(group, n0, n1, n0, ctx)) goto err;
1269 if (!BN_mod_sub_quick(&r->Y, n0, n3, p)) goto err;
1270 /* Y_r = n1 * (n2 - X_r) - n3 */
1276 if (new_ctx != NULL)
1277 BN_CTX_free(new_ctx);
1282 int ec_GFp_simple_invert(const EC_GROUP *group, EC_POINT *point, BN_CTX *ctx)
1284 if (EC_POINT_is_at_infinity(group, point) || BN_is_zero(&point->Y))
1285 /* point is its own inverse */
1288 return BN_usub(&point->Y, &group->field, &point->Y);
1292 int ec_GFp_simple_is_at_infinity(const EC_GROUP *group, const EC_POINT *point)
1294 return BN_is_zero(&point->Z);
1298 int ec_GFp_simple_is_on_curve(const EC_GROUP *group, const EC_POINT *point, BN_CTX *ctx)
1300 int (*field_mul)(const EC_GROUP *, BIGNUM *, const BIGNUM *, const BIGNUM *, BN_CTX *);
1301 int (*field_sqr)(const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *);
1303 BN_CTX *new_ctx = NULL;
1304 BIGNUM *rh, *tmp, *Z4, *Z6;
1307 if (EC_POINT_is_at_infinity(group, point))
1310 field_mul = group->meth->field_mul;
1311 field_sqr = group->meth->field_sqr;
1316 ctx = new_ctx = BN_CTX_new();
1322 rh = BN_CTX_get(ctx);
1323 tmp = BN_CTX_get(ctx);
1324 Z4 = BN_CTX_get(ctx);
1325 Z6 = BN_CTX_get(ctx);
1326 if (Z6 == NULL) goto err;
1328 /* We have a curve defined by a Weierstrass equation
1329 * y^2 = x^3 + a*x + b.
1330 * The point to consider is given in Jacobian projective coordinates
1331 * where (X, Y, Z) represents (x, y) = (X/Z^2, Y/Z^3).
1332 * Substituting this and multiplying by Z^6 transforms the above equation into
1333 * Y^2 = X^3 + a*X*Z^4 + b*Z^6.
1334 * To test this, we add up the right-hand side in 'rh'.
1338 if (!field_sqr(group, rh, &point->X, ctx)) goto err;
1340 if (!point->Z_is_one)
1342 if (!field_sqr(group, tmp, &point->Z, ctx)) goto err;
1343 if (!field_sqr(group, Z4, tmp, ctx)) goto err;
1344 if (!field_mul(group, Z6, Z4, tmp, ctx)) goto err;
1346 /* rh := (rh + a*Z^4)*X */
1347 if (group->a_is_minus3)
1349 if (!BN_mod_lshift1_quick(tmp, Z4, p)) goto err;
1350 if (!BN_mod_add_quick(tmp, tmp, Z4, p)) goto err;
1351 if (!BN_mod_sub_quick(rh, rh, tmp, p)) goto err;
1352 if (!field_mul(group, rh, rh, &point->X, ctx)) goto err;
1356 if (!field_mul(group, tmp, Z4, &group->a, ctx)) goto err;
1357 if (!BN_mod_add_quick(rh, rh, tmp, p)) goto err;
1358 if (!field_mul(group, rh, rh, &point->X, ctx)) goto err;
1361 /* rh := rh + b*Z^6 */
1362 if (!field_mul(group, tmp, &group->b, Z6, ctx)) goto err;
1363 if (!BN_mod_add_quick(rh, rh, tmp, p)) goto err;
1367 /* point->Z_is_one */
1369 /* rh := (rh + a)*X */
1370 if (!BN_mod_add_quick(rh, rh, &group->a, p)) goto err;
1371 if (!field_mul(group, rh, rh, &point->X, ctx)) goto err;
1373 if (!BN_mod_add_quick(rh, rh, &group->b, p)) goto err;
1377 if (!field_sqr(group, tmp, &point->Y, ctx)) goto err;
1379 ret = (0 == BN_ucmp(tmp, rh));
1383 if (new_ctx != NULL)
1384 BN_CTX_free(new_ctx);
1389 int ec_GFp_simple_cmp(const EC_GROUP *group, const EC_POINT *a, const EC_POINT *b, BN_CTX *ctx)
1393 * 0 equal (in affine coordinates)
1397 int (*field_mul)(const EC_GROUP *, BIGNUM *, const BIGNUM *, const BIGNUM *, BN_CTX *);
1398 int (*field_sqr)(const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *);
1399 BN_CTX *new_ctx = NULL;
1400 BIGNUM *tmp1, *tmp2, *Za23, *Zb23;
1401 const BIGNUM *tmp1_, *tmp2_;
1404 if (EC_POINT_is_at_infinity(group, a))
1406 return EC_POINT_is_at_infinity(group, b) ? 0 : 1;
1409 if (a->Z_is_one && b->Z_is_one)
1411 return ((BN_cmp(&a->X, &b->X) == 0) && BN_cmp(&a->Y, &b->Y) == 0) ? 0 : 1;
1414 field_mul = group->meth->field_mul;
1415 field_sqr = group->meth->field_sqr;
1419 ctx = new_ctx = BN_CTX_new();
1425 tmp1 = BN_CTX_get(ctx);
1426 tmp2 = BN_CTX_get(ctx);
1427 Za23 = BN_CTX_get(ctx);
1428 Zb23 = BN_CTX_get(ctx);
1429 if (Zb23 == NULL) goto end;
1431 /* We have to decide whether
1432 * (X_a/Z_a^2, Y_a/Z_a^3) = (X_b/Z_b^2, Y_b/Z_b^3),
1433 * or equivalently, whether
1434 * (X_a*Z_b^2, Y_a*Z_b^3) = (X_b*Z_a^2, Y_b*Z_a^3).
1439 if (!field_sqr(group, Zb23, &b->Z, ctx)) goto end;
1440 if (!field_mul(group, tmp1, &a->X, Zb23, ctx)) goto end;
1447 if (!field_sqr(group, Za23, &a->Z, ctx)) goto end;
1448 if (!field_mul(group, tmp2, &b->X, Za23, ctx)) goto end;
1454 /* compare X_a*Z_b^2 with X_b*Z_a^2 */
1455 if (BN_cmp(tmp1_, tmp2_) != 0)
1457 ret = 1; /* points differ */
1464 if (!field_mul(group, Zb23, Zb23, &b->Z, ctx)) goto end;
1465 if (!field_mul(group, tmp1, &a->Y, Zb23, ctx)) goto end;
1472 if (!field_mul(group, Za23, Za23, &a->Z, ctx)) goto end;
1473 if (!field_mul(group, tmp2, &b->Y, Za23, ctx)) goto end;
1479 /* compare Y_a*Z_b^3 with Y_b*Z_a^3 */
1480 if (BN_cmp(tmp1_, tmp2_) != 0)
1482 ret = 1; /* points differ */
1486 /* points are equal */
1491 if (new_ctx != NULL)
1492 BN_CTX_free(new_ctx);
1497 int ec_GFp_simple_make_affine(const EC_GROUP *group, EC_POINT *point, BN_CTX *ctx)
1499 BN_CTX *new_ctx = NULL;
1503 if (point->Z_is_one || EC_POINT_is_at_infinity(group, point))
1508 ctx = new_ctx = BN_CTX_new();
1514 x = BN_CTX_get(ctx);
1515 y = BN_CTX_get(ctx);
1516 if (y == NULL) goto err;
1518 if (!EC_POINT_get_affine_coordinates_GFp(group, point, x, y, ctx)) goto err;
1519 if (!EC_POINT_set_affine_coordinates_GFp(group, point, x, y, ctx)) goto err;
1520 if (!point->Z_is_one)
1522 ECerr(EC_F_EC_GFP_SIMPLE_MAKE_AFFINE, ERR_R_INTERNAL_ERROR);
1530 if (new_ctx != NULL)
1531 BN_CTX_free(new_ctx);
1536 int ec_GFp_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx)
1538 BN_CTX *new_ctx = NULL;
1539 BIGNUM *tmp0, *tmp1;
1541 BIGNUM **heap = NULL;
1550 ctx = new_ctx = BN_CTX_new();
1556 tmp0 = BN_CTX_get(ctx);
1557 tmp1 = BN_CTX_get(ctx);
1558 if (tmp0 == NULL || tmp1 == NULL) goto err;
1560 /* Before converting the individual points, compute inverses of all Z values.
1561 * Modular inversion is rather slow, but luckily we can do with a single
1562 * explicit inversion, plus about 3 multiplications per input value.
1568 /* Now pow2 is the smallest power of 2 satifsying pow2 >= num.
1569 * We need twice that. */
1572 heap = OPENSSL_malloc(pow2 * sizeof heap[0]);
1573 if (heap == NULL) goto err;
1575 /* The array is used as a binary tree, exactly as in heapsort:
1579 * heap[4] heap[5] heap[6] heap[7]
1580 * heap[8]heap[9] heap[10]heap[11] heap[12]heap[13] heap[14] heap[15]
1582 * We put the Z's in the last line;
1583 * then we set each other node to the product of its two child-nodes (where
1584 * empty or 0 entries are treated as ones);
1585 * then we invert heap[1];
1586 * then we invert each other node by replacing it by the product of its
1587 * parent (after inversion) and its sibling (before inversion).
1590 for (i = pow2/2 - 1; i > 0; i--)
1592 for (i = 0; i < num; i++)
1593 heap[pow2/2 + i] = &points[i]->Z;
1594 for (i = pow2/2 + num; i < pow2; i++)
1597 /* set each node to the product of its children */
1598 for (i = pow2/2 - 1; i > 0; i--)
1601 if (heap[i] == NULL) goto err;
1603 if (heap[2*i] != NULL)
1605 if ((heap[2*i + 1] == NULL) || BN_is_zero(heap[2*i + 1]))
1607 if (!BN_copy(heap[i], heap[2*i])) goto err;
1611 if (BN_is_zero(heap[2*i]))
1613 if (!BN_copy(heap[i], heap[2*i + 1])) goto err;
1617 if (!group->meth->field_mul(group, heap[i],
1618 heap[2*i], heap[2*i + 1], ctx)) goto err;
1624 /* invert heap[1] */
1625 if (!BN_is_zero(heap[1]))
1627 if (!BN_mod_inverse(heap[1], heap[1], &group->field, ctx))
1629 ECerr(EC_F_EC_GFP_SIMPLE_POINTS_MAKE_AFFINE, ERR_R_BN_LIB);
1633 if (group->meth->field_encode != 0)
1635 /* in the Montgomery case, we just turned R*H (representing H)
1636 * into 1/(R*H), but we need R*(1/H) (representing 1/H);
1637 * i.e. we have need to multiply by the Montgomery factor twice */
1638 if (!group->meth->field_encode(group, heap[1], heap[1], ctx)) goto err;
1639 if (!group->meth->field_encode(group, heap[1], heap[1], ctx)) goto err;
1642 /* set other heap[i]'s to their inverses */
1643 for (i = 2; i < pow2/2 + num; i += 2)
1646 if ((heap[i + 1] != NULL) && !BN_is_zero(heap[i + 1]))
1648 if (!group->meth->field_mul(group, tmp0, heap[i/2], heap[i + 1], ctx)) goto err;
1649 if (!group->meth->field_mul(group, tmp1, heap[i/2], heap[i], ctx)) goto err;
1650 if (!BN_copy(heap[i], tmp0)) goto err;
1651 if (!BN_copy(heap[i + 1], tmp1)) goto err;
1655 if (!BN_copy(heap[i], heap[i/2])) goto err;
1659 /* we have replaced all non-zero Z's by their inverses, now fix up all the points */
1660 for (i = 0; i < num; i++)
1662 EC_POINT *p = points[i];
1664 if (!BN_is_zero(&p->Z))
1666 /* turn (X, Y, 1/Z) into (X/Z^2, Y/Z^3, 1) */
1668 if (!group->meth->field_sqr(group, tmp1, &p->Z, ctx)) goto err;
1669 if (!group->meth->field_mul(group, &p->X, &p->X, tmp1, ctx)) goto err;
1671 if (!group->meth->field_mul(group, tmp1, tmp1, &p->Z, ctx)) goto err;
1672 if (!group->meth->field_mul(group, &p->Y, &p->Y, tmp1, ctx)) goto err;
1674 if (group->meth->field_set_to_one != 0)
1676 if (!group->meth->field_set_to_one(group, &p->Z, ctx)) goto err;
1680 if (!BN_one(&p->Z)) goto err;
1690 if (new_ctx != NULL)
1691 BN_CTX_free(new_ctx);
1694 /* heap[pow2/2] .. heap[pow2-1] have not been allocated locally! */
1695 for (i = pow2/2 - 1; i > 0; i--)
1697 if (heap[i] != NULL)
1698 BN_clear_free(heap[i]);
1706 int ec_GFp_simple_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
1708 return BN_mod_mul(r, a, b, &group->field, ctx);
1712 int ec_GFp_simple_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
1714 return BN_mod_sqr(r, a, &group->field, ctx);