Author:
Srinivasa Rao Subramanya Rao
Affiliation:
The Australian National University, Australia
Keyword(s):
Elliptic Curve Cryptography, Montgomery Curves, Multiexponentiation, Schoenmakers’ Algorithm, Double Scalar Multiplication, Triple Scalar Multiplication, Smart Cards.
Related
Ontology
Subjects/Areas/Topics:
Applied Cryptography
;
Cryptographic Techniques and Key Management
;
Data Engineering
;
Databases and Data Security
;
Information and Systems Security
;
Security and Privacy in Mobile Systems
Abstract:
In this paper, we provide a triple scalar multiplication analogue of the simultaneous double scalar
Schoenmakers’ algorithm for multiexponentiation. We analyse this algorithm to show that on the average, the
triple scalar Schoenmakers’ algorithm is more expensive than the straight forward method of computing the
individual exponents and then computing the requisite product, thus making it undesirable for use in resource
constrained environments. We also show the derivation of the Schoenmakers’ algorithm for simultaneous
double scalar multiplication and this is then used to construct the triple scalar multiplication analogue.