/*- * Set s := p, r := 2p. * * For doubling we use Formula 3 from Izu-Takagi "A fast parallel elliptic curve * multiplication resistant against side channel attacks" appendix, as described * at * https://hyperelliptic.org/EFD/g1p/auto-shortw-xz.html#doubling-dbl-2002-it-2 * * The input point p will be in randomized Jacobian projective coords: * x = X/Z**2, y=Y/Z**3 * * The output points p, s, and r are converted to standard (homogeneous) * projective coords: * x = X/Z, y=Y/Z */ int ec_GFp_simple_ladder_pre(const EC_GROUP *group, EC_POINT *r, EC_POINT *s, EC_POINT *p, BN_CTX *ctx) { BIGNUM *t1, *t2, *t3, *t4, *t5, *t6 = NULL; t1 = r->Z; t2 = r->Y; t3 = s->X; t4 = r->X; t5 = s->Y; t6 = s->Z; /* convert p: (X,Y,Z) -> (XZ,Y,Z**3) */ if (!group->meth->field_mul(group, p->X, p->X, p->Z, ctx) || !group->meth->field_sqr(group, t1, p->Z, ctx) || !group->meth->field_mul(group, p->Z, p->Z, t1, ctx) /* r := 2p */ || !group->meth->field_sqr(group, t2, p->X, ctx) || !group->meth->field_sqr(group, t3, p->Z, ctx) || !group->meth->field_mul(group, t4, t3, group->a, ctx) || !BN_mod_sub_quick(t5, t2, t4, group->field) || !BN_mod_add_quick(t2, t2, t4, group->field) || !group->meth->field_sqr(group, t5, t5, ctx) || !group->meth->field_mul(group, t6, t3, group->b, ctx) || !group->meth->field_mul(group, t1, p->X, p->Z, ctx) || !group->meth->field_mul(group, t4, t1, t6, ctx) || !BN_mod_lshift_quick(t4, t4, 3, group->field) /* r->X coord output */ || !BN_mod_sub_quick(r->X, t5, t4, group->field) || !group->meth->field_mul(group, t1, t1, t2, ctx) || !group->meth->field_mul(group, t2, t3, t6, ctx) || !BN_mod_add_quick(t1, t1, t2, group->field) /* r->Z coord output */ || !BN_mod_lshift_quick(r->Z, t1, 2, group->field) || !EC_POINT_copy(s, p)) return 0; r->Z_is_one = 0; s->Z_is_one = 0; p->Z_is_one = 0; return 1; }
int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx) { BIGNUM *abs_m = NULL; int ret; if (!BN_nnmod(r, a, m, ctx)) return 0; if (m->neg) { abs_m = BN_dup(m); if (abs_m == NULL) return 0; abs_m->neg = 0; } ret = BN_mod_lshift_quick(r, r, n, (abs_m ? abs_m : m)); if (abs_m) BN_free(abs_m); return ret; }
int ec_GFp_simple_dbl(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a, BN_CTX *ctx) { int (*field_mul) (const EC_GROUP *, BIGNUM *, const BIGNUM *, const BIGNUM *, BN_CTX *); int (*field_sqr) (const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *); const BIGNUM *p; BN_CTX *new_ctx = NULL; BIGNUM *n0, *n1, *n2, *n3; int ret = 0; if (EC_POINT_is_at_infinity(group, a)) { BN_zero(r->Z); r->Z_is_one = 0; return 1; } field_mul = group->meth->field_mul; field_sqr = group->meth->field_sqr; p = group->field; if (ctx == NULL) { ctx = new_ctx = BN_CTX_new(); if (ctx == NULL) return 0; } BN_CTX_start(ctx); n0 = BN_CTX_get(ctx); n1 = BN_CTX_get(ctx); n2 = BN_CTX_get(ctx); n3 = BN_CTX_get(ctx); if (n3 == NULL) goto err; /* * Note that in this function we must not read components of 'a' once we * have written the corresponding components of 'r'. ('r' might the same * as 'a'.) */ /* n1 */ if (a->Z_is_one) { if (!field_sqr(group, n0, a->X, ctx)) goto err; if (!BN_mod_lshift1_quick(n1, n0, p)) goto err; if (!BN_mod_add_quick(n0, n0, n1, p)) goto err; if (!BN_mod_add_quick(n1, n0, group->a, p)) goto err; /* n1 = 3 * X_a^2 + a_curve */ } else if (group->a_is_minus3) { if (!field_sqr(group, n1, a->Z, ctx)) goto err; if (!BN_mod_add_quick(n0, a->X, n1, p)) goto err; if (!BN_mod_sub_quick(n2, a->X, n1, p)) goto err; if (!field_mul(group, n1, n0, n2, ctx)) goto err; if (!BN_mod_lshift1_quick(n0, n1, p)) goto err; if (!BN_mod_add_quick(n1, n0, n1, p)) goto err; /*- * n1 = 3 * (X_a + Z_a^2) * (X_a - Z_a^2) * = 3 * X_a^2 - 3 * Z_a^4 */ } else { if (!field_sqr(group, n0, a->X, ctx)) goto err; if (!BN_mod_lshift1_quick(n1, n0, p)) goto err; if (!BN_mod_add_quick(n0, n0, n1, p)) goto err; if (!field_sqr(group, n1, a->Z, ctx)) goto err; if (!field_sqr(group, n1, n1, ctx)) goto err; if (!field_mul(group, n1, n1, group->a, ctx)) goto err; if (!BN_mod_add_quick(n1, n1, n0, p)) goto err; /* n1 = 3 * X_a^2 + a_curve * Z_a^4 */ } /* Z_r */ if (a->Z_is_one) { if (!BN_copy(n0, a->Y)) goto err; } else { if (!field_mul(group, n0, a->Y, a->Z, ctx)) goto err; } if (!BN_mod_lshift1_quick(r->Z, n0, p)) goto err; r->Z_is_one = 0; /* Z_r = 2 * Y_a * Z_a */ /* n2 */ if (!field_sqr(group, n3, a->Y, ctx)) goto err; if (!field_mul(group, n2, a->X, n3, ctx)) goto err; if (!BN_mod_lshift_quick(n2, n2, 2, p)) goto err; /* n2 = 4 * X_a * Y_a^2 */ /* X_r */ if (!BN_mod_lshift1_quick(n0, n2, p)) goto err; if (!field_sqr(group, r->X, n1, ctx)) goto err; if (!BN_mod_sub_quick(r->X, r->X, n0, p)) goto err; /* X_r = n1^2 - 2 * n2 */ /* n3 */ if (!field_sqr(group, n0, n3, ctx)) goto err; if (!BN_mod_lshift_quick(n3, n0, 3, p)) goto err; /* n3 = 8 * Y_a^4 */ /* Y_r */ if (!BN_mod_sub_quick(n0, n2, r->X, p)) goto err; if (!field_mul(group, n0, n1, n0, ctx)) goto err; if (!BN_mod_sub_quick(r->Y, n0, n3, p)) goto err; /* Y_r = n1 * (n2 - X_r) - n3 */ ret = 1; err: BN_CTX_end(ctx); BN_CTX_free(new_ctx); return ret; }
/*- * Differential addition-and-doubling using Eq. (9) and (10) from Izu-Takagi * "A fast parallel elliptic curve multiplication resistant against side channel * attacks", as described at * https://hyperelliptic.org/EFD/g1p/auto-shortw-xz.html#ladder-ladd-2002-it-4 */ int ec_GFp_simple_ladder_step(const EC_GROUP *group, EC_POINT *r, EC_POINT *s, EC_POINT *p, BN_CTX *ctx) { int ret = 0; BIGNUM *t0, *t1, *t2, *t3, *t4, *t5, *t6, *t7 = NULL; BN_CTX_start(ctx); t0 = BN_CTX_get(ctx); t1 = BN_CTX_get(ctx); t2 = BN_CTX_get(ctx); t3 = BN_CTX_get(ctx); t4 = BN_CTX_get(ctx); t5 = BN_CTX_get(ctx); t6 = BN_CTX_get(ctx); t7 = BN_CTX_get(ctx); if (t7 == NULL || !group->meth->field_mul(group, t0, r->X, s->X, ctx) || !group->meth->field_mul(group, t1, r->Z, s->Z, ctx) || !group->meth->field_mul(group, t2, r->X, s->Z, ctx) || !group->meth->field_mul(group, t3, r->Z, s->X, ctx) || !group->meth->field_mul(group, t4, group->a, t1, ctx) || !BN_mod_add_quick(t0, t0, t4, group->field) || !BN_mod_add_quick(t4, t3, t2, group->field) || !group->meth->field_mul(group, t0, t4, t0, ctx) || !group->meth->field_sqr(group, t1, t1, ctx) || !BN_mod_lshift_quick(t7, group->b, 2, group->field) || !group->meth->field_mul(group, t1, t7, t1, ctx) || !BN_mod_lshift1_quick(t0, t0, group->field) || !BN_mod_add_quick(t0, t1, t0, group->field) || !BN_mod_sub_quick(t1, t2, t3, group->field) || !group->meth->field_sqr(group, t1, t1, ctx) || !group->meth->field_mul(group, t3, t1, p->X, ctx) || !group->meth->field_mul(group, t0, p->Z, t0, ctx) /* s->X coord output */ || !BN_mod_sub_quick(s->X, t0, t3, group->field) /* s->Z coord output */ || !group->meth->field_mul(group, s->Z, p->Z, t1, ctx) || !group->meth->field_sqr(group, t3, r->X, ctx) || !group->meth->field_sqr(group, t2, r->Z, ctx) || !group->meth->field_mul(group, t4, t2, group->a, ctx) || !BN_mod_add_quick(t5, r->X, r->Z, group->field) || !group->meth->field_sqr(group, t5, t5, ctx) || !BN_mod_sub_quick(t5, t5, t3, group->field) || !BN_mod_sub_quick(t5, t5, t2, group->field) || !BN_mod_sub_quick(t6, t3, t4, group->field) || !group->meth->field_sqr(group, t6, t6, ctx) || !group->meth->field_mul(group, t0, t2, t5, ctx) || !group->meth->field_mul(group, t0, t7, t0, ctx) /* r->X coord output */ || !BN_mod_sub_quick(r->X, t6, t0, group->field) || !BN_mod_add_quick(t6, t3, t4, group->field) || !group->meth->field_sqr(group, t3, t2, ctx) || !group->meth->field_mul(group, t7, t3, t7, ctx) || !group->meth->field_mul(group, t5, t5, t6, ctx) || !BN_mod_lshift1_quick(t5, t5, group->field) /* r->Z coord output */ || !BN_mod_add_quick(r->Z, t7, t5, group->field)) goto err; ret = 1; err: BN_CTX_end(ctx); return ret; }
int ec_GFp_simple_dbl(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a, BN_CTX *ctx) { int (*field_mul)(const EC_GROUP *, BIGNUM *, const BIGNUM *, const BIGNUM *, BN_CTX *); int (*field_sqr)(const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *); const BIGNUM *p; BN_CTX *new_ctx = NULL; BIGNUM *n0, *n1, *n2, *n3; int ret = 0; if (EC_POINT_is_at_infinity(group, a)) { BN_zero(&r->Z); return 1; } field_mul = group->meth->field_mul; field_sqr = group->meth->field_sqr; p = &group->field; if (ctx == NULL) { ctx = new_ctx = BN_CTX_new(); if (ctx == NULL) { return 0; } } BN_CTX_start(ctx); n0 = BN_CTX_get(ctx); n1 = BN_CTX_get(ctx); n2 = BN_CTX_get(ctx); n3 = BN_CTX_get(ctx); if (n3 == NULL) { goto err; } /* Note that in this function we must not read components of 'a' * once we have written the corresponding components of 'r'. * ('r' might the same as 'a'.) */ /* n1 */ if (BN_cmp(&a->Z, &group->one) == 0) { if (!field_sqr(group, n0, &a->X, ctx) || !BN_mod_lshift1_quick(n1, n0, p) || !BN_mod_add_quick(n0, n0, n1, p) || !BN_mod_add_quick(n1, n0, &group->a, p)) { goto err; } /* n1 = 3 * X_a^2 + a_curve */ } else { /* ring: This assumes a == -3. */ if (!field_sqr(group, n1, &a->Z, ctx) || !BN_mod_add_quick(n0, &a->X, n1, p) || !BN_mod_sub_quick(n2, &a->X, n1, p) || !field_mul(group, n1, n0, n2, ctx) || !BN_mod_lshift1_quick(n0, n1, p) || !BN_mod_add_quick(n1, n0, n1, p)) { goto err; } /* n1 = 3 * (X_a + Z_a^2) * (X_a - Z_a^2) * = 3 * X_a^2 - 3 * Z_a^4 */ } /* Z_r */ if (BN_cmp(&a->Z, &group->one) == 0) { if (!BN_copy(n0, &a->Y)) { goto err; } } else if (!field_mul(group, n0, &a->Y, &a->Z, ctx)) { goto err; } if (!BN_mod_lshift1_quick(&r->Z, n0, p)) { goto err; } /* Z_r = 2 * Y_a * Z_a */ /* n2 */ if (!field_sqr(group, n3, &a->Y, ctx) || !field_mul(group, n2, &a->X, n3, ctx) || !BN_mod_lshift_quick(n2, n2, 2, p)) { goto err; } /* n2 = 4 * X_a * Y_a^2 */ /* X_r */ if (!BN_mod_lshift1_quick(n0, n2, p) || !field_sqr(group, &r->X, n1, ctx) || !BN_mod_sub_quick(&r->X, &r->X, n0, p)) { goto err; } /* X_r = n1^2 - 2 * n2 */ /* n3 */ if (!field_sqr(group, n0, n3, ctx) || !BN_mod_lshift_quick(n3, n0, 3, p)) { goto err; } /* n3 = 8 * Y_a^4 */ /* Y_r */ if (!BN_mod_sub_quick(n0, n2, &r->X, p) || !field_mul(group, n0, n1, n0, ctx) || !BN_mod_sub_quick(&r->Y, n0, n3, p)) { goto err; } /* Y_r = n1 * (n2 - X_r) - n3 */ ret = 1; err: BN_CTX_end(ctx); BN_CTX_free(new_ctx); return ret; }