How secure are elliptic curves over composite extension fields?

NP Smart

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

22 Citations (Scopus)


We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard rho. We give details of a theoretical and practical comparison and then use this to analyse the difficulty of actually solving the ECDLP for curves of the size needed in practical cryptographic systems. We show that composite degree extensions of degree divisible by four should be avoided. We also examine the elliptic curves proposed in the Oakley key determination protocol and show that with current technology they remain secure.
Translated title of the contributionHow secure are elliptic curves over composite extension fields?
Original languageEnglish
Title of host publicationAdvances in Cryptology - EUROCRYPT2001
EditorsB. Pfitzmann
PublisherSpringer Berlin Heidelberg
Pages30 - 39
Number of pages9
Publication statusPublished - May 2001

Bibliographical note

Conference Proceedings/Title of Journal: EuroCrypt 2001


Dive into the research topics of 'How secure are elliptic curves over composite extension fields?'. Together they form a unique fingerprint.

Cite this