Skip to main content
Conference ProceedingsOPEN ACCESS

Delaying and merging operations in scalar multiplication: Applications to curve-based cryptosystems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4356 LNCS 203-219
DOI: 10.1007/978-3-540-74462-7_15
N/ACitations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we introduce scalar multiplication algorithms for several classes of elliptic and hyperelliptic curves. The methods are variations on Yao's scalar multiplication algorithm where independent group operations are shown in an explicit way. We can thus merge several group operations and reduce the number of field operations by means of Montgomery's trick. The results are that scalar multiplication on elliptic curves in even characteristic based on point halving can be improved by at least 10% and the performance of Koblitz curves by 25% to 32%. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Avanzi, R. M. (2007). Delaying and merging operations in scalar multiplication: Applications to curve-based cryptosystems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4356 LNCS, pp. 203–219). Springer Verlag. https://doi.org/10.1007/978-3-540-74462-7_15

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