Related-Key Rectangle Attack on 42-Round SHACAL-2

Jiqiang Lu; Jongsung Kim; N. Keller; Orr Dunkelman

Related-Key Rectangle Attack on 42-Round SHACAL-2

Jiqiang Lu, Jongsung Kim, N. Keller, Orr Dunkelman

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

Based on the compression function of the hash function standard SHA-256, SHACAL-2 is a 64-round block cipher with a 256-bit block size and a variable length key of up to 512 bits. In this paper, we present a related-key rectangle attack on 42-round SHACAL-2, which requires 2243.38 related-key chosen plaintexts and has a running time of 2488.37. This is the best currently known attack on SHACAL-2.

Original language	American English
Title of host publication	Information Security
Editors	Sokratis K. Katsikas, Javier López, Michael Backes, Stefanos Gritzalis, Bart Preneel
Place of Publication	Berlin Heidelberg
Publisher	Springer
Pages	85-100
Volume	4176
State	Published - 2006

Publication series

Name	Lecture Notes in Computer Science

Cite this

@inbook{adadd7f3b1fc4b7cab94107ef36a8424,

title = "Related-Key Rectangle Attack on 42-Round SHACAL-2",

abstract = "Based on the compression function of the hash function standard SHA-256, SHACAL-2 is a 64-round block cipher with a 256-bit block size and a variable length key of up to 512 bits. In this paper, we present a related-key rectangle attack on 42-round SHACAL-2, which requires 2243.38 related-key chosen plaintexts and has a running time of 2488.37. This is the best currently known attack on SHACAL-2.",

author = "Jiqiang Lu and Jongsung Kim and N. Keller and Orr Dunkelman",

year = "2006",

language = "American English",

volume = "4176",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "85--100",

editor = "{K. Katsikas}, Sokratis and Javier L{\'o}pez and Michael Backes and Stefanos Gritzalis and Bart Preneel",

booktitle = "Information Security",

}

Related-Key Rectangle Attack on 42-Round SHACAL-2. / Lu, Jiqiang; Kim, Jongsung; Keller, N. et al.
Information Security. ed. / Sokratis K. Katsikas; Javier López; Michael Backes; Stefanos Gritzalis; Bart Preneel. Vol. 4176 Berlin Heidelberg: Springer, 2006. p. 85-100 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Related-Key Rectangle Attack on 42-Round SHACAL-2

AU - Lu, Jiqiang

AU - Kim, Jongsung

AU - Keller, N.

AU - Dunkelman, Orr

PY - 2006

Y1 - 2006

N2 - Based on the compression function of the hash function standard SHA-256, SHACAL-2 is a 64-round block cipher with a 256-bit block size and a variable length key of up to 512 bits. In this paper, we present a related-key rectangle attack on 42-round SHACAL-2, which requires 2243.38 related-key chosen plaintexts and has a running time of 2488.37. This is the best currently known attack on SHACAL-2.

AB - Based on the compression function of the hash function standard SHA-256, SHACAL-2 is a 64-round block cipher with a 256-bit block size and a variable length key of up to 512 bits. In this paper, we present a related-key rectangle attack on 42-round SHACAL-2, which requires 2243.38 related-key chosen plaintexts and has a running time of 2488.37. This is the best currently known attack on SHACAL-2.

UR - http://link.springer.com/chapter/10.1007%2F11836810_7

M3 - Chapter

VL - 4176

T3 - Lecture Notes in Computer Science

SP - 85

EP - 100

BT - Information Security

A2 - K. Katsikas, Sokratis

A2 - López, Javier

A2 - Backes, Michael

A2 - Gritzalis, Stefanos

A2 - Preneel, Bart

PB - Springer

CY - Berlin Heidelberg

ER -

Related-Key Rectangle Attack on 42-Round SHACAL-2

Abstract

Publication series

Other files and links

Fingerprint

Cite this