Skip to main content
Conference ProceedingsOPEN ACCESS

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) (2002) 2274 323-334
DOI: 10.1007/3-540-45664-3_23
N/ACitations
Citations of this article
35Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2274, pp. 323–334). Springer Verlag. https://doi.org/10.1007/3-540-45664-3_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free