Lines Matching full:coordinates

643  * Points in affine and Jacobian coordinates.
645  *  - In affine coordinates, the point-at-infinity cannot be encoded.
646  *  - Jacobian coordinates (X,Y,Z) correspond to affine (X/Z^2,Y/Z^3);
661  * Decode a point. The returned point is in Jacobian coordinates, but
680 	 * Decode X and Y coordinates, and convert them into  in point_decode()
713 	 * Return the point in Jacobian coordinates (and Montgomery  in point_decode()
724  *  - The point is converted back to affine coordinates.
742 	/* Compute affine coordinates x (in t1) and y (in t2). */  in point_encode()
770  * Point doubling in Jacobian coordinates: point P is doubled.
773  * coordinates were zero, then they still are zero in the returned value.
776  * coordinates are encoded as four words of value zero each, then the
851  * Point addition (Jacobian coordinates): P1 is replaced with P1+P2.
881  * e.g. if P1 and P2 have the same Y coordinate, but distinct X coordinates.
963  * Point addition (mixed coordinates): P1 is replaced with P1+P2.
965  * in affine coordinates.
1074  * Point addition (mixed coordinates, complete): P1 is replaced with P1+P2.
1076  * in affine coordinates.
1126 	 * coordinates, we get a cost of 17 multiplications in total.
1237 	 * We now have the alternate (doubling) coordinates in (t5,t6,t1).
1261  * provided, with points 1*P to 15*P in affine coordinates.
1339  * Convert a window from Jacobian to affine coordinates. A single
1352 	 * Convert the window points to affine coordinates. We use the  in window_to_affine()
1480 	 * Compute window, in Jacobian coordinates.  in p256_mul()
1493 	 * Convert the window points to affine coordinates. Point  in p256_mul()
1494 	 * window[0] is the source point, already in affine coordinates.  in p256_mul()
1506  * contains (n+1)*G (affine coordinates, in Montgomery representation).
1704 	 *    Jacobian coordinates. Even p256_add_complete_mixed() would  in api_muladd()