Easy numbers for the Elliptic Curve Primality Proving Algorithm (1992)
Cached
Download Links
- [lix.polytechnique.fr]
- [www.informatik.uni-bonn.de]
- DBLP
Other Repositories/Bibliography
by
F. Morain
BibTeX
@MISC{Morain92easynumbers,
author = {F. Morain},
title = {Easy numbers for the Elliptic Curve Primality Proving Algorithm},
year = {1992}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the case for about half the numbers of the Cunningham project. Computational examples are given.
