Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ISSAC
1992
Springer

favoriteEmaildiscussreport

109views Mathematics» more ISSAC 1992»

Easy Numbers for the Elliptic Curve Primality Proving Algorithm

13 years 8 months ago

Easy Numbers for the Elliptic Curve Primality Proving Algorithm

Download www.lix.polytechnique.fr

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.

François Morain

Real-time Traffic

Average Numbers | Elliptic Curve Primality Proving | ISSAC 1992 | Mathematics | Primality |

claim paper

Related Content

» Primality Proving Using Elliptic Curves An Update

» Primality Proving via One Round in ECPP and One Iteration in AKS

» Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem

» Visualizing Elements of Sha3 in Genus 2 Jacobians

» DoubleBase Number System for Multiscalar Multiplications

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1992
Where	ISSAC
Authors	François Morain

Comments (0)