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
相关论文
共 50 条
  • [1] Scalable and Systolic Architecture for Computing Double Exponentiation Over GF(2m)
    Chiou-Yng Lee
    Jim-Min Lin
    Che Wun Chiou
    Acta Applicandae Mathematica, 2006, 93 : 161 - 178
  • [2] Scalable and systolic Montgomery multipliers over GF(2m)
    Chen, Chin-Chin
    Lee, Chiou-Yng
    Lu, Erl-Huei
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (07) : 1763 - 1771
  • [3] LOW COMPLEXITY ARCHITECTURE FOR EXPONENTIATION IN GF(2M)
    HASAN, MA
    BHARGAVA, VK
    ELECTRONICS LETTERS, 1992, 28 (21) : 1984 - 1986
  • [4] SCALABLE AND SYSTOLIC DUAL BASIS MULTIPLIER OVER GF(2m)
    Chen, Liang-Hwa
    Chang, Po-Lun
    Lee, Chiou-Yng
    Yang, Ying-Kuei
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2011, 7 (03): : 1193 - 1208
  • [5] Efficient systolic modular multiplier/squarer for fast exponentiation over GF(2m)
    Choi, Se-Hyu
    Lee, Keon-Jik
    IEICE ELECTRONICS EXPRESS, 2015, 12 (11):
  • [6] Test Generation in Systolic Architecture for Multiplication Over GF(2m)
    Rahaman, Hafizur
    Mathew, Jimson
    Pradhan, Dhiraj K.
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2010, 18 (09) : 1366 - 1371
  • [7] Scalable and systolic Montgomery multiplier over GF(2m) generated by trinomials
    Lee, C. -Y.
    Chiou, C. W.
    Lin, J. -M.
    Chang, C. -C.
    IET CIRCUITS DEVICES & SYSTEMS, 2007, 1 (06) : 477 - 484
  • [8] ARCHITECTURES FOR EXPONENTIATION IN GF(2M)
    SCOTT, PA
    SIMMONS, SJ
    TAVARES, SE
    PEPPARD, LE
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1988, 6 (03) : 578 - 586
  • [9] A unidirectional bit serial systolic architecture for double-basis division over GF(2m)
    Daneshbeh, AK
    Hasan, MA
    16TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2003, : 174 - 180
  • [10] Semi-systolic architecture for modular multiplication over GF(2m)
    Kim, HS
    Jeon, IS
    COMPUTATIONAL SCIENCE - ICCS 2005, PT 3, 2005, 3516 : 912 - 915