Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Schoof–Elkies–Atkin algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In elliptic curve cryptography, cryptosystems are based on an additive subgroup of an elliptic curve defined over a finite field… Expand
Highly Cited
2010
Highly Cited
2010
A hydrologically coupled flowband model of ‘higher order’ ice dynamics is used to explore perturbations in response to… Expand
2008
Highly Cited
2008
Highly Cited
2008
Like its bestselling predecessor, Elliptic Curves: Number Theory and Cryptography, Second Edition develops the theory of elliptic… Expand
2007
2007
The Schoof-Elkies-Atkin algorithm is the best known method for counting the number of points of an elliptic curve defined over a… Expand
2006
2006
The Schoof-Elkies-Atkin algorithm is the best known algorithm for counting the number of points of an elliptic curve defined over… Expand
Highly Cited
2000
Highly Cited
2000
We describe some algorithms for computing the cardinality of hyperelliptic curves and their Jacobians over finite fields. They… Expand
1998
1998
Schoof's algorithm computes the number m of points on an elliptic curve E defined over a finite field F q . Schoof determines m… Expand
1996
1996
The heart of Schoof's algorithm for computing the cardinality m of an elliptic curve over a nite eld is the computation of m… Expand