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 条
  • [21] The design of a low-complexity systolic architecture for fast bit-parallel exponentiation in a class of GF(2m)
    Lee, CY
    Lu, EH
    Sun, LF
    2000 5TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS, VOLS I-III, 2000, : 598 - 605
  • [22] An efficient architecture for computing division over GF(2m) in elliptic curve cryptography
    Zhou, JY
    Jiang, XG
    Chen, HH
    2005 6th International Conference on ASIC Proceedings, Books 1 and 2, 2005, : 274 - 277
  • [23] High-Speed Algorithm for Modular Exponentiation over GF(2m)
    He Debiao
    Chen Jianhua
    Hu Zhijin
    PROCEEDINGS OF 2009 INTERNATIONAL WORKSHOP ON INFORMATION SECURITY AND APPLICATION, 2009, : 248 - 251
  • [24] Unified parallel Systolic multiplier over GF(2m)
    Lee, Chiou-Yng
    Chen, Yung-Hui
    Chiou, Che-Wun
    Lin, Jim-Min
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2007, 22 (01) : 28 - 38
  • [25] Efficient bit-parallel systolic architecture for multiplication and squaring over GF(2m)
    Kim, Kee-Won
    Kim, Seung-Hoon
    IEICE ELECTRONICS EXPRESS, 2018, 15 (02):
  • [26] Low complexity bit-parallel systolic architecture for computing C+AB2 over a class of GF(2m)
    Ting, YR
    Lu, EH
    Lee, JY
    INTEGRATION-THE VLSI JOURNAL, 2004, 37 (03) : 167 - 176
  • [27] An architecture for computing Zech's logarithms in GF(2m)
    Assis, FM
    Pedreira, CE
    IEEE TRANSACTIONS ON COMPUTERS, 2000, 49 (05) : 519 - 524
  • [28] Efficient exponentiation of a primitive root in GF(2m)
    Univ of Waterloo, Waterloo, Canada
    IEEE Trans Comput, 2 (162-172):
  • [29] Unified and Scalable Digit-Serial Systolic Array for Multiplication and Division Over GF (2m)
    Ibrahim, Atef
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (07) : 1546 - 1549
  • [30] A scalable and unified multiplier architecture for finite fields GF(p) and GF(2m)
    Savas, E
    Tenca, AF
    Koç, ÇK
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS-CHES 2000, PROCEEDINGS, 2001, 1965 : 277 - 292