Schoof's algorithm: Difference between revisions

Revision as of 14:21, 31 December 2017

Revision as of 18:32, 31 December 2017

Line 146:

{{nowrap|<math>t_{l}=0</math>}}

Use the [[Chinese Remainder Theorem]] to compute {{mvar|t}} modulo {{mvar|N}}

from the equations <math>xt \equiv t_{l} \pmod l</math>, where <math>l \in S</math>.

Output <math>q+1-t</math>.