Scalable and systolic architecture for computing double exponentiation over GF(2m)

被引:9
作者
Lee, Chiou-Yng
Lin, Jim-Min
Chiou, Che Wun
机构
[1] Feng Chia Univ, Dept Comp Sci & Informat Engn, Taichung 407, Taiwan
[2] Ching Yun Univ, Dept Comp Sci & Informat Engn, Chungli 320, Taiwan
关键词
double-exponentiation; Galois field; polynomial basis; systolic architecture; scalable architecture; cryptography;
D O I
10.1007/s10440-006-9071-0
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Double-exponentiation is a crucial arithmetic operation for many cryptographic protocols. Several efficient double-exponentiation algorithms based on systolic architecture have been proposed. However, systolic architectures require large circuit space, thus increasing the cost of the protocol. This would be a drawback when designing circuits in systems requiring low cost and low power consumption. However, some cost savings can be attained by compromising speed, as in portable devices and many embedded systems. This study proposes a scalable and systolic AB(2) and a scalable and systolic A x B, which are the core circuit modules of double-exponentiation. A scalable and systolic double-exponentiation can thus be obtained based on the proposed scalable AB(2) and A x B architecture. Embedded system engineers may specify a target double-exponentiation with appropriate scaling systolic circuits. The proposed circuit has lower circuit space/cost and low time/propagation than other circuits.
引用
收藏
页码:161 / 178
页数:18
相关论文
共 45 条
[1]   COMPUTATION WITH FINITE FIELDS [J].
BARTEE, TC ;
SCHNEIDER, DI .
INFORMATION AND CONTROL, 1963, 6 (02) :79-+
[2]   GALOIS SWITCHING FUNCTIONS AND THEIR APPLICATIONS [J].
BENJAUTHRIT, B ;
REED, IS .
IEEE TRANSACTIONS ON COMPUTERS, 1976, 25 (01) :78-86
[3]   BIT-SERIAL REED-SOLOMON ENCODERS [J].
BERLEKAMP, ER .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (06) :869-874
[4]  
BLAHUT RE, 1985, FAST ALGORITHMS DIGI
[5]  
Blake I.F., 1999, ELLIPTIC CURVES CRYP
[6]   INTERACTIVE IDENTIFICATION AND DIGITAL-SIGNATURES [J].
BRICKELL, EF ;
MCCURLEY, KS .
AT&T TECHNICAL JOURNAL, 1991, 70 (06) :73-86
[7]   Multiplexer-based double-exponentiation for normal basis of GF(2m) [J].
Chiou, CW ;
Lee, CY .
COMPUTERS & SECURITY, 2005, 24 (01) :83-86
[8]   Low-complexity finite field multiplier using irreducible trinomials [J].
Chiou, CW ;
Lin, LC ;
Chou, FH ;
Shu, SF .
ELECTRONICS LETTERS, 2003, 39 (24) :1709-1711
[9]   NEW DIRECTIONS IN CRYPTOGRAPHY [J].
DIFFIE, W ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654
[10]   Key function of normal basis multipliers in GF(2n) [J].
Fan, H ;
Dai, YQ .
ELECTRONICS LETTERS, 2002, 38 (23) :1431-1432