Lines Matching full:coordinates

601  * Points in affine and Jacobian coordinates.
603  *  - In affine coordinates, the point-at-infinity cannot be encoded.
604  *  - Jacobian coordinates (X,Y,Z) correspond to affine (X/Z^2,Y/Z^3);
657  * Decode a point. The returned point is in Jacobian coordinates, but
676 	 * Decode X and Y coordinates, and convert them into  in point_decode()
703 	 * Return the point in Jacobian coordinates (and Montgomery  in point_decode()
714  *  - The point is converted back to affine coordinates.
732 	/* Compute affine coordinates x (in t1) and y (in t2). */  in point_encode()
754  * Point doubling in Jacobian coordinates: point P is doubled.
757  * coordinates were zero, then they still are zero in the returned value.
831  * Point addition (Jacobian coordinates): P1 is replaced with P1+P2.
861  * e.g. if P1 and P2 have the same Y coordinate, but distinct X coordinates.
943  * Point addition (mixed coordinates): P1 is replaced with P1+P2.
945  * in affine coordinates.
1054  * Point addition (mixed coordinates, complete): P1 is replaced with P1+P2.
1056  * in affine coordinates.
1106 	 * coordinates, we get a cost of 17 multiplications in total.
1219 	 * We now have the alternate (doubling) coordinates in (t5,t6,t1).
1243  * provided, with points 1*P to 15*P in affine coordinates.
1323  * Convert a window from Jacobian to affine coordinates. A single
1336 	 * Convert the window points to affine coordinates. We use the  in window_to_affine()
1464 	 * Compute window, in Jacobian coordinates.  in p256_mul()
1477 	 * Convert the window points to affine coordinates. Point  in p256_mul()
1478 	 * window[0] is the source point, already in affine coordinates.  in p256_mul()
1490  * contains (n+1)*G (affine coordinates, in Montgomery representation).
1688 	 *    Jacobian coordinates. Even p256_add_complete_mixed() would  in api_muladd()