FAST SQUARE-AND-MULTIPLY EXPONENTIATION FOR RSA

Authors
HUI LCK LAM KY
Citation
Lck. Hui et Ky. Lam, FAST SQUARE-AND-MULTIPLY EXPONENTIATION FOR RSA, Electronics Letters, 30(17), 1994, pp. 1396-1397
Citations number
3
Categorie Soggetti
Engineering, Eletrical & Electronic
Journal title
Electronics Letters → ACNP
ISSN journal
00135194
Volume
30
Issue
17
Year of publication
1994
Pages
1396 - 1397
Database
ISI
SICI code
0013-5194(1994)30:17<1396:FSEFR>2.0.ZU;2-K
Abstract
The authors describe a practical technique for improving the performan ce of square-and-multiply exponentiation. A family of linear time algo rithms, denoted by SS(l) where l determines the maximum length of prec omputed exponents, is presented. Analysis on n-bit exponents shows tha t the average number of multiplications required tends to nl(l + 1) fo r large n.