Multiplier for Public-Key Cryptosystem Based on Cellular Automata
This paper proposes two new multipliers based on cellular automata over finite field. They are implemented with the LSB-first fashion using standard basis representation. Since they have regularity, modularity and concurrency, they are suitable for VLSI implementation and could be used in IC cards. They can be used as a basic architecture for the public-key cryptosystems.
KeywordsCellular Automaton Clock Cycle Finite Field Irreducible Polynomial Linear Feedback Shift Register
Unable to display preview. Download preview PDF.
- 2.Neumann, V.: The theory of self-reproducing automata. Univ. of Illinois Press, Urbana & London (1966)Google Scholar
- 3.Choudhury, P.: 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
- 5.Kim, H.S.: Bit-Serial AOP Arithmetic Architecture for Modular Exponentiation, Ph. D. Thesis, Kyungpook National Univ. (2002)Google Scholar