Sciweavers

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

16

ANTS
2004
Springer

favoriteEmaildiscussreport

97views Algorithms» more ANTS 2004»

Elliptic Curves with a Given Number of Points

13 years 10 months ago

Elliptic Curves with a Given Number of Points

Download www.math.brown.edu

We present a non-archimedean method to construct, given an integer N ≥ 1, a ﬁnite ﬁeld Fq and an elliptic curve E/Fq such that E(Fq) has order N.

Reinier Bröker, Peter Stevenhagen

Real-time Traffic

Algorithms | ANTS 2004 | Elliptic Curve E/fq | Non-archimedean Method | ﬁnite ﬁeld Fq |

claim paper

Related Content

» Generating Arithmetically Equivalent Number Fields with Elliptic Curves

» Symmetric Key Image Encryption Scheme with Key Sequences Derived from Random Sequence of C...

» A Security Analysis of the NIST SP 80090 Elliptic Curve Random Number Generator

» Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map

» On the Performance of Hyperelliptic Cryptosystems

» Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryp...

» Inferring sequences produced by a linear congruential generator on elliptic curves missing...

» Easy Numbers for the Elliptic Curve Primality Proving Algorithm

» Choosing the correct elliptic curve in the CM method

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	ANTS
Authors	Reinier Bröker, Peter Stevenhagen

Comments (0)