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 journalArticle

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 Jul 17

Fingerprint

Pervasive Computing
Security Analysis
Ubiquitous computing
Attack
Time Complexity
Cryptography
Information technology
Telecommunication
Wireless networks
Information Technology
Telecommunications
Encryption
Privacy
Wireless Networks
High Speed

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Security analysis of the full-round CHESS-64 cipher suitable for pervasive computing environments. / Lee, Changhoon; Kim, Jongsung; Hong, Seokhie; Lee, Yang Sun.

In: Journal of Universal Computer Science, Vol. 15, No. 5, 17.07.2009, p. 1007-1022.

Research output: Contribution to journalArticle

@article{79cb7e35670446ec8c0e0994f1f0d172,
title = "Security analysis of the full-round CHESS-64 cipher suitable for pervasive computing environments",
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.",
keywords = "Block cipher, CHESS-64, Data-dependent operation, Data-dependent permutation, Differential cryptanalysis, Related-key attack",
author = "Changhoon Lee and Jongsung Kim and Seokhie Hong and Lee, {Yang Sun}",
year = "2009",
month = "7",
day = "17",
language = "English",
volume = "15",
pages = "1007--1022",
journal = "Journal of Universal Computer Science",
issn = "0948-6968",
publisher = "Springer Verlag",
number = "5",

}

TY - JOUR

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

AU - Lee, Changhoon

AU - Kim, Jongsung

AU - Hong, Seokhie

AU - Lee, Yang Sun

PY - 2009/7/17

Y1 - 2009/7/17

N2 - 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.

AB - 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.

KW - Block cipher

KW - CHESS-64

KW - Data-dependent operation

KW - Data-dependent permutation

KW - Differential cryptanalysis

KW - Related-key attack

UR - http://www.scopus.com/inward/record.url?scp=67650298977&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67650298977&partnerID=8YFLogxK

M3 - Article

VL - 15

SP - 1007

EP - 1022

JO - Journal of Universal Computer Science

JF - Journal of Universal Computer Science

SN - 0948-6968

IS - 5

ER -