Browse > Article
http://dx.doi.org/10.6109/jicce.2011.9.4.435

An Arithmetic System over Finite Fields  

Park, Chun-Myoung (Department of Computer Engineering, Chungju National University)
Abstract
This paper propose the method of constructing the highly efficiency adder and multiplier systems over finite fields. The addition arithmetic operation over finite field is simple comparatively because that addition arithmetic operation is analyzed by each digit modP summation independently. But in case of multiplication arithmetic operation, we generate maximum k=2m-2 degree of ${\alpha}^k$ terms, therefore we decrease k into m-1 degree using irreducible primitive polynomial. We propose two method of control signal generation for the purpose of performing above decrease process. One method is the combinational logic expression and the other method is universal signal generation. The proposed method of constructing the highly adder/multiplier systems is as following. First of all, we obtain algorithms for addition and multiplication arithmetic operation based on the mathematical properties over finite fields, next we construct basic cell of A-cell and M-cell using T-gate and modP cyclic gate. Finally we construct adder module and multiplier module over finite fields after synthesizing ${\alpha}^k$ generation module and control signal CSt generation module with A-cell and M-cell. Next, we constructing the arithmetic operation unit over finite fields. Then, we propose the future research and prospects.
Keywords
arithmetic operation; finite field; polynomial; control signal; cell; module; adder; multiplieretc;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M.E. Kaihara and N. Takagi, "A Hardware Algorithm for Modular Multiplication/Division", IEEE Trans. Comput., vol.54, no.1, pp.12-21, January 2005.   DOI   ScienceOn
2 C. Efstathiou, H.T. Vergos and D. Nikolas. "Modified Modulo $2^{n}$-1 Multipliers", IEEE Trans. Comput., vol.53, no.3, pp.370-374, March 2004.   DOI   ScienceOn
3 C.H. Wu, C.M. Wu, M.D. shieh and Y.T. Hwang, "High-Speed, Low-Complexity systolic Design of Novel Iterative Division Algorithms in GF($2^{m}$)", IEEE Trans. Comput., vol.53, no.3, pp.375-379, March 2004.   DOI   ScienceOn
4 E. Artin, Galois Theory, NAPCO Graphics arts, Inc., Wisconsin. 1971.
5 R. Lidi and H. Niederreiter, Introduction to finite fields and their applications, Cambridge University Press, 1986.
6 C.C. Wang," an algorithm to design finite field multipliers using a self-dual normal basis", IEEE Trans. Comput., vol.3, no.10, pp.1457-1460, Oct. 1989.
7 C. Ling and J. Lung," Systolic array implementation of multipliers for finite fields GF($2^{m}$)", IEEE Trans. Cir. & Sys., vol.38, no.7, pp.796-800, Jul. 1991.   DOI   ScienceOn
8 S.T.J.Fenn, M.Benaissa and D.Taylor," GF($2^{m}$) multiplication and Division over dual basis", IEEE Trans. Comput., vol.45, no.3, pp.319-327, Mar. 1996.   DOI   ScienceOn
9 K. Hwang, Computer Arithmetic principles, architecture, and design, john Wiley & Sons, 1979.
10 D. Green, Modern Logic Design, Addison-Wesley company, 1986.
11 H. Wu, M.A. Hasan, I.F. Blake and S. Geo, "Finite Field Multiplier Using Redundant Representation", IEEE Trans. Comput., vol.51, no.11, pp. 1306-13 16, December 2002.   DOI   ScienceOn
12 W. Geiselmann and R. Steinwandt, "A Redundant Representation of GF($q^{n}$) for designing Arithmetic Circuit", IEEE Trans. Comput., vol.52, no.7, pp.848-853, July 2003.   DOI   ScienceOn
13 A. Reyhani-Masoleh and M.A. Hsan, "Fast Normal basis Multiplication Using general Purpose Processors," IEEE Trans. Comput., vol.52, no. 11, pp.1379-1390, November 2003.   DOI   ScienceOn