An ASIC for cellular automata based message authentication
P. Dasgupta, Sumit K. Chattopadhyay, Indranil Sengupta · 2002
An ASIC based on cellular automata (CA) for data-authentication has been proposed in this paper. The scheme is designed from the analytical study of the state transition behavior of non-group cellular automata, and is significantly different from conventional approaches. Experimental studies confirm the superiority in terms of CPU time (50% reduction) of the software implementation of the proposed scheme compared to standard MD-5 algorithm, the most commonly used method. Regular, modular, and cascadable structure of cellular automata with local interconnections makes the scheme ideally suitable for VLSI implementation. The CA based hardware can achieve further speed improvement approximately by at least three orders, depending on the message length.