## CryptoDB

### Colin Stahlke

#### Publications

Year
Venue
Title
2017
EUROCRYPT
2005
CHES
2004
EPRINT
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.

#### Coauthors

Claus Diem (1)
Jens Franke (1)
Thorsten Kleinjung (2)
Arjen K. Lenstra (1)
Christof Paar (1)
Jan Pelzl (1)
Christine Priplata (2)