An alternate decomposition of an integer for faster point multiplication on certain elliptic curves

Young Ho Park; Sangtae Jeong; Chang Han Kim; Jongin Lim

doi:10.1007/3-540-45664-3_23

An alternate decomposition of an integer for faster point multiplication on certain elliptic curves

Young Ho Park
, Sangtae Jeong
, Chang Han Kim
, Jongin Lim

School of Cybersecurity

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

33 Citations (Scopus)

Abstract

In this paper the Gallant-Lambert-Vanstone method is re-examined for speeding up scalar multiplication. Using the theory of μ-Euclidian algorithm, we provide a rigorous method to reduce the theoretical bound for the decomposition of an integer k in the endomorphism ring of an elliptic curve. We then compare the two different methods for decomposition through computational implementations.

Original language	English
Title of host publication	Public-Key Cryptography - PKC 2002 - 5th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings
Editors	David Naccache, Pascal Paillier
Publisher	Springer Verlag
Pages	323-334
Number of pages	12
ISBN (Print)	3540431683, 9783540431688
DOIs	https://doi.org/10.1007/3-540-45664-3_23
Publication status	Published - 2002
Event	5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002 - Paris, France Duration: 2002 Feb 12 → 2002 Feb 14

Publication series

Name	Lecture Notes in Computer Science
Volume	2274
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002
Country/Territory	France
City	Paris
Period	02/2/12 → 02/2/14

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45664-3_23

Cite this

Park, Y. H., Jeong, S., Kim, C. H., & Lim, J. (2002). An alternate decomposition of an integer for faster point multiplication on certain elliptic curves. In D. Naccache, & P. Paillier (Eds.), Public-Key Cryptography - PKC 2002 - 5th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (pp. 323-334). (Lecture Notes in Computer Science; Vol. 2274). Springer Verlag. https://doi.org/10.1007/3-540-45664-3_23

An alternate decomposition of an integer for faster point multiplication on certain elliptic curves. / Park, Young Ho; Jeong, Sangtae; Kim, Chang Han et al.
Public-Key Cryptography - PKC 2002 - 5th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. ed. / David Naccache; Pascal Paillier. Springer Verlag, 2002. p. 323-334 (Lecture Notes in Computer Science; Vol. 2274).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Park, YH, Jeong, S, Kim, CH & Lim, J 2002, An alternate decomposition of an integer for faster point multiplication on certain elliptic curves. in D Naccache & P Paillier (eds), Public-Key Cryptography - PKC 2002 - 5th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. Lecture Notes in Computer Science, vol. 2274, Springer Verlag, pp. 323-334, 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002, Paris, France, 02/2/12. https://doi.org/10.1007/3-540-45664-3_23

Park YH, Jeong S, Kim CH, Lim J. An alternate decomposition of an integer for faster point multiplication on certain elliptic curves. In Naccache D, Paillier P, editors, Public-Key Cryptography - PKC 2002 - 5th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. Springer Verlag. 2002. p. 323-334. (Lecture Notes in Computer Science). doi: 10.1007/3-540-45664-3_23

Park, Young Ho ; Jeong, Sangtae ; Kim, Chang Han et al. / An alternate decomposition of an integer for faster point multiplication on certain elliptic curves. Public-Key Cryptography - PKC 2002 - 5th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. editor / David Naccache ; Pascal Paillier. Springer Verlag, 2002. pp. 323-334 (Lecture Notes in Computer Science).

@inproceedings{29466d2cfcee4eedb12d492fece3d289,

title = "An alternate decomposition of an integer for faster point multiplication on certain elliptic curves",

abstract = "In this paper the Gallant-Lambert-Vanstone method is re-examined for speeding up scalar multiplication. Using the theory of μ-Euclidian algorithm, we provide a rigorous method to reduce the theoretical bound for the decomposition of an integer k in the endomorphism ring of an elliptic curve. We then compare the two different methods for decomposition through computational implementations.",

author = "Park, \{Young Ho\} and Sangtae Jeong and Kim, \{Chang Han\} and Jongin Lim",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002 ; Conference date: 12-02-2002 Through 14-02-2002",

year = "2002",

doi = "10.1007/3-540-45664-3\_23",

language = "English",

isbn = "3540431683",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "323--334",

editor = "David Naccache and Pascal Paillier",

booktitle = "Public-Key Cryptography - PKC 2002 - 5th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings",

}

TY - GEN

T1 - An alternate decomposition of an integer for faster point multiplication on certain elliptic curves

AU - Park, Young Ho

AU - Jeong, Sangtae

AU - Kim, Chang Han

AU - Lim, Jongin

PY - 2002

Y1 - 2002

N2 - In this paper the Gallant-Lambert-Vanstone method is re-examined for speeding up scalar multiplication. Using the theory of μ-Euclidian algorithm, we provide a rigorous method to reduce the theoretical bound for the decomposition of an integer k in the endomorphism ring of an elliptic curve. We then compare the two different methods for decomposition through computational implementations.

AB - In this paper the Gallant-Lambert-Vanstone method is re-examined for speeding up scalar multiplication. Using the theory of μ-Euclidian algorithm, we provide a rigorous method to reduce the theoretical bound for the decomposition of an integer k in the endomorphism ring of an elliptic curve. We then compare the two different methods for decomposition through computational implementations.

UR - https://www.scopus.com/pages/publications/84958961275

U2 - 10.1007/3-540-45664-3_23

DO - 10.1007/3-540-45664-3_23

M3 - Conference contribution

AN - SCOPUS:84958961275

SN - 3540431683

SN - 9783540431688

T3 - Lecture Notes in Computer Science

SP - 323

EP - 334

BT - Public-Key Cryptography - PKC 2002 - 5th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings

A2 - Naccache, David

A2 - Paillier, Pascal

PB - Springer Verlag

T2 - 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002

Y2 - 12 February 2002 through 14 February 2002

ER -

An alternate decomposition of an integer for faster point multiplication on certain elliptic curves

Abstract

Publication series

Other

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this