Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192

Seokhie Hong, Jongsung Kim, Sangjin Lee, Bart Preneel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

44 Citations (Scopus)

Abstract

In this paper we propose a notion of related-key rectangle attack using 4 related keys. It is based on two consecutive related-key differentials which are independent of each other. Using this attack we can break SHACAL-1 with 512-bit keys up to 70 rounds out of 80 rounds and AES with 192-bit keys up to 8 rounds out of 12 rounds, which are faster than exhaustive search.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsH. Gilbert, H. Handschuh
Pages368-383
Number of pages16
Volume3557
Publication statusPublished - 2005
Event12th International Workshop on Fast Software Encryption. FSE 2005 - Paris, France
Duration: 2005 Feb 212005 Feb 23

Other

Other12th International Workshop on Fast Software Encryption. FSE 2005
CountryFrance
CityParis
Period05/2/2105/2/23

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Hong, S., Kim, J., Lee, S., & Preneel, B. (2005). Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192. In H. Gilbert, & H. Handschuh (Eds.), Lecture Notes in Computer Science (Vol. 3557, pp. 368-383)

Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192. / Hong, Seokhie; Kim, Jongsung; Lee, Sangjin; Preneel, Bart.

Lecture Notes in Computer Science. ed. / H. Gilbert; H. Handschuh. Vol. 3557 2005. p. 368-383.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hong, S, Kim, J, Lee, S & Preneel, B 2005, Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192. in H Gilbert & H Handschuh (eds), Lecture Notes in Computer Science. vol. 3557, pp. 368-383, 12th International Workshop on Fast Software Encryption. FSE 2005, Paris, France, 05/2/21.
Hong S, Kim J, Lee S, Preneel B. Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192. In Gilbert H, Handschuh H, editors, Lecture Notes in Computer Science. Vol. 3557. 2005. p. 368-383
Hong, Seokhie ; Kim, Jongsung ; Lee, Sangjin ; Preneel, Bart. / Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192. Lecture Notes in Computer Science. editor / H. Gilbert ; H. Handschuh. Vol. 3557 2005. pp. 368-383
@inproceedings{6b2c3c5e17b44953913338748ecd659f,
title = "Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192",
abstract = "In this paper we propose a notion of related-key rectangle attack using 4 related keys. It is based on two consecutive related-key differentials which are independent of each other. Using this attack we can break SHACAL-1 with 512-bit keys up to 70 rounds out of 80 rounds and AES with 192-bit keys up to 8 rounds out of 12 rounds, which are faster than exhaustive search.",
author = "Seokhie Hong and Jongsung Kim and Sangjin Lee and Bart Preneel",
year = "2005",
language = "English",
volume = "3557",
pages = "368--383",
editor = "H. Gilbert and H. Handschuh",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192

AU - Hong, Seokhie

AU - Kim, Jongsung

AU - Lee, Sangjin

AU - Preneel, Bart

PY - 2005

Y1 - 2005

N2 - In this paper we propose a notion of related-key rectangle attack using 4 related keys. It is based on two consecutive related-key differentials which are independent of each other. Using this attack we can break SHACAL-1 with 512-bit keys up to 70 rounds out of 80 rounds and AES with 192-bit keys up to 8 rounds out of 12 rounds, which are faster than exhaustive search.

AB - In this paper we propose a notion of related-key rectangle attack using 4 related keys. It is based on two consecutive related-key differentials which are independent of each other. Using this attack we can break SHACAL-1 with 512-bit keys up to 70 rounds out of 80 rounds and AES with 192-bit keys up to 8 rounds out of 12 rounds, which are faster than exhaustive search.

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

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

M3 - Conference contribution

AN - SCOPUS:26444515034

VL - 3557

SP - 368

EP - 383

BT - Lecture Notes in Computer Science

A2 - Gilbert, H.

A2 - Handschuh, H.

ER -