Algorithms for Multi-exponentiation (2001)
Cached
Download Links
| Venue: | In Selected Areas in Cryptography – SAC 2001 (2001 |
| Citations: | 16 - 3 self |
BibTeX
@INPROCEEDINGS{Möller01algorithmsfor,
author = {Bodo Möller and Technische Universität Darmstadt and Fachbereich Informatik},
title = {Algorithms for Multi-exponentiation},
booktitle = {In Selected Areas in Cryptography – SAC 2001 (2001},
year = {2001},
pages = {165--180},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper compares different approaches for computing power products � 1≤i≤k ge i i in commutative groups. We look at the conventional simultaneous exponentiation approach and present an alternative strategy, interleaving exponentiation. Our comparison shows that in general groups, sometimes the conventional method and sometimes interleaving exponentiation is more efficient. In groups where inverting elements is easy (e.g. elliptic curves), interleaving exponentiation with signed exponent recoding usually wins over the conventional method. 1
