Point compression for the trace zero subgroup over a small degree extension field
Algebraic Geometry
2014-03-04 v1 Cryptography and Security
Abstract
Using Semaev's summation polynomials, we derive a new equation for the -rational points of the trace zero variety of an elliptic curve defined over . 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.
Cite
@article{arxiv.1403.0126,
title = {Point compression for the trace zero subgroup over a small degree extension field},
author = {Elisa Gorla and Maike Massierer},
journal= {arXiv preprint arXiv:1403.0126},
year = {2014}
}
Comments
23 pages, to appear in Designs, Codes and Cryptography