Sciweavers

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

15

MOC
2010

favoriteEmaildiscussreport

106views Security Privacy» more MOC 2010»

Choosing the correct elliptic curve in the CM method

13 years 2 months ago

Choosing the correct elliptic curve in the CM method

Download math.uci.edu

We give an elementary way to distinguish between the twists of an ordinary elliptic curve E over Fp in order to identify the one with p+1-2U points, when p = U2 + dV 2 with 2U, 2V Z and E is constructed using the CM method for finding elliptic curves with a prescribed number of points. Our algorithms consist in most cases of reading off simple congruence conditions on U and V modulo 4.

Karl Rubin, Alice Silverberg

Real-time Traffic

Elliptic Curves | MOC 2010 | Ordinary Elliptic Curve | Security Privacy | Simple Congruence Conditions |

claim paper

Related Content

» Generating Elliptic Curves of Prime Order

» On the Efficient Generation of PrimeOrder Elliptic Curves

» On the Construction of Prime Order Elliptic Curves

» Ramanujans class invariants and their use in elliptic curve cryptography

» Computing the Ate Pairing on Elliptic Curves with Embedding Degree k 9

» Generating Prime Order Elliptic Curves Difficulties and Efficiency Considerations

» PairingFriendly Elliptic Curves of Prime Order

» A Buyers Guide to Euclidean Elliptical Cylindrical and Conical Surface Fitting

» Constructing Tower Extensions of Finite Fields for Implementation of PairingBased Cryptogr...

Post Info
More Details (n/a)

Added	20 May 2011
Updated	20 May 2011
Type	Journal
Year	2010
Where	MOC
Authors	Karl Rubin, Alice Silverberg

Comments (0)