Speeding up pairing computations on genus 2 hyperelliptic curves with efficiently computable automorphisms

TitleSpeeding up pairing computations on genus 2 hyperelliptic curves with efficiently computable automorphisms
Publication TypeConference Proceedings
Year of Conference2008
AuthorsFan, X.X., G. Gong, and D. Jao
Conference NamePairing-based Cryptography, Lecture Notes of Computer Sciences
Volume5209
EditionS.D. Galbraith, and K.G. Paterson (Eds.)
Pagination243-264
Conference LocationBerlin, Germany, Springer-Verlag