Sciweavers

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

13

ASIACRYPT
2005
Springer

favoriteEmaildiscussreport

100views Cryptology» more ASIACRYPT 2005»

Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?

13 years 10 months ago

Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?

Download www.iacr.org

David Jao, Stephen D. Miller, Ramarathnam Venkates

Real-time Traffic

ASIACRYPT 2005 | Cryptology |

claim paper

Related Content

» Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves

» On the Performance of Hyperelliptic Cryptosystems

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	ASIACRYPT
Authors	David Jao, Stephen D. Miller, Ramarathnam Venkatesan

Comments (0)