Security Analysis of the Full-Round CHESS-64 Cipher Suitable for Pervasive Computing Environments

  • Lee, Changhoon
  • Kim, Jongsung
  • Hong, Seokhie
  • Lee, Yang-Sun
Citations

WEB OF SCIENCE

2
Citations

SCOPUS

2

초록

Wireless networks, telecommunications, and information technologies connected devices 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 for such 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 attack requires about 2(44) data and 2(44) time complexities (recovering 20 bits of the master key) while the second attack needs about 2(39) data and 2(39) time complexities (recovering 6 bits of the master key). These works are the first known cryptanalytic results on CHESS-64 so far.

키워드

Block CipherCHESS-64Data-Dependent PermutationData-Dependent OperationDifferential CryptanalysisRelated-Key AttackKEYATTACKSCRYPTANALYSISENCRYPTIONSPECTR-H64
제목
Security Analysis of the Full-Round CHESS-64 Cipher Suitable for Pervasive Computing Environments
저자
Lee, ChanghoonKim, JongsungHong, SeokhieLee, Yang-Sun
발행일
2009
유형
Article
저널명
Journal of Universal Computer Science
15
5
페이지
1007 ~ 1022