This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Multicomputation with Asynchronous Strategy
February 2007 (vol. 56 no. 2)
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^{x}b^{y} 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.

[0]

Index Terms:
Public key cryptosystems, multicomputations, multi-exponentiations, multiscalar-multiplications, binary signed-digit codes, joint sparse forms.
Citation:
Wu-Chuan Yang, D.J. Guan, Chi Sung Laih, "Fast Multicomputation with Asynchronous Strategy," IEEE Transactions on Computers, vol. 56, no. 2, pp. 234-242, Feb. 2007, doi:10.1109/TC.2007.29
Usage of this product signifies your acceptance of the Terms of Use.