IMPROVED GENERALIZATION COMMON-MULTIPLICAND MULTIPLICATIONS ALGORITHM OF YEN AND LAIH

被引：18

作者：

WU, TC

CHANG, YS

机构：

[1] Department of Information Management, National Taiwan Institute of Technology, Taipei

来源：

ELECTRONICS LETTERS | 1995年 / 31卷 / 20期

关键词：

CRYPTOGRAPHY; COMMON-MULTIPLICAND MULTIPLICATION;

D O I：

10.1049/el:19951189

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Yen and Laih proposed an algorithm for efficient computation of the common-multiplicand multiplications problem {X x Y-i/i = 1, 2,..., t; t greater than or equal to 2}, which is very useful for public key cryptographic exponentiation computation. By using a k-times folding technique, the authors present an improved generalisation of the algorithm of Yen and Laih and show that the improvement needs fewer multiplications compared with the original algorithm of Yen and Laih.

引用

页码：1738 / 1739

页数：2

共 50 条

[1] Fast, compact and symmetric modular exponentiation architecture by common-multiplicand Montgomery modular multiplications
Wu, Tao
Li, Shuguo
Liu, Litian
[J]. INTEGRATION-THE VLSI JOURNAL, 2013, 46 (04) : 323 - 332
[2] A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation
Ha, JC
Moon, SJ
[J]. INFORMATION PROCESSING LETTERS, 1998, 66 (02) : 105 - 107
[3] Improved common-multiplicand multiplication and fast exponentiation by exponent decomposition
Yen, SM
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (06) : 1160 - 1163
[4] Fast batch modular exponentiation with common-multiplicand multiplication
Seo, Jungjoo
Park, Kunsoo
[J]. INFORMATION PROCESSING LETTERS, 2018, 129 : 5 - 10
[5] Fast algorithms for common-multiplicand multiplication and exponentiation by performing complements
Chang, CC
Kuo, YT
Lin, CH
[J]. AINA 2003: 17TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS, 2003, : 807 - 811
[6] COMMON-MULTIPLICAND MULTIPLICATION AND ITS APPLICATIONS TO PUBLIC-KEY CRYPTOGRAPHY
YEN, SM
LAIH, CS
[J]. ELECTRONICS LETTERS, 1993, 29 (17) : 1583 - 1584
[7] Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements
Yen, Sung-Ming
Lien, Wei-Chih
Moon, SangJae
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2007, 189 (01) : 285 - 290
[8] A improved yen algorithm based on A*
Li, Jianfu
[J]. Journal of Computational Information Systems, 2012, 8 (21): : 9017 - 9024
[9] An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
Wu, Chia-Long
[J]. INFORMATION SCIENCES, 2009, 179 (04) : 410 - 421
[10] A comment on "An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation"
Sun, Da-Zhi
Huai, Jin-Peng
Cao, Zhen-Fu
[J]. INFORMATION SCIENCES, 2013, 223 : 331 - 334

← 1 2 3 4 5 →