In this paper, we extend a recent piece of work on low-weight polynomial form integers (LWPFIs). We present a new coefficient reductionalgorithm based on the montgomery reduction algorithm and provide its detailed an...
详细信息
ISBN:
(纸本)9780769528540
In this paper, we extend a recent piece of work on low-weight polynomial form integers (LWPFIs). We present a new coefficient reductionalgorithm based on the montgomery reduction algorithm and provide its detailed analysis results. We give a condition for eliminating the final subtractions at the end of our montgomery reduction algorithm adapted to perform the coefficient reduction. Our experimental results show that a new coefficient reductionalgorithm is indeed more efficient than the one presented in\.
In this paper, a new parallel montgomery binary exponentiation algorithm was proposed. This algorithm is based on the montgomery modular reduction technique, binary method, common-multiplicand-multiplication (CMM) alg...
详细信息
ISBN:
(纸本)9783642030949
In this paper, a new parallel montgomery binary exponentiation algorithm was proposed. This algorithm is based on the montgomery modular reduction technique, binary method, common-multiplicand-multiplication (CMM) algorithm, and the canonical-signed-digit recoding (CSD) technique. By using the CMM algorithm of computing the common part from two modular multiplications, the same common part in two modular multiplications can be computed once rather twice, we can thus improve the efficiency of the binary exponentiation algorithm by decreasing the number of modular multiplications. Furthermore, by using the proposed parallel CMM-CSD montgomery binary exponentiation algorithm, the total number of single-precision multiplications can be reduced by about 66.7% and 30% as compared with the original montgomeryalgorithm and the Ha-Moon's improved montgomeryalgorithm, respectively.
暂无评论