Fully paramaterisable Galois field arithmetic processor over GF(3m) suitable for elliptic curve cryptography

被引：0
|
作者：
Kerins, T [1 ]
Popovici, EM [1 ]
Marnane, WP [1 ]
机构：
[1] Univ Coll Cork, Dept Elect & Elect Engn, Cork, Ireland
来源：
2004 24TH INTERNATIONAL CONFERENCE ON MICROELECTRONICS, PROCEEDINGS, VOLS 1 AND 2 | 2004年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
In this paper we present an architecture for a flexible GF(3(m)) multiplicative arithmetic processor. The ABC processor performs computations of the form R = (AB/C) mod F in 2m clock cycles, where A,B,C and F are polynomials over GF(3). The same hardware can be used for different field sizes offering full paramaterisability up to a maximum field size. We present prototype implementation results on FPGA for a field size of GF(3(255)). The processor is suitable for cryptographic applications where variable levels of security are required.
引用
收藏
页码：739 / 742
页数：4
相关论文
共 46 条
  • [31] An elliptic curve cryptography coprocessor over GF(2m) on a low-cost embedded system
    Zhao, Hui
    Wang, Long
    Bai, Guo-Qiang
    2007 INTERNATIONAL WORKSHOP ON ELECTRON DEVICES AND SEMICONDUCTOR TECHNOLOGY, 2007, : 178 - +
  • [32] Architectural extensions for elliptic curve cryptography over GF(2m) on 8-bit microprocessors
    Eberle, H
    Wander, A
    Gura, N
    Chang-Shantz, S
    Gupta, V
    16TH INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURE AND PROCESSORS, PROCEEDINGS, 2005, : 343 - 349
  • [33] HELP multiplier based montgomery key generation for Elliptic Curve Cryptography over GF (2m)
    Muthu Kumar, B.
    Jeevananthan, S.
    International Review on Computers and Software, 2012, 7 (03) : 943 - 949
  • [34] A high-speed, high-radix, Processor Array architecture for real-time elliptic curve cryptography over GF(2m)
    Fayed, Mohamed A.
    EI-Kharashi, M. Watheq
    Gebali, Fayez
    2007 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY, VOLS 1-3, 2007, : 110 - +
  • [35] A high-performance elliptic curve cryptographic processor for general curves over GF(p) based on a systolic arithmetic unit
    Chen, Gang
    Bai, Guoqiang
    Chen, Hongyi
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2007, 54 (05) : 412 - 416
  • [36] Instruction set extension for fast elliptic curve cryptography over binary finite fields GF(2m)
    Grosschädl, J
    Kamendje, GA
    IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2003, : 455 - 468
  • [37] A simple architectural enhancement for fast and flexible elliptic curve cryptography over binary finite fields GF(2m)
    Tillich, S
    Grossschädl, J
    ADVANCES IN COMPUTER SYSTEMS ARCHITECTURE, PROCEEDINGS, 2004, 3189 : 282 - 295
  • [38] TinyECCK:: Efficient elliptic curve cryptography implementation over GF(2m) on 8-bit Micaz mote
    Seo, Seog Chung
    Han, Dong-Guk
    Kim, Hyung Chan
    Hong, Seokhie
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2008, E91D (05) : 1338 - 1347
  • [39] New hardware architecture for multiplication over GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography
    Kwon, Soonhak
    Kwnon, Taekyoung
    Park, Young-Ho
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (01) : 236 - 243
  • [40] Design space exploration of a hardware-software co-designed GF(2m) Galois Field Processor for forward error correction and cryptography
    Lim, WM
    Benaissa, M
    CODES(PLUS)ISSS 2003: FIRST IEEE/ACM/IFIP INTERNATIONAL CONFERENCE ON HARDWARE/SOFTWARE CODESIGN & SYSTEM SYNTHESIS, 2003, : 53 - 58
12345