Schoof's algorithm: Difference between revisions

Revision as of 11:57, 4 February 2009

Revision as of 20:58, 4 February 2009

Line 1:

{{Underconstruction}}

'''Schoof's Algorithm''' is an important tool of [[Elliptic Curve Cryptography]] that provides us with an efficient way of counting points on [[elliptic curves]]. Published as a paper by René Schoof in 1985, the algorithm was a theoretical break through, as it was the first deterministic polynomial time algorithm.

Before Schoof's algorithm, approaches to [[counting points on elliptic curves]] such as the Naive and [[Baby-step giant-step]] algorithms were, for the most part, tedious and had an exponential running time.