Point Compression on Jacobians of Hyperelliptic Curves over Fq

Hyperelliptic curve cryptography recently received a lot of atten- tion, 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 rst representing polynomial. In the case of genus two the cost for decompression