CryptoDB

Paper: Point Compression on Jacobians of Hyperelliptic Curves over $\F_q$

Authors: Colin Stahlke URL: http://eprint.iacr.org/2004/030 Search ePrint Search Google Hyperelliptic curve cryptography recently received a lot of attention, especially for constrained environments. Since there space is critical, compression techniques are interesting. In this note we propose a new method which avoids factoring the first representing polynomial. In the case of genus two the cost for decompression is, essentially, computing two square roots in $\F_q$, the cost for compression is much less.
BibTeX
@misc{eprint-2004-12006,
title={Point Compression on Jacobians of Hyperelliptic Curves over $\F_q$},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / point compression, hyperelliptic curve cryptosystem (HCC)},
url={http://eprint.iacr.org/2004/030},
note={ stahlke@edizone.de 12453 received 5 Feb 2004},
author={Colin Stahlke},
year=2004
}