상세 보기
Chosen message attack against Mukherjee-Ganguly-Chaudhuri's message authentication scheme*
- Lee, Mun-Kyu;
- Hong, Do Won;
- Kim, Dong Kyue
Citations
SCOPUS
0초록
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.
키워드
Cellular automata; Chosen message attack; Cryptanalysis; Cryptography; Message authentication scheme; Cellular automata; Computer crime; Computer science; Cryptography; Message passing; Chosen message attack; Message authentication scheme; Pseudorandom sequence generators; Single Attractor Cellular Automata (SACA); Data privacy
- 제목
- Chosen message attack against Mukherjee-Ganguly-Chaudhuri's message authentication scheme*
- 저자
- Lee, Mun-Kyu; Hong, Do Won; Kim, Dong Kyue
- 발행일
- 2007-11
- 유형
- Conference Paper
- 권
- 4456 LNAI
- 페이지
- 427 ~ 434