Related-Key Impossible-Differential Attack on Reduced-Round Skinny

Ralph Ankele; Subhadeep Banik; Avik Chakraborti; Eik List; Florian Mendel; Siang Meng Sim; Gaoli Wang

doi:10.1007/978-3-319-61204-1_11

Related-Key Impossible-Differential Attack on Reduced-Round Skinny

Ralph Ankele, Subhadeep Banik, Avik Chakraborti, Eik List, Florian Mendel, Siang Meng Sim, Gaoli Wang

Department of Information Security

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

86 Downloads (Pure)

Abstract

At CRYPTO'16, Beierle et al. presented SKINNY, a family of lightweight tweakable block ciphers intended to compete with the NSA designs SIMON and SPECK. SKINNY can be implemented efficiently in both soft- and hardware and supports block sizes of 64 and 128 bits as well as tweakey sizes of 64, 128, 192 and 128, 256, 384 bits respectively. This paper presents a related-tweakey impossible-differential attack on up to 23 (out of 36) rounds of SKINNY-64/128 for different tweak sizes. All our attacks can be trivially extended to SKINNY-128/128.

Original language	English
Title of host publication	Applied Cryptography and Network Security
Editors	Dieter Gollmann, Atsuko Miyaji, Hiroaki Kikuchi
Place of Publication	Kanazawa, Japan
Publisher	Springer International Publishing
Pages	208-228
Number of pages	21
Volume	10355
ISBN (Electronic)	978-3-319-61204-1
ISBN (Print)	978-3-319-61203-4
DOIs	https://doi.org/10.1007/978-3-319-61204-1_11
Publication status	Published - 2017

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer International Publishing AG 2017
Number	1
Volume	10355

Keywords

Symmetric Cryptography
Cryptanalysis
Tweakable block cipher
Impossible differential
Lightweight cryptography

Access to Document

10.1007/978-3-319-61204-1_11

Accepted ManuscriptAccepted author manuscript, 595 KB

https://link.springer.com/chapter/10.1007/978-3-319-61204-1_11

Cite this

Ankele, R., Banik, S., Chakraborti, A., List, E., Mendel, F., Sim, S. M., & Wang, G. (2017). Related-Key Impossible-Differential Attack on Reduced-Round Skinny. In D. Gollmann, A. Miyaji, & H. Kikuchi (Eds.), Applied Cryptography and Network Security (Vol. 10355, pp. 208-228). (Lecture Notes in Computer Science; Vol. 10355, No. 1). Springer International Publishing. https://doi.org/10.1007/978-3-319-61204-1_11

@inproceedings{afcc641f6c014e33a0f6f5591566b10d,

title = "Related-Key Impossible-Differential Attack on Reduced-Round Skinny",

abstract = "At CRYPTO'16, Beierle et al. presented SKINNY, a family of lightweight tweakable block ciphers intended to compete with the NSA designs SIMON and SPECK. SKINNY can be implemented efficiently in both soft- and hardware and supports block sizes of 64 and 128 bits as well as tweakey sizes of 64, 128, 192 and 128, 256, 384 bits respectively. This paper presents a related-tweakey impossible-differential attack on up to 23 (out of 36) rounds of SKINNY-64/128 for different tweak sizes. All our attacks can be trivially extended to SKINNY-128/128.",

keywords = "Symmetric Cryptography, Cryptanalysis, Tweakable block cipher, Impossible differential , Lightweight cryptography ",

author = "Ralph Ankele and Subhadeep Banik and Avik Chakraborti and Eik List and Florian Mendel and Sim, {Siang Meng} and Gaoli Wang",

year = "2017",

doi = "10.1007/978-3-319-61204-1_11",

language = "English",

isbn = "978-3-319-61203-4",

volume = "10355",

series = "Lecture Notes in Computer Science",

publisher = "Springer International Publishing",

number = "1",

pages = "208--228",

editor = "Dieter Gollmann and Atsuko Miyaji and Hiroaki Kikuchi",

booktitle = "Applied Cryptography and Network Security",

}

Ankele, R, Banik, S, Chakraborti, A, List, E, Mendel, F, Sim, SM & Wang, G 2017, Related-Key Impossible-Differential Attack on Reduced-Round Skinny. in D Gollmann, A Miyaji & H Kikuchi (eds), Applied Cryptography and Network Security. vol. 10355, Lecture Notes in Computer Science, no. 1, vol. 10355, Springer International Publishing, Kanazawa, Japan, pp. 208-228. https://doi.org/10.1007/978-3-319-61204-1_11

Related-Key Impossible-Differential Attack on Reduced-Round Skinny. / Ankele, Ralph; Banik, Subhadeep; Chakraborti, Avik et al.
Applied Cryptography and Network Security. ed. / Dieter Gollmann; Atsuko Miyaji; Hiroaki Kikuchi. Vol. 10355 Kanazawa, Japan: Springer International Publishing, 2017. p. 208-228 (Lecture Notes in Computer Science; Vol. 10355, No. 1).

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

TY - GEN

T1 - Related-Key Impossible-Differential Attack on Reduced-Round Skinny

AU - Ankele, Ralph

AU - Banik, Subhadeep

AU - Chakraborti, Avik

AU - List, Eik

AU - Mendel, Florian

AU - Sim, Siang Meng

AU - Wang, Gaoli

PY - 2017

Y1 - 2017

N2 - At CRYPTO'16, Beierle et al. presented SKINNY, a family of lightweight tweakable block ciphers intended to compete with the NSA designs SIMON and SPECK. SKINNY can be implemented efficiently in both soft- and hardware and supports block sizes of 64 and 128 bits as well as tweakey sizes of 64, 128, 192 and 128, 256, 384 bits respectively. This paper presents a related-tweakey impossible-differential attack on up to 23 (out of 36) rounds of SKINNY-64/128 for different tweak sizes. All our attacks can be trivially extended to SKINNY-128/128.

AB - At CRYPTO'16, Beierle et al. presented SKINNY, a family of lightweight tweakable block ciphers intended to compete with the NSA designs SIMON and SPECK. SKINNY can be implemented efficiently in both soft- and hardware and supports block sizes of 64 and 128 bits as well as tweakey sizes of 64, 128, 192 and 128, 256, 384 bits respectively. This paper presents a related-tweakey impossible-differential attack on up to 23 (out of 36) rounds of SKINNY-64/128 for different tweak sizes. All our attacks can be trivially extended to SKINNY-128/128.

KW - Symmetric Cryptography

KW - Cryptanalysis

KW - Tweakable block cipher

KW - Impossible differential

KW - Lightweight cryptography

U2 - 10.1007/978-3-319-61204-1_11

DO - 10.1007/978-3-319-61204-1_11

M3 - Conference contribution

SN - 978-3-319-61203-4

VL - 10355

T3 - Lecture Notes in Computer Science

SP - 208

EP - 228

BT - Applied Cryptography and Network Security

A2 - Gollmann, Dieter

A2 - Miyaji, Atsuko

A2 - Kikuchi, Hiroaki

PB - Springer International Publishing

CY - Kanazawa, Japan

ER -

Ankele R, Banik S, Chakraborti A, List E, Mendel F, Sim SM et al. Related-Key Impossible-Differential Attack on Reduced-Round Skinny. In Gollmann D, Miyaji A, Kikuchi H, editors, Applied Cryptography and Network Security. Vol. 10355. Kanazawa, Japan: Springer International Publishing. 2017. p. 208-228. (Lecture Notes in Computer Science; 1). Epub 2017 Jun 26. doi: 10.1007/978-3-319-61204-1_11