Title :
Complexity and fast algorithms for multiexponentiations
Author :
Dimitrov, Vassil S. ; Jullien, Graham A. ; Miller, William C.
Author_Institution :
GETA, Helsinki Univ. of Technol., Hut, Finland
fDate :
2/1/2000 12:00:00 AM
Abstract :
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
Keywords :
computational complexity; cryptography; protocols; binary-like complex arithmetic; complexity; cryptographic protocols; multiexponentiations; multiple modular exponentiation operations; performance; Arithmetic; Costs; Cryptographic protocols; Elliptic curve cryptography; Hamming weight;
Journal_Title :
Computers, IEEE Transactions on
