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

Young Ho Park; Sangtae Jeong; Chang Han Kim; Jong In 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, Jong In Lim

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	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Verlag
Pages	323-334
Number of pages	12
Volume	2274
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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2274
ISSN (Print)	03029743
ISSN (Electronic)	16113349

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

ASJC Scopus subject areas

General Computer Science
Theoretical Computer Science

Access to Document

10.1007/3-540-45664-3_23

Cite this

Park, Y. H., Jeong, S., Kim, C. H., & Lim, J. I. (2002). An alternate decomposition of an integer for faster point multiplication on certain elliptic curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2274, pp. 323-334). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 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.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2274 Springer Verlag, 2002. p. 323-334 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2274).

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

Park, YH, Jeong, S, Kim, CH & Lim, JI 2002, An alternate decomposition of an integer for faster point multiplication on certain elliptic curves. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2274, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 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 JI. An alternate decomposition of an integer for faster point multiplication on certain elliptic curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2274. Springer Verlag. 2002. p. 323-334. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2274 Springer Verlag, 2002. pp. 323-334 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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 Lim, {Jong In}",

year = "2002",

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

language = "English",

isbn = "3540431683",

volume = "2274",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "323--334",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

note = "5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002 ; Conference date: 12-02-2002 Through 14-02-2002",

}

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, Jong In

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 - http://www.scopus.com/inward/record.url?scp=84958961275&partnerID=8YFLogxK

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

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

VL - 2274

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

SP - 323

EP - 334

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

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

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this