Please use this identifier to cite or link to this item:
Title: Efficiency of SS(l) square-and-multiply exponentiation algorithms
Authors: Lam, K.-Y. 
Hui, L.C.K. 
Issue Date: 8-Dec-1994
Citation: Lam, K.-Y., Hui, L.C.K. (1994-12-08). Efficiency of SS(l) square-and-multiply exponentiation algorithms. Electronics Letters 30 (25) : 2115-2116. ScholarBank@NUS Repository.
Abstract: SS(l) has been demonstrated experimentally to be the fastest square-and-multiply exponentiation scheme based on precomputation and string substitution. The Letter provides a complete proof of the efficiency of the SS(l) algorithm. It shows that SS(l) is a minimum weight representation scheme and proves that the expected weight of an n-bit SS(l)-represented exponent is n/(l+1) for large n.
Source Title: Electronics Letters
ISSN: 00135194
DOI: 10.1049/el:19941424
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.