Paper 2014/333 Original: eprint.iacr.org/2014/333 ↗
An optimal representation for the trace zero subgroup
Abstract
We give an optimal-size representation for the elements of the trace zero subgroup of the Picard group of an elliptic or hyperelliptic curve of any genus, with respect to a field extension of any prime degree. The representation is via the coefficients of a rational function, and it is compatible with scalar multiplication of points. We provide efficient compression and decompression algorithms, and complement them with implementation results. We discuss in detail the practically relevant cases of small genus and extension degree, and compare with the other known compression methods.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2016-06-15: last updated
- 2014-05-13: published
- Short URL
- https://ia.cr/2014/333
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/333,
author = {Elisa Gorla and Maike Massierer},
title = {An optimal representation for the trace zero subgroup},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/333},
year = {2014},
url = {https://eprint.iacr.org/2014/333}
}