File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Efficiency of SS(l) square-and-multiply exponentiation algorithms

TitleEfficiency of SS(l) square-and-multiply exponentiation algorithms
Authors
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. 25, p. 2115-2116 How to Cite?
AbstractSS(l) has been demonstrated experimentally to be the fastest square-and-multiply exponentiation scheme based on precomputation and string substitution. The Letter provides a complete proof of the efficiency of the SS(l) algorithm. It shows that SS(l) is a minimum weight representation scheme and proves that the expected weight of an n-bit SS(l)-represented exponent is n/(l+1) for large n.
Persistent Identifierhttp://hdl.handle.net/10722/152251
ISSN
2015 Impact Factor: 0.854
2015 SCImago Journal Rankings: 0.549
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLam, KYen_US
dc.contributor.authorHui, LCKen_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. 25, p. 2115-2116en_US
dc.identifier.issn0013-5194en_US
dc.identifier.urihttp://hdl.handle.net/10722/152251-
dc.description.abstractSS(l) has been demonstrated experimentally to be the fastest square-and-multiply exponentiation scheme based on precomputation and string substitution. The Letter provides a complete proof of the efficiency of the SS(l) algorithm. It shows that SS(l) is a minimum weight representation scheme and proves that the expected weight of an n-bit SS(l)-represented exponent is 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.titleEfficiency of SS(l) square-and-multiply exponentiation algorithmsen_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:19941424en_US
dc.identifier.scopuseid_2-s2.0-0028768786en_US
dc.identifier.volume30en_US
dc.identifier.issue25en_US
dc.identifier.spage2115en_US
dc.identifier.epage2116en_US
dc.identifier.isiWOS:A1994PY77400023-
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridLam, KY=55196950400en_US
dc.identifier.scopusauthoridHui, LCK=8905728300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats