Skip to main content
Conference Proceedings

Speeding up elliptic scalar multiplication with precomputation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1787 102-119
DOI: 10.1007/10719994_9
14Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is often required in many elliptic curve cryptosystems to compute kG for a fixed point G and a random integer k. In this paper we present improved algorithms for such elliptic scalar multiplication. Implementation results on Pentium II and Alpha 21164 microprocessors are also provided to demonstrate the presented improvements in actual implementations.

Cite

CITATION STYLE

APA

Lim, C. H., & Hwang, H. S. (2000). Speeding up elliptic scalar multiplication with precomputation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1787, pp. 102–119). Springer Verlag. https://doi.org/10.1007/10719994_9

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