File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A cardinalised binary representation for exponentiation

TitleA cardinalised binary representation for exponentiation
Authors
KeywordsPublic Key Cryptography
Systolic Arrays
Issue Date1995
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/camwa
Citation
Computers And Mathematics With Applications, 1995, v. 30 n. 8, p. 33-39 How to Cite?
AbstractThis paper introduces the Cardinalised Binary Representation (CBR) of integers. A family of algorithms for converting binary integers to their CBR equivalents is described. Characteristics of the resulting representation is analyzed and exploited to achieve performance improvement for large integer exponentiation operations. This paper demonstrates that the CBR is a more general scheme than the well known Binary Redundant Representation (BRR) [1], and shows that both software and hardware CBR exponentiation algorithms operate more efficiently than that of BRR. © 1995.
Persistent Identifierhttp://hdl.handle.net/10722/152300
ISSN
2015 Impact Factor: 1.398
2015 SCImago Journal Rankings: 1.092

 

DC FieldValueLanguage
dc.contributor.authorLam, KYen_US
dc.contributor.authorSung, Ken_US
dc.contributor.authorHui, LCKen_US
dc.date.accessioned2012-06-26T06:37:01Z-
dc.date.available2012-06-26T06:37:01Z-
dc.date.issued1995en_US
dc.identifier.citationComputers And Mathematics With Applications, 1995, v. 30 n. 8, p. 33-39en_US
dc.identifier.issn0898-1221en_US
dc.identifier.urihttp://hdl.handle.net/10722/152300-
dc.description.abstractThis paper introduces the Cardinalised Binary Representation (CBR) of integers. A family of algorithms for converting binary integers to their CBR equivalents is described. Characteristics of the resulting representation is analyzed and exploited to achieve performance improvement for large integer exponentiation operations. This paper demonstrates that the CBR is a more general scheme than the well known Binary Redundant Representation (BRR) [1], and shows that both software and hardware CBR exponentiation algorithms operate more efficiently than that of BRR. © 1995.en_US
dc.languageengen_US
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/camwaen_US
dc.relation.ispartofComputers and Mathematics with Applicationsen_US
dc.subjectPublic Key Cryptographyen_US
dc.subjectSystolic Arraysen_US
dc.titleA cardinalised binary representation for exponentiationen_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.scopuseid_2-s2.0-0141784267en_US
dc.identifier.volume30en_US
dc.identifier.issue8en_US
dc.identifier.spage33en_US
dc.identifier.epage39en_US
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridLam, KY=55196848100en_US
dc.identifier.scopusauthoridSung, K=36475704800en_US
dc.identifier.scopusauthoridHui, LCK=8905728300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats