Impossible differential attack on 30-round SHACAL-2

Seokhie Hong; Jongsung Kim; Guil Kim; Jaechul Sung; Changhoon Lee; Sangjin Lee

doi:10.1007/978-3-540-24582-7_7

Impossible differential attack on 30-round SHACAL-2

Seokhie Hong, Jongsung Kim, Guil Kim, Jaechul Sung, Changhoon Lee, Sangjin Lee

Research output: Chapter in Book/Report/Conference proceeding › Chapter

17 Citations (Scopus)

Abstract

SHACAL-2 is a 256-bit block cipher with various key sizes based on the hash function SHA-2. Recently, it was recommended as one of the NESSIE selections. Up to now, no security flaws have been found in SHACAL-2. In this paper, we discuss the security of SHACAL-2 against an impossible differential attack. We propose two types of 14-round impossible characteristics and using them, we attack 30-round SHACAL-2 with 512-bit key. This attack requires 744 chosen plaintexts and has time complexity of 2^495.1 30-round SHACAL-2 encryptions.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Thomas Johansson, Subhamoy Maitra
Publisher	Springer Verlag
Pages	97-106
Number of pages	10
ISBN (Print)	3540206094, 9783540206095
DOIs	https://doi.org/10.1007/978-3-540-24582-7_7
Publication status	Published - 2003

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2904
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Keywords

Block Cipher
Impossible Differential Attack
SHACAL-2

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-24582-7_7

Cite this

Hong, S., Kim, J., Kim, G., Sung, J., Lee, C., & Lee, S. (2003). Impossible differential attack on 30-round SHACAL-2. In T. Johansson, & S. Maitra (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 97-106). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2904). Springer Verlag. https://doi.org/10.1007/978-3-540-24582-7_7

Impossible differential attack on 30-round SHACAL-2. / Hong, Seokhie; Kim, Jongsung; Kim, Guil et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Thomas Johansson; Subhamoy Maitra. Springer Verlag, 2003. p. 97-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2904).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Hong, S, Kim, J, Kim, G, Sung, J, Lee, C & Lee, S 2003, Impossible differential attack on 30-round SHACAL-2. in T Johansson & S Maitra (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2904, Springer Verlag, pp. 97-106. https://doi.org/10.1007/978-3-540-24582-7_7

Hong S, Kim J, Kim G, Sung J, Lee C, Lee S. Impossible differential attack on 30-round SHACAL-2. In Johansson T, Maitra S, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 97-106. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-24582-7_7

Hong, Seokhie ; Kim, Jongsung ; Kim, Guil et al. / Impossible differential attack on 30-round SHACAL-2. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Thomas Johansson ; Subhamoy Maitra. Springer Verlag, 2003. pp. 97-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{48b36ca51a734b768ae8cf4cff4f6610,

title = "Impossible differential attack on 30-round SHACAL-2",

abstract = "SHACAL-2 is a 256-bit block cipher with various key sizes based on the hash function SHA-2. Recently, it was recommended as one of the NESSIE selections. Up to now, no security flaws have been found in SHACAL-2. In this paper, we discuss the security of SHACAL-2 against an impossible differential attack. We propose two types of 14-round impossible characteristics and using them, we attack 30-round SHACAL-2 with 512-bit key. This attack requires 744 chosen plaintexts and has time complexity of 2495.1 30-round SHACAL-2 encryptions.",

keywords = "Block Cipher, Impossible Differential Attack, SHACAL-2",

author = "Seokhie Hong and Jongsung Kim and Guil Kim and Jaechul Sung and Changhoon Lee and Sangjin Lee",

year = "2003",

doi = "10.1007/978-3-540-24582-7_7",

language = "English",

isbn = "3540206094",

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

publisher = "Springer Verlag",

pages = "97--106",

editor = "Thomas Johansson and Subhamoy Maitra",

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

}

TY - CHAP

T1 - Impossible differential attack on 30-round SHACAL-2

AU - Hong, Seokhie

AU - Kim, Jongsung

AU - Kim, Guil

AU - Sung, Jaechul

AU - Lee, Changhoon

AU - Lee, Sangjin

PY - 2003

Y1 - 2003

N2 - SHACAL-2 is a 256-bit block cipher with various key sizes based on the hash function SHA-2. Recently, it was recommended as one of the NESSIE selections. Up to now, no security flaws have been found in SHACAL-2. In this paper, we discuss the security of SHACAL-2 against an impossible differential attack. We propose two types of 14-round impossible characteristics and using them, we attack 30-round SHACAL-2 with 512-bit key. This attack requires 744 chosen plaintexts and has time complexity of 2495.1 30-round SHACAL-2 encryptions.

AB - SHACAL-2 is a 256-bit block cipher with various key sizes based on the hash function SHA-2. Recently, it was recommended as one of the NESSIE selections. Up to now, no security flaws have been found in SHACAL-2. In this paper, we discuss the security of SHACAL-2 against an impossible differential attack. We propose two types of 14-round impossible characteristics and using them, we attack 30-round SHACAL-2 with 512-bit key. This attack requires 744 chosen plaintexts and has time complexity of 2495.1 30-round SHACAL-2 encryptions.

KW - Block Cipher

KW - Impossible Differential Attack

KW - SHACAL-2

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

U2 - 10.1007/978-3-540-24582-7_7

DO - 10.1007/978-3-540-24582-7_7

M3 - Chapter

AN - SCOPUS:0346895382

SN - 3540206094

SN - 9783540206095

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

SP - 97

EP - 106

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

A2 - Johansson, Thomas

A2 - Maitra, Subhamoy

PB - Springer Verlag

ER -

Impossible differential attack on 30-round SHACAL-2

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this