Security analysis of the full-round CHESS-64 cipher suitable for pervasive computing environments

Changhoon Lee, Jongsung Kim, Seokhie Hong, Yang Sun Lee

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)1007-1022
Number of pages16
JournalJournal of Universal Computer Science
Volume15
Issue number5
Publication statusPublished - 2009

Keywords

  • Block cipher
  • CHESS-64
  • Data-dependent operation
  • Data-dependent permutation
  • Differential cryptanalysis
  • Related-key attack

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Security analysis of the full-round CHESS-64 cipher suitable for pervasive computing environments'. Together they form a unique fingerprint.

Cite this