Welcome to the resource topic for 2004/030
Point Compression on Jacobians of Hyperelliptic Curves over \F_q.
Authors: Colin StahlkeAbstract:
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
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .