Please use this identifier to cite or link to this item:
https://doi.org/10.1049/el:19941424
DC Field | Value | |
---|---|---|
dc.title | Efficiency of SS(l) square-and-multiply exponentiation algorithms | |
dc.contributor.author | Lam, K.-Y. | |
dc.contributor.author | Hui, L.C.K. | |
dc.date.accessioned | 2014-10-27T06:02:13Z | |
dc.date.available | 2014-10-27T06:02:13Z | |
dc.date.issued | 1994-12-08 | |
dc.identifier.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 | |
dc.identifier.issn | 00135194 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/99257 | |
dc.description.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. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1049/el:19941424 | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | INFORMATION SYSTEMS & COMPUTER SCIENCE | |
dc.description.doi | 10.1049/el:19941424 | |
dc.description.sourcetitle | Electronics Letters | |
dc.description.volume | 30 | |
dc.description.issue | 25 | |
dc.description.page | 2115-2116 | |
dc.description.coden | ELLEA | |
dc.identifier.isiut | A1994PY77400023 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.