Schoof's algorithm: Difference between revisions

Content deleted Content added
Blugan (talk | contribs)
Blugan (talk | contribs)
Line 40:
The Frobenius endomorphism satisfies a quadratic polynomial which is linked to the cardinality of <math>E(\mathbb{F}_{q})</math> by the following theorem:
'''Theorem:''' The Frobenius endomorphism given by <math>\phi</math> satisfies the characteristic equation
<math> \phi ^{2} - t\phi + q = 0 </math> where <math> t = q + 1 - \sharp E(\mathbb{F}_{q}) </math>
Line 52:
 
<math> (x^{q^{2}}, y^{q^{2}}) + \bar{q}(x, y) \equiv \bar{t}(x^{q}, y^{q}) \pmod l </math>
 
 
 
==Computation modulo primes==