Lines Matching defs:point
33 * A 64-bit implementation of the NIST P-521 elliptic curve point multiplication
1200 * adapted for mixed addition (z2 = 1, or z2 = 0 for the point at infinity).
1203 * are equal (while not equal to the point at infinity). See comment below
1307 * The special case of either point being the point at infinity (z1 and/or
1323 * negative multiple of the base point, and for the final signed digit
1396 * Base point pre computation
1400 * Each contain various points on the curve, where each point is three field
1403 * For the base point table, z is usually 1 (0 for the point at infinity).
1405 * index | bits | point
1425 * locations when doing simple scalar multiplies against the base point.
1542 * select_point selects the |idx|th point from a precomputation table and
1576 * Interleaved point multiplication using precomputed point multiples: The
1577 * small point multiples 0*P, 1*P, ..., 16*P are in pre_comp[], the scalars
1580 * Output point (X, Y, Z) is stored in x_out, y_out, z_out
1594 /* set nq to the point at infinity */
1602 skip = 1; /* save two point operations in the first
1617 /* select the point to add, in constant time */
1642 * select the point to add or subtract, in constant time
1646 * point */
1838 * Takes the Jacobian coordinates (X, Y, Z) of a point and returns (X', Y') =
1842 const EC_POINT *point,
1849 if (EC_POINT_is_at_infinity(group, point)) {
1853 if ((!BN_to_felem(x_in, point->X)) || (!BN_to_felem(y_in, point->Y)) ||
1854 (!BN_to_felem(z1, point->Z)))
1887 * Runs in constant time, unless an input is the point at infinity (which
1976 * random point
1984 * unless we precompute multiples for just one point, converting
2013 /* the i^th point */
2182 /* g_pre_comp[0] is the point at infinity */