Please use this identifier to cite or link to this item:
|Title:||Fast square-and-multiply exponentiation for RSA|
|Authors:||Hui, L.C.K. |
|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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 20, 2019
WEB OF SCIENCETM
checked on Feb 12, 2019
checked on Jan 11, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.