You are looking at a specific version 20040205:222111 of this paper. See the latest version.

Paper 2004/030

Point Compression on Jacobians of Hyperelliptic Curves over $\F_q$.

Colin Stahlke

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 much less.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
point compressionhyperelliptic curve cryptosystem (HCC)
Contact author(s)
stahlke @ edizone de
History
2004-02-05: received
Short URL
https://ia.cr/2004/030
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.