Algorithms for Multi-exponentiation

This paper compares different approaches for computing power products 1≤i≤k gei i in finite 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.

• Type: Conference
• Year: 2001
• Where: SACRYPT
• Authors: Bodo Möller
• Keywords: Conventional Method, Conventional Simultaneous Exponentiation, Cryptology, Interleaving, SACRYPT 2001