Lines Matching defs:point
33 * A 64-bit implementation of the NIST P-256 elliptic curve point multiplication
1228 * adapted for mixed addition (z2 = 1, or z2 = 0 for the point at infinity).
1231 * are equal, (while not equal to the point at infinity). This case never
1232 * happens during single point multiplication, so there is no timing leak for
1352 * The special case of either point being the point at infinity (z1 and/or
1361 * case never happens during single point multiplication, so there is no
1437 * Base point pre computation
1441 * Each contain various points on the curve, where each point is three field
1444 * For the base point table, z is usually 1 (0 for the point at infinity).
1446 * index | bits | point
1467 * locations when doing simple scalar multiplies against the base point,
1633 * select_point selects the |idx|th point from a precomputation table and
1666 * Interleaved point multiplication using precomputed point multiples: The
1667 * small point multiples 0*P, 1*P, ..., 17*P are in pre_comp[], the scalars
1670 * Output point (X, Y, Z) is stored in x_out, y_out, z_out
1685 /* set nq to the point at infinity */
1693 skip = 1; /* save two point operations in the first
1707 /* select the point to add, in constant time */
1726 /* select the point to add, in constant time */
1746 * select the point to add or subtract, in constant time
1750 * point */
1945 * Takes the Jacobian coordinates (X, Y, Z) of a point and returns (X', Y') =
1949 const EC_POINT *point,
1957 if (EC_POINT_is_at_infinity(group, point)) {
1961 if ((!BN_to_felem(x_in, point->X)) || (!BN_to_felem(y_in, point->Y)) ||
1962 (!BN_to_felem(z1, point->Z)))
1995 * Runs in constant time, unless an input is the point at infinity (which
2084 * random point
2122 /* the i^th point */
2316 /* g_pre_comp[i][0] is the point at infinity */