Satoh’s algorithm in characteristic 2

Berit Skjernaa · Mathematics of Computation · 2002

We give an algorithm for counting points on arbitrary ordinary elliptic curves over finite fields of characteristic 2 2 , extending the O ( log 5 ⁡ q ) O(\log ^5q) method given by Takakazu Satoh, giving the asymptotically fastest point counting algorithm known to date.

Read the paper · More papers on PaperTik