JUCS - Journal of Universal Computer Science 15(5): 1007-1022, doi: 10.3217/jucs-015-05-1007
Security Analysis of the Full-Round CHESS-64 Cipher Suitable for Pervasive Computing Environments
expand article infoChanghoon Lee, Jongsung Kim§, Seokhie Hong§, Yang-Sun Lee|
‡ Hanshin University, Osan, Republic of Korea§ Korea University, Seoul, Republic of Korea| FUMATE Co., Daejeon, Republic of Korea
Open Access
Wireless networks, telecommunications, and information technologies connected de-vices in pervasive computing environments require a high speed encryption for providing a high security and a privacy. The CHESS-64 based on various controlled operations is designed forsuch applications. In this paper, however, we show that CHESS-64 doesn't have a high security level, more precisely, we present two related-key differential attacks on CHESS-64. The first at-tack requires about 244 data and 244 time complexities (recovering 20 bits of the master key)while the second attack needs about 239 data and 239 time complexities (recovering 6 bits of themaster key). These works are the first known cryptanalytic results on CHESS-64 so far.
Block Cipher, CHESS-64, Data-Dependent Permutation, Data-Dependent Operation, Differential Cryptanalysis, Related-Key Attack