Point compression for the trace zero subgroup over a small degree extension field - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Designs, Codes and Cryptography Year : 2015

Point compression for the trace zero subgroup over a small degree extension field

Abstract

Using Semaev's summation polynomials, we derive a new equation for the F_q-rational points of the trace zero variety of an elliptic curve defined over F_q. Using this equation, we produce an optimal-size representation for such points. Our representation is compatible with scalar multiplication. We give a point compression algorithm to compute the representation and a decompression algorithm to recover the original point (up to some small ambiguity). The algorithms are efficient for trace zero varieties coming from small degree extension fields. We give explicit equations and discuss in detail the practically relevant cases of cubic and quintic field extensions.
Fichier principal
Vignette du fichier
paper.pdf (446.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01097434 , version 1 (06-01-2015)

Identifiers

Cite

Elisa Gorla, Maike Massierer. Point compression for the trace zero subgroup over a small degree extension field. Designs, Codes and Cryptography, 2015, 75 (2), pp.335--357. ⟨10.1007/s10623-014-9921-0⟩. ⟨hal-01097434⟩

Collections

INSMI
73 View
101 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More