File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast square-and-multiply exponentiation for RSA

TitleFast square-and-multiply exponentiation for RSA
Authors
Hui, LCKLam, KY
KeywordsInformation theory
Public key cryptography
Issue Date1994
PublisherThe Institution of Engineering and Technology. The Journal's web site is located at http://www.ieedl.org/EL
Citation
Electronics Letters, 1994, v. 30 n. 17, p. 1396-1397 How to Cite?
DOI: http://dx.doi.org/10.1049/el:19940949
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.
Persistent Identifierhttp://hdl.handle.net/10722/152250
ISSN
0013-5194
2021 Impact Factor: 1.202
2020 SCImago Journal Rankings: 0.375
ISI Accession Number ID
WOS:A1994PG48100028

 

DC FieldValueLanguage
dc.contributor.authorHui, LCKen_US
dc.contributor.authorLam, KYen_US
dc.date.accessioned2012-06-26T06:36:45Z-
dc.date.available2012-06-26T06:36:45Z-
dc.date.issued1994en_US
dc.identifier.citationElectronics Letters, 1994, v. 30 n. 17, p. 1396-1397en_US
dc.identifier.issn0013-5194en_US
dc.identifier.urihttp://hdl.handle.net/10722/152250-
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.en_US
dc.languageengen_US
dc.publisherThe Institution of Engineering and Technology. The Journal's web site is located at http://www.ieedl.org/ELen_US
dc.relation.ispartofElectronics Lettersen_US
dc.subjectInformation theory-
dc.subjectPublic key cryptography-
dc.titleFast square-and-multiply exponentiation for RSAen_US
dc.typeArticleen_US
dc.identifier.emailHui, LCK:hui@cs.hku.hken_US
dc.identifier.authorityHui, LCK=rp00120en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1049/el:19940949en_US
dc.identifier.scopuseid_2-s2.0-0028499370en_US
dc.identifier.volume30en_US
dc.identifier.issue17en_US
dc.identifier.spage1396en_US
dc.identifier.epage1397en_US
dc.identifier.isiWOS:A1994PG48100028-
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridHui, LCK=8905728300en_US
dc.identifier.scopusauthoridLam, KY=55196935900en_US
dc.identifier.issnl0013-5194-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats