Please use this identifier to cite or link to this item: https://doi.org/10.1049/el:19940949
DC FieldValue
dc.titleFast square-and-multiply exponentiation for RSA
dc.contributor.authorHui, L.C.K.
dc.contributor.authorLam, K.-Y.
dc.date.accessioned2014-10-27T06:02:34Z
dc.date.available2014-10-27T06:02:34Z
dc.date.issued1994-01-01
dc.identifier.citationHui, L.C.K., Lam, K.-Y. (1994-01-01). Fast square-and-multiply exponentiation for RSA. Electronics Letters 30 (17) : 1396-1397. ScholarBank@NUS Repository. https://doi.org/10.1049/el:19940949
dc.identifier.issn00135194
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/99287
dc.description.abstractThe authors describe a practical technique for improving the performance of square-and-multiply exponentiation. A family of linear time algorithms, denoted by SS(l) where l determines the maximum length of precomputed exponents, is presented. Analysis on n-bit exponents shows that the average number of multiplications required tends to n/(l+1) for large n.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1049/el:19940949
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.doi10.1049/el:19940949
dc.description.sourcetitleElectronics Letters
dc.description.volume30
dc.description.issue17
dc.description.page1396-1397
dc.description.codenELLEA
dc.identifier.isiutA1994PG48100028
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

16
checked on Sep 21, 2020

WEB OF SCIENCETM
Citations

16
checked on Sep 21, 2020

Page view(s)

142
checked on Sep 19, 2020

Google ScholarTM

Check

Altmetric


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