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.