Security analysis of the SCO-family using key schedules

Kitae Jeong, Changhoon Lee, Jongsung Kim, Seokhie Hong

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

The COS-based ciphers SCO-1, SCO-2 and SCO-3 (called the SCO-family) have been designed to improve the security of DDP-based ciphers which are all broken by related-key attacks. In this paper we show that the SCO-family is still vulnerable to related-key attacks: we present related-key differential attacks on a full-round SCO-1, a full-round SCO-2 and an 11-round reduced SCO-3, respectively. The attack on SCO-1 requires 261 related-key chosen ciphertexts and 2120.59 full-round SCO-1 decryptions. For the attack on SCO-2, we require 259 related-key chosen plaintexts and 2118.42 full-round SCO-2 encryptions, and the 11-round attack on SCO-3 works with 258 related-key chosen plaintexts and 2117.54 11-round SCO-3 encryptions. This work is the first known cryptanalytic results on the SCO-family.

Original languageEnglish
Pages (from-to)4232-4242
Number of pages11
JournalInformation Sciences
Volume179
Issue number24
DOIs
Publication statusPublished - 2009 Dec 15

Fingerprint

Security Analysis
Cryptography
Schedule
Attack
Related-key Attack
Encryption
Family
Security analysis

Keywords

  • Block ciphers
  • Cryptanalysis
  • Data dependent operation
  • Related-key differential attack
  • SCO-1
  • SCO-2
  • SCO-3
  • SCO-family

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management

Cite this

Security analysis of the SCO-family using key schedules. / Jeong, Kitae; Lee, Changhoon; Kim, Jongsung; Hong, Seokhie.

In: Information Sciences, Vol. 179, No. 24, 15.12.2009, p. 4232-4242.

Research output: Contribution to journalArticle

Jeong, Kitae ; Lee, Changhoon ; Kim, Jongsung ; Hong, Seokhie. / Security analysis of the SCO-family using key schedules. In: Information Sciences. 2009 ; Vol. 179, No. 24. pp. 4232-4242.
@article{89b2fbfceea94a6581ee9e31950d9853,
title = "Security analysis of the SCO-family using key schedules",
abstract = "The COS-based ciphers SCO-1, SCO-2 and SCO-3 (called the SCO-family) have been designed to improve the security of DDP-based ciphers which are all broken by related-key attacks. In this paper we show that the SCO-family is still vulnerable to related-key attacks: we present related-key differential attacks on a full-round SCO-1, a full-round SCO-2 and an 11-round reduced SCO-3, respectively. The attack on SCO-1 requires 261 related-key chosen ciphertexts and 2120.59 full-round SCO-1 decryptions. For the attack on SCO-2, we require 259 related-key chosen plaintexts and 2118.42 full-round SCO-2 encryptions, and the 11-round attack on SCO-3 works with 258 related-key chosen plaintexts and 2117.54 11-round SCO-3 encryptions. This work is the first known cryptanalytic results on the SCO-family.",
keywords = "Block ciphers, Cryptanalysis, Data dependent operation, Related-key differential attack, SCO-1, SCO-2, SCO-3, SCO-family",
author = "Kitae Jeong and Changhoon Lee and Jongsung Kim and Seokhie Hong",
year = "2009",
month = "12",
day = "15",
doi = "10.1016/j.ins.2009.08.009",
language = "English",
volume = "179",
pages = "4232--4242",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "24",

}

TY - JOUR

T1 - Security analysis of the SCO-family using key schedules

AU - Jeong, Kitae

AU - Lee, Changhoon

AU - Kim, Jongsung

AU - Hong, Seokhie

PY - 2009/12/15

Y1 - 2009/12/15

N2 - The COS-based ciphers SCO-1, SCO-2 and SCO-3 (called the SCO-family) have been designed to improve the security of DDP-based ciphers which are all broken by related-key attacks. In this paper we show that the SCO-family is still vulnerable to related-key attacks: we present related-key differential attacks on a full-round SCO-1, a full-round SCO-2 and an 11-round reduced SCO-3, respectively. The attack on SCO-1 requires 261 related-key chosen ciphertexts and 2120.59 full-round SCO-1 decryptions. For the attack on SCO-2, we require 259 related-key chosen plaintexts and 2118.42 full-round SCO-2 encryptions, and the 11-round attack on SCO-3 works with 258 related-key chosen plaintexts and 2117.54 11-round SCO-3 encryptions. This work is the first known cryptanalytic results on the SCO-family.

AB - The COS-based ciphers SCO-1, SCO-2 and SCO-3 (called the SCO-family) have been designed to improve the security of DDP-based ciphers which are all broken by related-key attacks. In this paper we show that the SCO-family is still vulnerable to related-key attacks: we present related-key differential attacks on a full-round SCO-1, a full-round SCO-2 and an 11-round reduced SCO-3, respectively. The attack on SCO-1 requires 261 related-key chosen ciphertexts and 2120.59 full-round SCO-1 decryptions. For the attack on SCO-2, we require 259 related-key chosen plaintexts and 2118.42 full-round SCO-2 encryptions, and the 11-round attack on SCO-3 works with 258 related-key chosen plaintexts and 2117.54 11-round SCO-3 encryptions. This work is the first known cryptanalytic results on the SCO-family.

KW - Block ciphers

KW - Cryptanalysis

KW - Data dependent operation

KW - Related-key differential attack

KW - SCO-1

KW - SCO-2

KW - SCO-3

KW - SCO-family

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

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

U2 - 10.1016/j.ins.2009.08.009

DO - 10.1016/j.ins.2009.08.009

M3 - Article

AN - SCOPUS:70349731915

VL - 179

SP - 4232

EP - 4242

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 24

ER -