Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/52744
DC FieldValue
dc.titleA cardinalised binary representation for exponentiation
dc.contributor.authorLam, K.-Y.
dc.contributor.authorSung, K.
dc.contributor.authorHui, L.C.-K.
dc.date.accessioned2014-05-19T02:49:27Z
dc.date.available2014-05-19T02:49:27Z
dc.date.issued1995-10
dc.identifier.citationLam, K.-Y.,Sung, K.,Hui, L.C.-K. (1995-10). A cardinalised binary representation for exponentiation. Computers and Mathematics with Applications 30 (8) : 33-39. ScholarBank@NUS Repository.
dc.identifier.issn08981221
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/52744
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.
dc.sourceScopus
dc.subjectPublic key cryptography
dc.subjectSystolic arrays
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.sourcetitleComputers and Mathematics with Applications
dc.description.volume30
dc.description.issue8
dc.description.page33-39
dc.description.codenCMAPD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.