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

Fingerprint

Hyperelliptic Curves
Endomorphisms
Multiplication
Curve
Galois field
Genus
Speedup
Family

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

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.

Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms. / Park, Young Ho; Jeong, Sangtae; Lim, Jong In.

Advances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings. Vol. 2332 Springer Verlag, 2002. p. 197-208 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2332).

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

Park, YH, Jeong, S & Lim, JI 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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2332, Springer Verlag, pp. 197-208, International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2002, Amsterdam, Netherlands, 02/4/28.
Park YH, Jeong S, Lim JI. 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. Springer Verlag. 2002. p. 197-208. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Park, Young Ho ; Jeong, Sangtae ; Lim, Jong In. / Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms. Advances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings. Vol. 2332 Springer Verlag, 2002. pp. 197-208 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",

}

TY - GEN

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

AU - Park, Young Ho

AU - Jeong, Sangtae

AU - Lim, Jong In

PY - 2002

Y1 - 2002

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=84947275198&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947275198&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84947275198

SN - 9783540435532

VL - 2332

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 197

EP - 208

BT - Advances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings

PB - Springer Verlag

ER -