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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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%.

Original languageEnglish
Title of host publicationSelected Areas in Cryptography - 13th International Workshop, SAC 2006, Revised Selected Papers
PublisherSpringer Verlag
Pages203-219
Number of pages17
ISBN (Print)9783540744610
DOIs
StatePublished - 2007
Externally publishedYes
Event13th International Workshop on Selected Areas in Cryptography, SAC 2006 - Montreal, QC, Canada
Duration: 17 Aug 200618 Aug 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4356 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Workshop on Selected Areas in Cryptography, SAC 2006
Country/TerritoryCanada
CityMontreal, QC
Period17/08/0618/08/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Delaying and merging operations in scalar multiplication: Applications to curve-based cryptosystems'. Together they form a unique fingerprint.

Cite this