Please use this identifier to cite or link to this item:
|Title:||A cardinalised binary representation for exponentiation|
|Authors:||Lam, K.-Y. |
|Keywords:||Public key cryptography|
|Citation:||Lam, 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.|
|Abstract:||This 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) , and shows that both software and hardware CBR exponentiation algorithms operate more efficiently than that of BRR. © 1995.|
|Source Title:||Computers and Mathematics with Applications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.