Sciweavers

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

6

ASIACRYPT
2000
Springer

favoriteEmaildiscussreport

127views Cryptology» more ASIACRYPT 2000»

Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three

13 years 9 months ago

Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three

Download www.iacr.org

The paper shows that some of elliptic curves over ﬁnite ﬁelds of characteristic three of composite degree are attacked by a more eﬀective algorithm than Pollard’s ρ method. For such an elliptic curve E, we construct a Cab curve D on its Weil restriction in order to reduce the discrete logarithm problem on E to that on D. And we show that the genus of D is small enough so that D is attacked by a modiﬁed form of Gaudry’s variant for a suitable E. We also see such a weak elliptic curve is easily constructed.

Seigo Arita

Real-time Traffic

ASIACRYPT 2000 | Cryptology | Elliptic Curve | Elliptic Curve E | Weak Elliptic Curve |

claim paper

Related Content

» Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields...

» A Weil Descent Attack against Elliptic Curve Cryptosystems over Quartic Extension Fields

» How Secure Are Elliptic Curves over Composite Extension Fields

» The GHS Attack Revisited

» Faster Scalar Multiplication on Ordinary Weierstrass Elliptic Curves over Fields of Charac...

» Function Field Sieve in Characteristic Three

» Isomorphism Classes of Picard Curves over Finite Fields

» Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

» On the Hardware Design of an Elliptic Curve Cryptosystem

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	ASIACRYPT
Authors	Seigo Arita

Comments (0)