Complexity and fast algorithms for multiexponentiations
Vassil S. Dimitrov, GRAHAM A. JULLIEN, W.C. Miller · IEEE Transactions on Computers · 2000
In this paper, we propose new algorithms for multiple modular exponentiation operations. The major aim of these algorithms is to speed up the performance of some cryptographic protocols based on multiexponentiation. Our new algorithms are based on binary-like complex arithmetic, introduced by K. Pekmestzi (1989) and generalized in this paper.