Complexity and fast algorithms for multiexponentiations

Authors
Dimitrov, VS Jullien, GA Miller, WC
Citation
Vs. Dimitrov et al., Complexity and fast algorithms for multiexponentiations, IEEE COMPUT, 49(2), 2000, pp. 141-147
Citations number
42
Categorie Soggetti
Computer Science & Engineering
Journal title
IEEE TRANSACTIONS ON COMPUTERS
ISSN journal
00189340 → ACNP
Volume
49
Issue
2
Year of publication
2000
Pages
141 - 147
Database
ISI
SICI code
0018-9340(200002)49:2<141:CAFAFM>2.0.ZU;2-7
Abstract
In this paper, we propose new algorithms for multiple modular exponentiatio n operations. The major aim of these algorithms is to speed up the performa nce of some cryptographic protocols based on multiexponentiation. Our new a lgorithms are based on binary-like complex arithmetic, introduced by Pekmes tzi and generalized in this paper.