Author(s)： Tsunekazu Saito, Shun'ichi Yokoyama, Tetsutaro Kobayashi and Go Yamamoto

J. Math-for-Ind. 3A (2011) 89-92.

• File： JMI2011A-9.pdf (119KB)

Abstract
There are two decision methods for the decomposition of multiple points on an elliptic curve, one based on Semaev's summation polynomials and the other based on Stange's elliptic nets. This paper presents some relations between these two methods. Using these relations, we show that an index calculus attack for the elliptic curve discrete logarithm problem (ECDLP) over extension fields via an elliptic net is equivalent to such an attack via Semaev's summation polynomials.

Keyword(s).　 Index calculus attack, Semaev's summation polynomials, elliptic nets