Efficient implementation of Schoof's algorithm (Q4249255)

In order to produce elliptic curves suitable for use in cryptographic systems one needs to compute the number of points on various elliptic curves over a given finite field until one is found which is suitable. The number of points on an elliptic curve over a finite field is usually computed using Schoof's algorithm and its improvements due to various author such as Atkin, Elkies, Couveignes, Lercier and Morain. This paper gives a report on an implementation of this algorithm at Fujitsu's laboratories. Various strategies are described for deciding when to call certain subprocedures and corresponding CPU times are given. The authors appear to obtain an improvement of around twenty percent simply by using standard algorithms in a more intelligent way. For the entire collection see [Zbl 0898.00038].