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 条
  • [31] A novel scalable dual basis GF(2m) multiplier architecture
    Chen L.-H.
    Chang Y.-C.
    Lee C.-Y.
    Chang P.-L.
    Journal of Computers (Taiwan), 2017, 28 (01) : 87 - 103
  • [32] Multiplexer-based double-exponentiation for normal basis of GF(2m)
    Chiou, CW
    Lee, CY
    COMPUTERS & SECURITY, 2005, 24 (01) : 83 - 86
  • [33] Combined circuit architecture for computing normal basis and Montgomery multiplications over GF(2m)
    Lee C.-Y.
    Fan C.-C.
    Lu E.-H.
    International Journal of Autonomous and Adaptive Communications Systems, 2011, 4 (03) : 291 - 306
  • [34] Semi-systolic modular multiplier over GF(2m)
    Kim, Hyun-Sung
    Lee, Sung-Woon
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2008, PT 2, PROCEEDINGS, 2008, 5073 : 836 - +
  • [35] A semi-systolic Montgomery multiplier over GF(2m)
    Kim, Kee-Won
    Jeon, Jun-Cheol
    IEICE ELECTRONICS EXPRESS, 2015, 12 (21):
  • [36] Error Detecting Dual Basis Bit Parallel Systolic Multiplication Architecture over GF(2m)
    Singh, A. K.
    Bera, Asish
    Rahaman, H.
    Mathew, J.
    Pradhan, D. K.
    IEEE CIRCUITS AND SYSTEMS INTERNATIONAL CONFERENCE ON TESTING AND DIAGNOSIS, 2009, : 451 - 454
  • [37] Bit-Parallel Systolic Architecture for AB and AB2 Multiplications over GF(2m)
    Kim K.-W.
    IEICE Transactions on Electronics, 2022, E105.C (05) : 203 - 206
  • [38] Hardware, implementation of the binary method for exponentiation in GF(2m)
    Martínez, MAG
    Luna, GM
    Henríquez, FR
    PROCEEDINGS OF THE FOURTH MEXICAN INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE (ENC 2003), 2003, : 131 - 134
  • [39] Low area scalable Montgomery inversion over GF(2m)
    Hassan, Mohamed N.
    Benaissa, Mohammed
    SECRYPT 2008: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY, 2008, : 363 - 367
  • [40] Hardware-efficient systolic architecture for inversion and division in GF(2m)
    Guo, JH
    Wang, CL
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1998, 145 (04): : 272 - 278