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

Seokhie Hong; Jongsung Kim; Sangjin Lee; Bart Preneel

doi:10.1007/11502760_25

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

Seokhie Hong, Jongsung Kim, Sangjin Lee, Bart Preneel

School of Cybersecurity

Research output: Contribution to journal › Conference article › peer-review

63 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 language	English
Pages (from-to)	368-383
Number of pages	16
Journal	Lecture Notes in Computer Science
Volume	3557
DOIs	https://doi.org/10.1007/11502760_25
Publication status	Published - 2005
Event	12th International Workshop on Fast Software Encryption. FSE 2005 - Paris, France Duration: 2005 Feb 21 → 2005 Feb 23

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11502760_25

Cite this

@article{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",

doi = "10.1007/11502760_25",

language = "English",

volume = "3557",

pages = "368--383",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "12th International Workshop on Fast Software Encryption. FSE 2005 ; Conference date: 21-02-2005 Through 23-02-2005",

}

TY - JOUR

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

U2 - 10.1007/11502760_25

DO - 10.1007/11502760_25

M3 - Conference article

AN - SCOPUS:26444515034

VL - 3557

SP - 368

EP - 383

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

T2 - 12th International Workshop on Fast Software Encryption. FSE 2005

Y2 - 21 February 2005 through 23 February 2005

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this