Skip to content

How secure are elliptic curves over composite extension fields?

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publicationAdvances in Cryptology - EUROCRYPT2001
EditorsB. Pfitzmann
Publisher or commissioning bodySpringer Berlin Heidelberg
Pages30 - 39
Number of pages9
Volume2045
DatePublished - May 2001

Abstract

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.

Additional information

Conference Proceedings/Title of Journal: EuroCrypt 2001

View research connections

Related faculties, schools or groups