Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms

Young Ho Park, Sangtae Jeong, Jong In Lim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Citations (Scopus)

Abstract

As Koblitz curves were generalized to hyperelliptic Koblitz curves for faster point multiplication by Gü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).

Original languageEnglish
Title of host publicationAdvances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings
PublisherSpringer Verlag
Pages197-208
Number of pages12
Volume2332
ISBN (Print)9783540435532
Publication statusPublished - 2002
EventInternational Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2002 - Amsterdam, Netherlands
Duration: 2002 Apr 282002 May 2

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2332
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2002
CountryNetherlands
CityAmsterdam
Period02/4/2802/5/2

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms'. Together they form a unique fingerprint.

  • Cite this

    Park, Y. H., Jeong, S., & Lim, J. I. (2002). Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms. In Advances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings (Vol. 2332, pp. 197-208). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2332). Springer Verlag.