arrow
返回

Fast modular multi-exponentiation using modified complex arithmetic

delete2007-03-01
delete10
PRE
AI
C
Chia-Long Wu *
D
Der‐Chyuan Lou
J
Jui-Chang Lai
T
Te-Jen Chang
DOI:10.1016/j.amc.2006.08.051delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Modular multi-exponentiation Pi M-n(i=1)i(E)i(modN) is a very important but time-consuming operation in many modern cryptosystems. In this paper, a fast modular multi-exponentiation is proposed utilizing the binary-like complex arithmetic method, complement representation method and canonical-signed-digit recoding technique. By performing complements and canonical-signed-digit recoding technique, the Hamming weight (number of 1's in the binary representation or number of non-zero digits in the binary signed-digit representations) of the exponents can be reduced. Based on these techniques, an algorithm with efficient modular multi-exponentiation is proposed. For modular multi-exponentiation, in average case, the proposed algorithm can reduce the number of modular multiplications (MMs) from 1.503k to 1.306k, where k is the bit-length of the exponent. We can therefore efficiently speed up the overall performance of the modular multi-exponentiation for cryptographic applications. (c) 2006 Elsevier Inc. All rights reserved.
Keyword:
complex arithmetic
Hamming weight
signed-digit recoding
multi-exponentiation
public key cryptography

期刊

Applied Mathematics and Computation 封面图
Applied Mathematics and Computation
IF:
3.4
论文数:
2.3W
被引数:
3.3W

机构

暂无机构信息
引用论文

引用论文

Concussion and the Young Athlete
err2013-01-26
err0
PREAI
errCaroline Faure; Cynthia A. Lee Pemberton
err分享
err收藏
Mighty hearts in space
err2015-01-30
err0
errOAAI
errJens Tank; Jens Jordan
err分享
err收藏
学者 查看更多内容