how to avoid error " OverflowError: Python int too large to convert to C long
i have implemented algorithm for point addition and doubling of elliptic curve arithmetic based on single variable. now i am working on NIST prime curve. p-192
p=6277101735386680763835789423207666416083908700390324961279 k. = FiniteField (p^2) ; k R.<z> = PolynomialRing( K, sparse=True )
computed x and y from algorithm
x= (2092367245128893587945263141069222138694636233463441653760a + 4184734490257787175890526282138444277389272466926883307520)z^6277101735386680763835789423207666416083908700390324961279 + (4184734490257787175890526282138444277389272466926883307519a + 2092367245128893587945263141069222138694636233463441653760)z
y= (4184734490257787175890526282138444277389272466926883307520a + 2092367245128893587945263141069222138694636233463441653760)z^6277101735386680763835789423207666416083908700390324961279 + (2092367245128893587945263141069222138694636233463441653759a + 4184734490257787175890526282138444277389272466926883307519)z
i want to compute line equation of elliptic curve using above x and y in terms of z. the equation is
fL=(((Q[0]-P[0])y)-((Q[1]-P[1])x)-(P[1]Q[0]-Q[1]P[0])) where P and Q are point on the elliptic curve .
the sagemath is unable to compute fL it gives me error overflow error Python int too large to convert to C long how to reduce this error.
Please use that button with
to mark code. As above! Else all we get is a mess.
Again, i have no chance to understand the question.
z, which is an element of a polynomial ring. This ring has infinitely many elements. So the points do not live over a finite field.