The Community for Technology Leaders
Green Image
Issue No. 02 - February (2007 vol. 56)
ISSN: 0018-9340
pp: 234-242
We propose a new strategy to improve the performance of multicomputations, such as computing xA + yB in an additive group or a xby in a multiplicative group. This new strategy is called asynchronous strategy. In each iteration, it tries to compute partial results by pairing nearby zero and nonzero bits. The new strategy can be applied to any binary code of x and y to further reduce the computational cost. However, our experiments show that sparse signed-digit code can achieve minimum computational cost. The algorithms using the asynchronous strategy need only O(h) extra registers when they try to do computation with bits which are h positions apart
digital arithmetic, binary codes, computational complexity,joint sparse forms, multicomputation, asynchronous strategy, binary code, computational cost reduction, sparse signed-digit code, public key cryptosystems, multiexponentiations, multiscalar-multiplications,joint sparse forms., Public key cryptosystems, multicomputations, multi-exponentiations, multiscalar-multiplications, binary signed-digit codes
"Fast Multicomputation with Asynchronous Strategy", IEEE Transactions on Computers, vol. 56, no. , pp. 234-242, February 2007, doi:10.1109/TC.2007.29
103 ms
(Ver 3.3 (11022016))