Lines Matching full:infinity

131  * -- for the point at infinity, z = 0
204  * If y = 0 (P has order 2) then this yields infinity (z' = 0), as it
208  * If P is infinity (z = 0), then again the formulas yield infinity,
282  * If both P1 and P2 are infinity, then z1 == 0 and z2 == 0, implying that
284  * If either of P1 or P2 is infinity, but not both, then z3 == 0, which is
287  * -- if s1 == s2 then P1 and/or P2 is infinity, or P1 == P2
288  * -- if s1 != s2 then P1 + P2 == infinity (but neither P1 or P2 is infinity)
301  * -- Both points are infinity.
302  * -- One point is infinity and the other is on line Y = 0.
305  * source points are non-infinity, then remains only the case where the
310  * -- If the returned value is not the point at infinity, then it was properly
313  * is indeed the point at infinity.
314  * -- Otherwise (result is infinity, flag is 0), then P1 = P2 and we should
564 	 * operands is infinity, which is the case at the start of the  in point_mul()
605  * the point at infinity. If the point is invalid then this returns 0, but
664  * not the point at infinity. Encoded size is always 1+2*plen, where
791 	 * from infinity, and the multipliers are non-zero and lower than the  in api_muladd()
792 	 * curve order, then we know that P and Q are non-infinity. This  in api_muladd()