A new polynomial factorization algorithm and its implementation
Journal of Symbolic Computation
Remarks on the Schoof-Elkies-Atkin algorithm
Mathematics of Computation
Modern computer algebra
Efficient computation of minimal polynomials in algebraic extensions of finite fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Elliptic curves in cryptography
Elliptic curves in cryptography
Weierstraß Elliptic Curves and Side-Channel Attacks
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Schoof's algorithm and isogeny cycles
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
The Schoof-Elkies-Atkin algorithm is the best known algorithm for counting the number of points of an elliptic curve defined over a finite field of large characteristic. Several practical and asymptotical improvements for the phase called eigenvalue computation are proposed.