Work

Some relations between Semaev's summation polynomials and Stange's elliptic nets

Year: 2011

Type: article

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.

Source: Kyushu University Institutional Repository (QIR) (Kyushu University)

Authors: Tsunekazu Saito, Shun’ichi Yokoyama, Tetsutaro Kobayashi, Go Yamamoto, 恆和齋藤, 俊一横山, 鉄太郎小林, 剛山本

Institutions: Kyushu University, NTT (Japan)

Language: English

Topic: Cryptography and Residue Arithmetic

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1540173861

FWCI:

Cites: 9

Cited by:

Related to: 20