A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We present a new "cover and decomposition" attack on the elliptic curve discrete logarithm problem, that combines Weil descent and decomposition-based index calculus into a single discrete logarithm algorithm. This attack applies, at least theoretically, to all composite degree extension fields, and is particularly well-suited for curves defined over F p 6 . We give a real-size example of discrete logarithm computations on a curve over a 151-bit degree 6 extension field, which would not havedoi:10.1007/978-3-642-29011-4_3 fatcat:23ppmsbcyrgf7atw55jgrbgztq