Advertisement

Low Complexity Systolic Architecture for Modular Multiplication over GF(2m)

  • Hyun-Sung Kim
  • Sung-Woon Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3991)

Abstract

The modular multiplication is known as an efficient basic operation for public key cryptosystems over GF(2 m ). Various systolic architectures for performing the modular multiplication have already been proposed based on a standard basis representation. However, they have high hardware complexity and long latency. Thereby, this paper presents a new algorithm and architecture for the modular multiplication in GF(2 m ). First, a new algorithm is proposed based on the LSB-first scheme using a standard basis representation. Then, bit serial systolic multiplier is derived with a low hardware complexity and small latency. Since the proposed architecture incorporates simplicity, regularity, and modularity, it is well suited to VLSI implementation and can be easily applied to modular exponentiation architecture. Furthermore, the architecture will be utilized for the basic architecture of crypto-processor.

Keywords

Systolic Array Hardware Complexity Modular Multiplication VLSI Implementation Primitive Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Peterson, W.W., Weldon, E.J.: Error-correcting codes. MIT Press, MA (1972)MATHGoogle Scholar
  2. 2.
    Denning, D.E.R.: Cryptography and data security. Addison-Wesley, MA (1983)Google Scholar
  3. 3.
    Menezes, A.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston (1993)MATHGoogle Scholar
  4. 4.
    Reed, I.S., Truong, T.K.: The use of finite fields to compute convolutions. IEEE Trans. Inform. Theory 21, 208–213 (1975)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Kim, H.S.: Bit-Serial AOP Arithmetic Architecture for Modular Exponentiation, PhD. The-sis, Kyungpook National University (2002)Google Scholar
  6. 6.
    Wei, S.W.: VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2m). IEEE Trans. Circuits and Systems 44, 847–855 (1997)Google Scholar
  7. 7.
    Yeh, C.S., Reed, S., Truong, T.K.: Systolic multipliers for finite fields GF(2m). IEEE Trans. Comput. C-33, 357–360 (1984)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Wang, C.L., Lin, J.L.: Systolic Array Implementation of Multipliers for Finite Fields GF(2m). IEEE Trans. Circuits and Systems 38, 796–800 (1991)CrossRefGoogle Scholar
  9. 9.
    Jain, S.K., Song, L.: Efficient Semisystolic Architectures for finite field Arithmetic. IEEE Trans. on VLSI Systems 6(1) (March 1998)Google Scholar
  10. 10.
    Wu, C.W., Chang, M.K.: Bit-Level Systolic Arrays for Finite-Field Multiplications. Journal of VLSI Signal Processing 10, 85–92 (1995)CrossRefGoogle Scholar
  11. 11.
    Kung, S.Y.: VLSI Array Processors. Prentice-Hall, Englewood Cliffs (1987)Google Scholar
  12. 12.
    Yoo, K.Y.: A Systolic Array Design Methodology for Sequential Loop Algorithms, PhD. thesis, Rensselaer Polytechnic Institute, New York (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hyun-Sung Kim
    • 1
  • Sung-Woon Lee
    • 2
  1. 1.School of Computer EngineeringKyungil UniversityKyungsansiKorea
  2. 2.Dept. of Information SecurityTongmyong UniversityBusanKorea

Personalised recommendations