Efficient implementation of Schoof's algorithm
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].
- Isogenies on twisted Hessian curves
- scientific article; zbMATH DE number 1808208 (Why is no real title available?)
- Schoof's point counting algorithm
- scientific article; zbMATH DE number 1860726 (Why is no real title available?)
- scientific article; zbMATH DE number 6169004 (Why is no real title available?)
- Efficient implementation of Schoof's algorithm in case of characteristic 2
- Efficiency of linked cell algorithms
- Algebraic curves and cryptography
- New types of formula for isogenies between elliptic curves
This page was built for publication: Efficient implementation of Schoof's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249255)
