Lines Matching defs:point
33 * A 64-bit implementation of the NIST P-224 elliptic curve point multiplication
85 * scalars for point multiplication.
110 * (0 for the point at infinity).
114 * index | bits | point
135 * locations when doing simple scalar multiplies against the base point,
362 * NB! These operations are specific to our point multiplication and cannot be
804 * (X, Y, Z) corresponds to the affine point (X/Z^2, Y/Z^3),
805 * or to the point at infinity if Z == 0.
810 * Double an elliptic curve point:
904 * point at infinity). This case never happens during single point
982 * The special case of either point being the point at infinity (z1 and/or
1004 * case never happens during single point multiplication, so there is no
1082 * the point at infinity, so we need to check for this separately
1086 * if point 1 is at infinity, copy point 2 to output, and vice versa
1100 * select_point selects the |idx|th point from a precomputation table and
1133 * Interleaved point multiplication using precomputed point multiples: The
1134 * small point multiples 0*P, 1*P, ..., 16*P are in pre_comp[], the scalars
1137 * Output point (X, Y, Z) is stored in x_out, y_out, z_out
1152 /* set nq to the point at infinity */
1160 skip = 1; /* save two point operations in the first
1174 /* select the point to add, in constant time */
1191 /* select the point to add, in constant time */
1210 /* select the point to add or subtract */
1213 * point */
1334 * Takes the Jacobian coordinates (X, Y, Z) of a point and returns (X', Y') =
1338 const EC_POINT *point,
1345 if (EC_POINT_is_at_infinity(group, point)) {
1349 if ((!BN_to_felem(x_in, point->X)) || (!BN_to_felem(y_in, point->Y)) ||
1350 (!BN_to_felem(z1, point->Z)))
1382 * Runs in constant time, unless an input is the point at infinity (which
1471 * random point
1505 /* the i^th point */
1688 /* g_pre_comp[i][0] is the point at infinity */