Journal of information and communication convergence engineering

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

A Study on Constructing the Inverse Element Generator over GF(3m)

  • Park, Chun-Myoung (Department of Computer Engineering, Chungju National University)
  • Received : 2010.05.14
  • Accepted : 2010.05.31
  • Published : 2010.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents an algorithm generating inverse element over finite fields GF($3^m$), and constructing method of inverse element generator based on inverse element generating algorithm. An inverse computing method of an element over GF($3^m$) which corresponds to a polynomial over GF($3^m$) with order less than equal to m-1. Here, the computation is based on multiplication, square and cube method derived from the mathematics properties over finite fields.

Keywords

References

  1. D.L.Dietmeyer, Logic Design of Digital Systems, Allyn and Bacon, 1979.
  2. K. Hwang, Comptuer Arithmetic principles, architecture, and design, John Wiley & Sons,1979
  3. M.D.Ercegovac and T.Lang, Digital Systems and Hardware Firmware Algorithms, Wiley, 1985.
  4. E.J.McClusky, Logic Design Principles, Prentice-Hall, 1986.
  5. D.Green, Modern Logic Design, Electronic Systems Engineer-ing Series, 1986.
  6. Chen; Wen-Ching Lin; Hao-Hsuan Wu,"A New Algorithm for High-Speed Modular Multiplication Design," IEEE Trans. On Circuit and Systems, VOLUME 56, issue 9, pp. 2009-2019. Sep., 2009. https://doi.org/10.1109/TCSI.2008.2011585
  7. Nibouche, O.; Boussakta, S.; Darnell, M.," Pipeline Architectures for Radix-2 New Mersenne Number Transform," IEEE Trans. On Circuit and Systems, VOLUME 56, issue 8, pp. 1668-1680, Aug., 2009. https://doi.org/10.1109/TCSI.2008.2008266
  8. Meher, P.K.," Systolic and Super-Systolic Multipliers for Finite Field GF$(2^{m})$Based on Irreducible Trinomials, IEEE Trans. On Circuit and Systems, VOLUME 55, issue 4, pp. 1031-1040, Apr. 2008. https://doi.org/10.1109/TCSI.2008.916622
  9. Tung-Chou Chen; Shyue-Win Wei; Hung-Jen Tsai," Arithmetic Unit for Finite Field $GF(2^{m})$, IEEE Trans. On Circuit and Systems, VOLUME 55, issue 3, pp. 828-837, Mar., 2008.
  10. Conway, T.," Galois field arithmetic over $GF(p^{m})$ for highspeed/ low-power error-control applications," IEEE Trans. On Circuit and Systems, VOLUME 51, issue 4, pp. 709- 717, Apr., 2004. https://doi.org/10.1109/TCSI.2004.823659
  11. G.Drolet,"A new representation of elements of finite fields $GF(2^{m})$ yields small complexity arithmetic circuits,' IEEE Trans. Comput.,vol.47.no.9,pp.938-946,Sep.1998. https://doi.org/10.1109/12.713313
  12. R.J.McEliece, Finite Fields for Computer Science and Engineers, Kluer Academic Publishers, 1987.