@inproceedings{57d5b5d9cfc14be798059aa4a8eb3197,
title = "Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms",
abstract = "As Koblitz curves were generalized to hyperelliptic Koblitz curves for faster point multiplication by G{\"u}unter, et al. [10] we extend the recent work of Gallant, et al. [8] to hyperelliptic curves. So the extended method for speeding point multiplication applies to a much larger family of hyperelliptic curves over finite fields that have efficiently-computable endomorphisms. For this special family of curves, a speedup of up to 55 (59) \% can be achieved over the best general methods for a 160-bit point multiplication in case of genus g =2 (3).",
author = "Park, \{Young Ho\} and Sangtae Jeong and Lim, \{Jong In\}",
year = "2002",
language = "English",
isbn = "9783540435532",
volume = "2332",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "197--208",
booktitle = "Advances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings",
note = "International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2002 ; Conference date: 28-04-2002 Through 02-05-2002",
}