This paper compares different approaches for computing power products ∏1≤i≤k geii 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.
CITATION STYLE
Möller, B. (2001). Algorithms for multi-exponentiation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2259, pp. 165–180). Springer Verlag. https://doi.org/10.1007/3-540-45537-x_13
Mendeley helps you to discover research relevant for your work.