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.
|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. https://doi.org/10.1049/el:19941424||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||URI:||http://scholarbank.nus.edu.sg/handle/10635/99257||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.
checked on May 29, 2020
WEB OF SCIENCETM
checked on May 22, 2020
checked on May 30, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.