Fast GF(2m) Multiplier Architecture Based on Common Factor Post-Processing Method

공통인수 후처리 방식에 기반한 고속 유한체 곱셈기

  • 문상국 (목원대학교 정보전자영상공학부)
  • Published : 2004.10.01


So far, there have been grossly 3 types of studies on GF(2m) multiplier architecture, such as serial multiplication, array multiplication, and hybrid multiplication. Serial multiplication method was first suggested by Mastrovito (1), to be known as the basic CF(2m) multiplication architecture, and this method was adopted in the array multiplier (2), consuming m times as much resource in parallel to extract m times of speed. In 1999, Paar studied further to get the benefit of both architecture, presenting the hybrid multiplication architecture (3). However, the hybrid architecture has defect that only complex ordo. of finite field should be used. In this paper, we propose a novel approach on developing serial multiplier architecture based on Mastrovito's, by modifying the numerical formula of the polynomial-basis serial multiplication. The proposed multiplier architecture was described and implemented in HDL so that the novel architecture was simulated and verified in the level of hardware as well as software. The implemented GF(2m) multiplier shows t times as fast as the traditional one, if we modularized the numerical expression by t number of parts.


  1. E. D. Mastrovito, 'VLSI Architectures for Computations in Galois Fields,' Linkoping Studies in Science and Technology Dissertations, No. 242.. 1991
  2. C. Wang and J. Lin, 'Systolic Array Implementation of Multipliers for Finite Fields GF(2m),' IEEE Transactions on Circuits and Systems, vol. 38, no. 7, pp. 796-800, July 1991
  3. C. Paar, 'Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields,' Ph.D. thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1994
  4. L. Song, 'Low-Power VLSI Architectures for Finite Field Applications,' Ph.D. thesis, UMI Microform 9935004, 1999
  5. D. E. Thomas and Philip Moorby, The Verilog Hardware Description Language, Kluwer Academic Publishers, 1991
  6. Design Compiler Reference Manual Fundamentals, Synopsys, Jan. 1997
  7. Design Compiler Reference Optimization and Timing Synopsys, Jan. 1997
  8. W. Diffie and M. Hellman, 'New directions in cryptography,' IEEE Transactions on Information Theory, pp. 644-654, Nov. 1976
  9. T. Elgamal, 'A Public key cryptosystem and a sugnature schme based on discrete logarithms,' IEEE Transactions on Information Theory, vol. 31, pp. 469-472, 1985
  10. National Institute of Standards and Technology, Digital Signature Standard, FIPS Publication 186-2, Feb. 2000