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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Lee, M. K., Hong, D. W., & Kim, D. K. (2007). Chosen message attack against Mukherjee-Ganguly-Chaudhuri’s message authentication scheme*. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4456 LNAI, pp. 427–434). Springer Verlag. https://doi.org/10.1007/978-3-540-74377-4_45
Mendeley helps you to discover research relevant for your work.