Browse > Article

3X Serial GF($2^m$) Multiplier Architecture on Polynomial Basis Finite Field  

Moon, Sang-Ook (목원대학교 정보전자영상공학부)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.10, no.2, 2006 , pp. 328-332 More about this Journal
Abstract
Efficient finite field operation in the elliptic curve (EC) public key cryptography algorithm, which attracts much of latest issues in the applications in information security, is very important. Traditional serial finite multipliers root from Mastrovito's serial multiplication architecture. In this paper, we adopt the polynomial basis and propose a new finite field multiplier, inducing numerical expressions which can be applied to exhibit 3 times as much performance as the Mastrovito's. We described the proposed multiplier with HDL to verify and evaluate as a proper hardware IP. HDL-implemented serial GF (Galois field) multiplier showed 3 times as fast speed as the traditional serial multiplier's adding only partial-sum block in the hardware. So far, there have been grossly 3 types of studies on GF($2^m$) multiplier architecture, such as serial multiplication, array multiplication, and hybrid multiplication. 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.
Keywords
HDL;
Citations & Related Records
연도 인용수 순위
  • Reference
1 문상국, '타원곡선 암호용 프로세서를 위한 고속 VLSI 알고리즘의 연구와 구현', 연세대학교 대학원 박사학위 논문집, 2002
2 L. Song, 'Low-Power VLSI Architectures for Finite Field Applications,' Ph.D. thesis, UMl Microform 9935004, 1999
3 D. E. Thomasand Philip Moorby, The Verilog Hardware Description Language, Kluwer Academic Publishers, 1991
4 Design Compiler Reference Manual Fund- amentals, Synopsys, Jan. 1997
5 C. Wang and J. Lin, 'Systolic Array Implementation of Multipliers for Finite FieldsGF($2^{m}$),' IEEE Transactions on Circuits and Systems, vol. 38, no. 7, pp. 796-800, July 1991   DOI   ScienceOn
6 C. Paar, 'Efficient VLSI Architectures for Bit-Parallel Computation in GaloisFields,' Ph.D.thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1994
7 Design Compiler Reference Manual Optimization and Timing Analysis, Synopsys, Jan. 1997
8 T. Elgarnal, 'A Publickey cryptosystem and a sugnature schmebasedon discrete logarithms,' IEEE Transactions on Information Theory, vol. 31, pp. 469-472,1985   DOI
9 E.D.Mastrovito, 'VLS IArchitectures for Computations in Galois Fields,' Linkoping Studies in Science and Technology Dissertations, No. 242,1991
10 W. Diffie and M. Hellman, 'New directions in cryptography,' IEEE Transactions on Information Theory, pp. 644-654, Nov. 1976