DocumentCode
978634
Title
Fast exponentiation method obtained by folding the exponent in half
Author
Chang, Chung-Ching
Volume
32
Issue
11
fYear
1996
fDate
5/23/1996 12:00:00 AM
Firstpage
984
Lastpage
985
Abstract
On average, the square-and-multiply method requires 1.5 k multiplications to evaluate χE, where k is the bit length of E. Recently, Wu and Chang (see ibid., vol. 31, no. 20, p. 1738-9, 1995) proposed an efficient method for computing χE, which needs 156 k/128 multiplications. By folding the exponent E in half and combining Wu and Chang´s method, we present a more efficient method for evaluating χE. On average, our new method needs only 149 k/128+3 multiplications
Keywords
cryptography; digital arithmetic; parallel algorithms; fast exponentiation method; multiplications; parallel processing;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19960662
Filename
503069
Link To Document