A Note on Schoenmakers Algorithm for Multi Exponentiation

Srinivasa Rao Subramanya Rao

2015

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.

Paper Citation

in Harvard Style

Rao Subramanya Rao S. (2015). A Note on Schoenmakers Algorithm for Multi Exponentiation . In Proceedings of the 12th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2015) ISBN 978-989-758-117-5, pages 384-391. DOI: 10.5220/0005566903840391

in Bibtex Style

@conference{secrypt15,
author={Srinivasa Rao Subramanya Rao},
title={A Note on Schoenmakers Algorithm for Multi Exponentiation},
booktitle={Proceedings of the 12th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2015)},
year={2015},
pages={384-391},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005566903840391},
isbn={978-989-758-117-5},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 12th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2015)
TI - A Note on Schoenmakers Algorithm for Multi Exponentiation
SN - 978-989-758-117-5
AU - Rao Subramanya Rao S.
PY - 2015
SP - 384
EP - 391
DO - 10.5220/0005566903840391