Cellular Automata Based Multiplier for Public-Key Cryptosystem

  • Hyun-Sung Kim
  • Kee-Young Yoo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2802)


This paper proposes two new multipliers based on cellular automata over finite field. Finite fields arithmetic operations have been widely used in the areas of data communication and network security applications. First, a multiplier with generalized irreducible polynomial is implemented with MSB-first fashion. Then, new algorithm and architecture are proposed to reduce the size of the first multiplier. The algorithm and architecture uses the property of irreducible all one polynomial as a modulus. Since the proposed architectures have regularity, modularity and concurrency, they are suitable for VLSI implementation and could be used in IC cards because they have particularly simple architecture. They can be used as a basic architecture for the public-key cryptosystems.


Cellular Automaton Cellular Automaton Irreducible Polynomial Modular Multiplication Linear Feedback Shift Regis 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Reed, I.S., Truong, T.K.: The use of finite fields to compute convolutions. IEEE Trans. on Information Theory IT-21, 208–213 (1975)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Schneier, B.: Applied Cryptography, 2nd edn. John Wiley and Sons, Inc., Chichester (1996)Google Scholar
  3. 3.
    Neumann, V.: The theory of self-reproducing automata. Univ. of Illinois Press, Urbana (1966)Google Scholar
  4. 4.
    Wolfram, S.: Statistical mechanics of cellular automata. Rev. of Modern Physics. 55, 601–644 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Pries, W., Thanailakis, A., Card, H.C.: Group properties of cellular automata and VLSI applications. IEEE Trans. on Computers. C-35(12), 1013–1024 (1986)CrossRefGoogle Scholar
  6. 6.
    Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1986)Google Scholar
  7. 7.
    Yeh, C.S., Reed, S., Truong, T.K.: Systolic multipliers for finite fields GF(2m). IEEE Trans. on Computers. C-33, 357–360 (1984)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Jain, S.K., Song, L.: Efficient Semisystolic Architectures for finite field Arithmetic. IEEE Trans. on VLSI Systems. 6(1), 101–113 (1998)CrossRefGoogle Scholar
  9. 9.
    Massey, J.L., Omura, J.K.: Computational method and apparatus for finite field arithmetic. U. S. Patent application (1981) (submitted)Google Scholar
  10. 10.
    Wei, S.W.: A systolic power-sum circuit for GF(2m). IEEE Trans. on Computers 43, 226–229 (1994)CrossRefGoogle Scholar
  11. 11.
    Itoh, T., Tsujii, S.: Structure of parallel multipliers for a class of finite fields GF(2m). Info. Comp. 83, 21–40 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Fenn, S.T.J., Parker, M.G., Benaissa, M., Taylor, D.: Bit-serial Multiplication in GF(2m) using irreducible all one polynomials. In: IEE. Proc. Comput. Digit. Tech., vol. 144(6) (November 1997)Google Scholar
  13. 13.
    Kim, H.S.: Serial AOP Arithmetic Architecture for Modular Exponentiation. Ph. D. Thesis, Kyungpook National Univ. (2002)Google Scholar
  14. 14.
    Pal, P., Barua, R.: Cellular Automata Based VLSI Architecture for Computing Multiplication and Inverses in GF(2m). In: IEEE 7th International Conference on VLSI Design (January 1994)Google Scholar
  15. 15.
    Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1998)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Hyun-Sung Kim
    • 1
  • Kee-Young Yoo
    • 2
  1. 1.Computer EngineeringKyungil UniversityKyungsansi, Kyungpook ProvinceKorea
  2. 2.Computer EngineeringKyungpook National UniversityDaeguKorea

Personalised recommendations