Computing the number of points on an elliptic curve over a finite field: algorithmic aspects (Q1909876): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:26, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the number of points on an elliptic curve over a finite field: algorithmic aspects |
scientific article |
Statements
Computing the number of points on an elliptic curve over a finite field: algorithmic aspects (English)
0 references
24 March 1996
0 references
The author describes in some detail his implementation of Schoof's algorithm to compute the number of rational points on an elliptic curve over a prime field. His algorithm depends on the practical improvements of Atkin and Elkies. The author explains how to compute convenient equations of certain modular curves and how to find factors of the division polynomials. He illustrates his efficient program by computing the number of points on an elliptic curve modulo the 500 digit prime \(p= 10^{499}+ 153\).
0 references
factors of division polynomials
0 references
Schoof's algorithm
0 references
number of rational points
0 references
elliptic curve
0 references
prime field
0 references
modular curves
0 references
