DocumentCode :
3286235
Title :
Exponentiation using division chains
Author :
Walter, Colin D.
Author_Institution :
Dept. of Comput., Univ. of Manchester Inst. of Sci. & Technol., UK
fYear :
1997
fDate :
6-9 Jul 1997
Firstpage :
92
Lastpage :
98
Abstract :
Exponentiation may be performed faster than the traditional square-and-multiply method by iteratively reducing the exponent modulo numbers which themselves require few multiplications, such as those with few non-zero bits. For a suitable choice of such divisors, this reduces the expected number of non-squaring multiplications by over half at the cost of a single extra register. The method is applicable to exponentiation in any multiplicative group where squaring is as expensive as multiplication and not cheaper than integer division. In particular, both hardware and software implementations of the RSA crypto-system can benefit
Keywords :
cryptography; digital arithmetic; iterative methods; RSA cryptographic algorithm; division chains; divisors; exponentiation; extra register; hardware implementation; integer division; iterative exponent reduction; multiplicative group; nonsquaring multiplications; nonzero bits; software implementation; square-and-multiply method; Arithmetic; Costs; Cryptography; Hamming weight; Hardware; NP-hard problem; Power generation; Registers;
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.614883
Filename :
614883
Link To Document :
بازگشت