Fast square-and-multiply exponentiation for RSA

Please use this identifier to cite or link to this item: https://doi.org/10.1049/el:19940949

DC Field	Value
dc.title	Fast square-and-multiply exponentiation for RSA
dc.contributor.author	Hui, L.C.K.
dc.contributor.author	Lam, K.-Y.
dc.date.accessioned	2014-10-27T06:02:34Z
dc.date.available	2014-10-27T06:02:34Z
dc.date.issued	1994-01-01
dc.identifier.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
dc.identifier.issn	00135194
dc.identifier.uri	http://scholarbank.nus.edu.sg/handle/10635/99287
dc.description.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.
dc.description.uri	http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1049/el:19940949
dc.source	Scopus
dc.type	Article
dc.contributor.department	INFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.doi	10.1049/el:19940949
dc.description.sourcetitle	Electronics Letters
dc.description.volume	30
dc.description.issue	17
dc.description.page	1396-1397
dc.description.coden	ELLEA
dc.identifier.isiut	A1994PG48100028
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check