Algorithms for multi-exponentiation based on complex arithmetic

Abstract

In this paper we propose new algorithms for multiple modular exponentiation operations. The major aim of these algorithms is to speed up the pe~ormance of some cryptographic protocols based on multi-exponentiation. The algorithms proposed are based on binary-like complex arithmetic, introduced by Pekmestzi and generalized in this paper.