Please use this identifier to cite or link to this item: https://doi.org/10.1049/el:19940949
Title: Fast square-and-multiply exponentiation for RSA
Authors: Hui, L.C.K. 
Lam, K.-Y. 
Issue Date: 1-Jan-1994
Citation: Hui, 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
Abstract: The 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.
Source Title: Electronics Letters
URI: http://scholarbank.nus.edu.sg/handle/10635/99287
ISSN: 00135194
DOI: 10.1049/el:19940949
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

16
checked on Feb 13, 2020

WEB OF SCIENCETM
Citations

16
checked on Feb 13, 2020

Page view(s)

123
checked on Feb 16, 2020

Google ScholarTM

Check

Altmetric


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