Security Analysis of the Full-Round CHESS-64 Cipher Suitable for Pervasive Computing Environments
- Authors
- Lee, Changhoon; Kim, Jongsung; Hong, Seokhie; Lee, Yang-Sun
- Issue Date
- 2009
- Publisher
- GRAZ UNIV TECHNOLGOY, INST INFORMATION SYSTEMS COMPUTER MEDIA-IICM
- Keywords
- Block Cipher; CHESS-64; Data-Dependent Permutation; Data-Dependent Operation; Differential Cryptanalysis; Related-Key Attack
- Citation
- JOURNAL OF UNIVERSAL COMPUTER SCIENCE, v.15, no.5, pp.1007 - 1022
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF UNIVERSAL COMPUTER SCIENCE
- Volume
- 15
- Number
- 5
- Start Page
- 1007
- End Page
- 1022
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/122105
- ISSN
- 0948-695X
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.