Highly Regular Right-to-Left Algorithms for Scalar Multiplication

This papers introduces several binary scalar multiplication algorithms with applications to cryptography. Remarkably, the proposed algorithms regularly repeat the same pattern when evaluating a scalar multiplication in an (additively written) abelian group. Furthermore, they are generic and feature...

Full description

Saved in:
Bibliographic Details
Published inCryptographic Hardware and Embedded Systems - CHES 2007 pp. 135 - 147
Main Author Joye, Marc
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
constrained devices
cryptography
exponentiation
implementation attacks
Scalar multiplication
Online AccessGet full text

Cover

More Information
Summary:This papers introduces several binary scalar multiplication algorithms with applications to cryptography. Remarkably, the proposed algorithms regularly repeat the same pattern when evaluating a scalar multiplication in an (additively written) abelian group. Furthermore, they are generic and feature the following properties: no dummy operation is involved;no precomputation nor prior recoding is needed;a small number of temporary registers / code memory is required;the scalar is processed right-to-left. As a result, they are particularly well fitted for implementing cryptosystems in constrained devices, in an efficient yet secure way.
ISBN:3540747346
9783540747345
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-74735-2_10