Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation

We concentrate our attention on the computational efficiency analysis of the multiexponentiation algorithm using Yang et al.'s BSD representation, which is the generalization of Dimitrov et al.'s BSD representation. Our theoretical results are that the average number of multiplications is at least 1.527n by Yang et al.'s BSD representation and 1.537n by Dimitrov et al.'s BSD representation, where n is the bit-length of the exponents.

show abstract

“…In 2005, Yang et al [2005] further proposed a so-called asynchronous BSD representation. It can be briefly described as follows.…”

Section: Yang Et Al's Bsd Representationmentioning

confidence: 99%

“…Consider the binary signed-digit (BSD) representations [Arno and Wheeler (1993); Dimitrov et al (2000); Joye and Yen (2000); Yang et al (2005)]. The frame of the multi-exponentiation algorithm can be illustrated as Fig.…”

Section: Introductionmentioning

confidence: 99%

Analysis of Multi-Exponentiation Algorithm Using Binary Signed-Digit Representations

Sun

Huai

Sun

et al. 2009

Int. J. Comput. Methods

View full text Add to dashboard Cite

show abstract

“…Whereas the binary representation for an integer is unique, the signed binary representation by −1, 1, and 0 is not. Since the cost of computing the inverse of a point is negligible compared to the point addition over the elliptic curve group, the improved multi-scalar multiplication algorithms, detailed in [10][11][12][13][14][15][16][17], require only one extra register to store the value A -B in Step 1 of Algorithm Shamir's trick in Figure 1. The NAF representation [18,19] is optimal for one integer.…”

Section: Previous Workmentioning

confidence: 99%

On Multi-Scalar Multiplication Algorithms for Register-Constrained Environments

et al. 2021

View full text Add to dashboard Cite

A basic but expensive operation in the implementations of several famous public-key cryptosystems is the computation of the multi-scalar multiplication in a certain finite additive group defined by an elliptic curve. We propose an adaptive window method for the multi-scalar multiplication, which aims to balance the computation cost and the memory cost under register-constrained environments. That is, our method can maximize the computation efficiency of multi-scalar multiplication according to any small, fixed number of registers provided by electronic devices. We further demonstrate that our method is efficient when five registers are available. Our method is further studied in detail in the case where it is combined with the non-adjacent form (NAF) representation and the joint sparse form (JSF) representation. One efficiency result is that our method with the proposed improved NAF n-bit representation on average requires 209n/432 point additions. To the best of our knowledge, this efficiency result is optimal compared with those of similar methods using five registers. Unlike the previous window methods, which store all possible values in the window, our method stores those with comparatively high probabilities to reduce the number of required registers.

show abstract

Modular Arithmetic and Fast Algorithm Designed for Modern Computer Security Applications

2012

Intelligent Information and Database Systems

View full text Add to dashboard Cite

Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation

Cited by 9 publications

References 8 publications

Analysis of Multi-Exponentiation Algorithm Using Binary Signed-Digit Representations

Analysis of Multi-Exponentiation Algorithm Using Binary Signed-Digit Representations

On Multi-Scalar Multiplication Algorithms for Register-Constrained Environments

Modular Arithmetic and Fast Algorithm Designed for Modern Computer Security Applications

Contact Info

Product

Resources

About