Lecture Notes in Computer Science vol:2045 pages:1-13
EUROCRYPT 2001 date:May 06-10, 2001
In this paper we present an algorithm for counting points on elliptic curves over a finite field F(p)n of small characteristic, based on Satoh's algorithm. The memory requirement of our algorithm is O(n(2)), where Satoh's original algorithm needs O(n(3)) memory. Furthermore, our version has the same run time complexity of O(n(3+epsilon)) bit operations, but is faster by a constant factor. We give a detailed description of the algorithm in characteristic 2 and show that the amount of memory needed for the generation of a secure 200-bit elliptic curve is within the range of current smart card technology.