A Study on the Design of the Efficient Adder and Multiplier Based on Normal Basis over Finite Fields

Chapter
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 235)

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° of αk terms, therefore we decrease k into m − 1 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.

keywords

Normal basis Addition algorithm Multiplication algorithm Adder Multiplier Finite fields modP 

References

  1. 1.
    Green D (1986) Modern logic design. Addison-Wesley Company, LondonGoogle Scholar
  2. 2.
    Hwang K (1979) Computer arithmetic principles, architecture, and design. Wiley, New YorkGoogle Scholar
  3. 3.
    Wu H, Hasan MA, Blake IF, Geo S (2002) Finite field multiplier using redundant representation. IEEE Trans Comput 51(11):1306–1316MathSciNetCrossRefGoogle Scholar
  4. 4.
    Geiselmann W, Steinwandt R (2003) A redundant representation of GF(qn) for designing arithmetic circuit. IEEE Trans Comput 52(7):848–853MATHCrossRefGoogle Scholar
  5. 5.
    Reyhani-Masoleh A, Hsan MA (2003) Fast normal basis multiplication using general purpose processors. IEEE Trans. Comput 52(11):1379–1390Google Scholar
  6. 6.
    Kaihara ME, Takagi N (2005) A hardware algorithm for modular multiplication/division. IEEE Trans Comput 54(1):12–21CrossRefGoogle Scholar
  7. 7.
    Efstathiou C, Vergos HT, Nikolas D (2004) Modified modulo 2n–1 multipliers. IEEE Trans Comput 53(3):370–374CrossRefGoogle Scholar
  8. 8.
    Wu CH, Wu CM, Shieh MD, Hwang YT (2004) High-speed, low-complexity systolic design of novel iterative division algorithms in GF(2m). IEEE Trans Comput 53(3):375–379Google Scholar
  9. 9.
    Artin E (1971) Galois theory. NAPCO Graphics Arts, Inc., WisconsinGoogle Scholar
  10. 10.
    Lidi R, Niederreiter H (1986) Introduction to finite fields and their applications. Cambridge University Press, CambridgeGoogle Scholar
  11. 11.
    Wang CC (1989) An algorithm to design finite field multipliers using a self-dual normal basis. IEEE Trans Comput 38(10):1457–1460Google Scholar
  12. 12.
    Ling C, Lung J (1991) Systolic array implementation of multipliers for finite fields GF(2m). IEEE Trans Circuit Syst 38(7):796–800Google Scholar
  13. 13.
    Fenn STJ, Benaissa M, Taylor D (1996) GF(2m) multiplication and division over dual basis. IEEE Trans Comput 45(3):319–327Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Department of Computer EngineeringThe Korea National University of TransportationChungju-siKorea

Personalised recommendations