Subword parallel GF(2m) ALU:: An implementation for a cryptographic processor

被引:2
|
作者
Lim, WM [1 ]
Benaissa, M [1 ]
机构
[1] Univ Sheffield, Dept Elect & Elect Engn, Sheffield S1 3JD, S Yorkshire, England
关键词
D O I
10.1109/SIPS.2003.1235645
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper describes a subword parallel ALU for applications which require operations over GF(2(m)) and an implementation in the domain of cryptography. It has a reconfigurable datapath that allows it to operate in either a Single Instruction Multiple Data mode (SIMD, p GF(2(r)) operations r less than or equal to q) or a Single Instruction Single Data mode (SISD, one GF(2(r)) operation, where q < r less than or equal to m, m = p.q). The dual mode of the ALU allows efficient programming of Rijndael AES and Elliptic Curve Cryptography (ECC) (both of which use GF(2(m)) arithmetic, but have a large data size mismatch) on the same processor. This means better resource utilization of the processor which is doubly important for area constrained implementations. An FPGA prototype of the processor has been built and tested successfully for AES and elliptic curve operations.
引用
收藏
页码:63 / 68
页数:6
相关论文
共 50 条
  • [1] A cryptographic processor for arbitrary elliptic curves over GF(2m)
    Eberle, H
    Gura, N
    Chang-Shantz, S
    IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2003, : 444 - 454
  • [2] Flexible GF(2m) arithmetic architectures for subword parallel processing ASIPs
    Lim, W. M.
    Benaissa, M.
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2006, 153 (05): : 291 - 301
  • [3] Efficient FPGA Elliptic Curve Cryptographic Processor over GF(2m)
    Antao, Samuel
    Chaves, Ricardo
    Sousa, Leonel
    PROCEEDINGS OF THE 2008 INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY, 2008, : 357 - 360
  • [4] VLSI algorithms, architectures, and implementation of a versatile GF(2m) processor
    Hasan, MA
    Wassal, AG
    IEEE TRANSACTIONS ON COMPUTERS, 2000, 49 (10) : 1064 - 1073
  • [5] Implementation of elliptic curve cryptographic coprocessor over GF(2m) on an FPGA
    Okada, S
    Torii, N
    Itoh, K
    Takenaka, M
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS-CHES 2000, PROCEEDINGS, 2001, 1965 : 25 - 40
  • [6] Easily testable implementation for bit parallel multipliers in GF (2m)
    Rahaman, H.
    Mathew, J.
    Jabir, A. M.
    Pradhan, D. K.
    HLDVT'06: ELEVENTH ANNUAL IEEE INTERNATIONAL HIGH-LEVEL DESIGN VALIDATION AND TEST WORKSHOP, PROCEEDINGS, 2006, : 48 - +
  • [7] Reconfigurable implementation of GF(2m) bit-parallel multipliers
    Imana, Jose L.
    PROCEEDINGS OF THE 2018 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2018, : 893 - 896
  • [8] Flexible GF(2m) Divider Design for Cryptographic Applications
    Lin, Wen-Ching
    Shieh, Ming-Der
    Wu, Chien-Ming
    ISCAS: 2009 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-5, 2009, : 25 - +
  • [9] High Speed Bit-Parallel Systolic Multiplier over GF (2m) for Cryptographic Application
    Sargunam, B.
    Mozhi, S. Arul
    Dhanasekaran, R.
    2012 IEEE INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES (ICACCCT), 2012, : 244 - 247
  • [10] FPGA Implementation of Low Latency Scalable Elliptic Curve Cryptosystem Processor in GF(2m)
    Loi, K. C. Cinnati
    An, Sen
    Ko, Seok-Bum
    2014 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2014, : 822 - 825