Cryptology ePrint Archive: Report 2004/030
Point Compression on Jacobians of Hyperelliptic Curves over $\F_q$.
Abstract: 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
Category / Keywords: public-key cryptography / point compression, hyperelliptic curve cryptosystem (HCC)
Date: received 5 Feb 2004
Contact author: stahlke at edizone de
Available format(s): PDF | BibTeX Citation
Version: 20040205:222111 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]