Algorithms for Multi-exponentiation

@inproceedings{Mller2001AlgorithmsFM,
  title={Algorithms for Multi-exponentiation},
  author={Bodo M{\"o}ller},
  booktitle={Selected Areas in Cryptography},
  year={2001}
}
This paper compares different approaches for computing power products ∏ 1≤i≤k g ei 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… CONTINUE READING