Chosen message attack against Mukherjee-Ganguly-Chaudhuri's message authentication scheme*
- Authors
- Lee, Mun-Kyu; Hong, Do Won; Kim, Dong Kyue
- Issue Date
- Nov-2007
- Publisher
- Springer Verlag
- Keywords
- Cellular automata; Chosen message attack; Cryptanalysis; Cryptography; Message authentication scheme
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.4456 LNAI, pp.427 - 434
- Indexed
- SCOPUS
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 4456 LNAI
- Start Page
- 427
- End Page
- 434
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179352
- DOI
- 10.1007/978-3-540-74377-4_45
- ISSN
- 0302-9743
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179352)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.