loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th International Conference on VLSI Design
An ASIC for Cellular Automata Based Message Authentication
Calcutta, India
January 04-January 07
ISBN: 0-7695-0487-6
Prabir Dasgupta, Indian Institute of Technology
Santanu Chattopadhyay, Indian Institute of Technology
Indranil Sengupta, Indian Institute of Technology
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 order, depending on the message length.
Citation:
Prabir Dasgupta, Santanu Chattopadhyay, Indranil Sengupta, "An ASIC for Cellular Automata Based Message Authentication," vlsid, pp.538, 13th International Conference on VLSI Design, 2000
Usage of this product signifies your acceptance of the Terms of Use.