Abstract
Current demands for secured communication have focussed intensive interest on ‘Authentication’. There is a great demand for a highspeed low cost scheme for generation of Message Authentication Code (MAC). This paper introduces a new computational model built around a special class of Cellular Automata (CA) that can be employed for both message and image authentication. Cryptanalysis of the proposed scheme indicates that compared to other known schemes like MD5, SHA1 etc., the current scheme is more secure against all known attacks. High speed execution of the proposed scheme makes it ideally suitable for real time on-line applications. Further, the regular, modular, and cascadable structure of CA with local interconnections makes the scheme ideally suitable for VLSI implementation with throughput in the range of Gigabits per second.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Schineier Applied Cryptography tJohn Wiley and Sons, 2001.
P. Pal Chaudhuri, D. Roy Choudhury, S. Nandi and S. Chattopadhyay Additive Cellular Automata Theory and Applications. IEEE Computer Society Press, California, USA, 1997.
S. Wolfram Cryptography with Cellular Automata Proceedings of Crypto’85, pp. 429–432
S. Wolfram Cellular Automata and Complexity Addition-Wesly Publishing Company, 1994
T. R. N. Rao and E. Fujiwara Error-control Coding for Computer Systems Prentice-Hall, Englewood Cliffs, N.J, 1989
M. Holliman and N. Memon Counterfeiting Attacks on Oblivious Block-wise Independent Invisible Watermarking Schemes IEEE trans. on Image Processing, volume-9, No-3, March, 2000
M. Mukherjee, B.K.S. N. Ganguly and P. Pal Chaudhuri GF(2p) Cellular Automata As A Message Digest Generator 9 th International Conference on Advance Computing and Communications, December-2001
K Paul, D. Roy Chowdhury, P. Pal Chaudhuri Theory of Extended Linear Machine, to be published in IEEE, Transaction on Computers.
P. Dasgupta, S. Chattopadhyay and I. Sengupta An ASIC for Cellular Automata based message Authentication 12 th Int. Conf. on VLSI Design, 1999
D. Wagner Differential cryptanalysis of KHF 5th Int. Workshop on Fast Software Encryption, 1998
B. Preneel and P. van Oorschot MD-x MAC and building fast MACs from hash functions CRYPTO 95 Proceedings, Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.
E. Biham and A. Shamir Differential Cryptanalysis of DES-like Cryptosystems Journal of Cryptology, 4(1991), 3–72
J. Fridrich Security of Fragile Authentication Watermarks with Localization Proc. of SPIE Photonic West, Electro Imaging 2002, Security and Watermarking of Multimedia Contents, January-2002
P. W. Wong and N. Memon Secret and Public Key Image Watermarking Schemes for Image Authentication and ownership verification IEEE trans. on Image Processing, volume-10, No-10, October, 2001
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mukherjee, M., Ganguly, N., Chaudhuri, P.P. (2002). Cellular Automata Based Authentication (CAA). In: Bandini, S., Chopard, B., Tomassini, M. (eds) Cellular Automata. ACRI 2002. Lecture Notes in Computer Science, vol 2493. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45830-1_25
Download citation
DOI: https://doi.org/10.1007/3-540-45830-1_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44304-9
Online ISBN: 978-3-540-45830-2
eBook Packages: Springer Book Archive