標題: Efficient Implementation of Karatsuba Algorithm Based Three-Operand Multiplication Over Binary Extension Field
作者: Lee, Chiou-Yng
Fan, Chia-Chen
Xie, Jiafeng
Yuan, Shyan-Ming
資訊工程學系
Department of Computer Science
關鍵字: Digit-level serial-in parallel-out (DL-SIPO) multiplier;Karatsuba-algorithm (KA) decomposition;low-complexity;three-operand multiplication (TOM)
公開日期: 1-一月-2018
摘要: Three-operation multiplication (TOM) over binary extension field is frequently encountered in cryptosystems such as elliptic curve cryptography. Though digit-serial polynomial basis multipliers are usually preferred for the realization of TOM due to their efficient tradeoff in implementation complexity, the Karatsuba algorithm (KA)-based strategy is rarely employed to reduce the complexity further. Based on this reason, in this paper, we derive a novel low-complexity implementation of TOM based on a new KA-based digit-serial multiplier. The proposed TOM is obtained through two novel coherent interdependent efforts: 1) mapping an efficient KA-based algorithm into a novel digit-serial multiplier and 2) obtaining a new TOM structure through the novel derivation of the TOM algorithm. From the estimated results, it is shown that the proposed structure has significant lower area-time-complexities when compared with the existing competing TOMs. The proposed TOM is highly regular with low-complexity, and hence can be employed in many cryptographic applications.
URI: http://dx.doi.org/10.1109/ACCESS.2018.2851662
http://hdl.handle.net/11536/147933
ISSN: 2169-3536
DOI: 10.1109/ACCESS.2018.2851662
期刊: IEEE ACCESS
Volume: 6
起始頁: 38234
結束頁: 38242
顯示於類別:期刊論文