Chosen Message Attack Against Mukherjee-Ganguly-Chaudhuri's Message Authentication Scheme

Authors:
Mun-Kyu Lee;Dowon Hong;Dong Kyue Kim
Affiliations:
School of Computer Science and Engineering, Inha University, Incheon 402-751, Korea;Electronics and Telecommunications Research Institute, Daejeon 305-350, Korea;Division of Electronics and Computer Engineering, Hanyang University, Seoul 133-791, Korea
Venue:
Computational Intelligence and Security
Year:
2007

Citing 10
Cited 0

Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Theory and Applications of Cellular Automata in Cryptography

IEEE Transactions on Computers
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Comments on "Theory and Applications of Cellular Automata in Cryptography"

IEEE Transactions on Computers
Cellular Automata Based Cryptosystem (CAC)

ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
A Design Principle for Hash Functions

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Keying Hash Functions for Message Authentication

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
A Framework for the Design of One-Way Hash Functions Including Cryptanalysis of Damgård's One-Way Function Based on a Cellular Automaton

ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Cellular Automata Based Authentication (CAA)

ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Cryptanalysis of a new cellular automata cryptosystem

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since Wolfram proposed to use cellular automata as pseudorandom sequence generators, many cryptographic applications using cellular automata have been introduced. One of the recent one is Mukherjee, Ganguly, and Chaudhuri's message authentication scheme using a special class of cellular automata called Single Attractor Cellular Automata (SACA). In this paper, we show that their scheme is vulnerable to a chosen-message attack, i.e., the secret key can be recovered by an attacker using only several chosen message-MAC pairs. The weakness of the scheme results from the regularity of SACA.