Cellular Automata Based Multiplier for Public-Key Cryptosystem
- 694 Downloads
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.
KeywordsCellular Automaton Cellular Automaton Irreducible Polynomial Modular Multiplication Linear Feedback Shift Regis
Unable to display preview. Download preview PDF.
- 2.Schneier, B.: Applied Cryptography, 2nd edn. John Wiley and Sons, Inc., Chichester (1996)Google Scholar
- 3.Neumann, V.: The theory of self-reproducing automata. Univ. of Illinois Press, Urbana (1966)Google Scholar
- 6.Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1986)Google Scholar
- 9.Massey, J.L., Omura, J.K.: Computational method and apparatus for finite field arithmetic. U. S. Patent application (1981) (submitted)Google Scholar
- 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.Kim, H.S.: Serial AOP Arithmetic Architecture for Modular Exponentiation. Ph. D. Thesis, Kyungpook National Univ. (2002)Google Scholar
- 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