DocumentCode
3287774
Title
Algorithms for multi-exponentiation based on complex arithmetic
Author
Dimitrov, V.S. ; Jullien, G.A. ; Miller, W.C.
Author_Institution
VLSI Res. Group, Windsor Univ., Ont., Canada
fYear
1997
fDate
6-9 Jul 1997
Firstpage
208
Lastpage
215
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 multi-exponentiation. The algorithms proposed are based on binary-like complex arithmetic, introduced by K. Pekmestzi (1989) and generalized in this paper
Keywords
cryptography; digital arithmetic; number theory; protocols; software performance evaluation; binary-like complex arithmetic; cryptographic protocols; multi-exponentiation algorithms; multiple modular exponentiation operations; performance; Arithmetic; Costs; Cryptographic protocols; Elliptic curve cryptography; Graphics; Hamming weight; NP-complete problem; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Arithmetic, 1997. Proceedings., 13th IEEE Symposium on
Conference_Location
Asilomar, CA
ISSN
1063-6889
Print_ISBN
0-8186-7846-1
Type
conf
DOI
10.1109/ARITH.1997.614897
Filename
614897
Link To Document