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

Institute of Applied Information Processing and Communications (7050)

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

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
Place of Publication	Cham
Pages	208-228
ISBN (Electronic)	978-3-319-61204-1
DOIs	https://doi.org/10.1007/978-3-319-61204-1_11
Publication status	Published - 2017
Event	15th International Conference on Applied Cryptography and Network Security: ACNS 2017 - Kanazawa, Japan Duration: 10 Jul 2017 → 12 Jul 2017 Conference number: 15

Publication series

Name	Lecture Notes in Computer Science
Volume	10355

Conference

Conference	15th International Conference on Applied Cryptography and Network Security
Abbreviated title	ACNS
Country/Territory	Japan
City	Kanazawa
Period	10/07/17 → 12/07/17

Access to Document

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

Cite this

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 Applied Cryptography and Network Security. Lecture Notes in Computer Science, vol. 10355, Cham, pp. 208-228, 15th International Conference on Applied Cryptography and Network Security, Kanazawa, Japan, 10/07/17. https://doi.org/10.1007/978-3-319-61204-1_11

@inproceedings{e847e1d45cd84a80bf4cd06f3b5a68df,

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

abstract = "At CRYPTO{\textquoteright}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.",

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",

series = "Lecture Notes in Computer Science",

pages = "208--228",

booktitle = "Applied Cryptography and Network Security",

note = "15th International Conference on Applied Cryptography and Network Security : ACNS 2017, ACNS ; Conference date: 10-07-2017 Through 12-07-2017",

}

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

N1 - Conference code: 15

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.

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

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

M3 - Conference paper

SN - 978-3-319-61203-4

T3 - Lecture Notes in Computer Science

SP - 208

EP - 228

BT - Applied Cryptography and Network Security

CY - Cham

T2 - 15th International Conference on Applied Cryptography and Network Security

Y2 - 10 July 2017 through 12 July 2017

ER -