Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE

Lorenzo Grassi; Christian Rechberger

doi:10.1007/978-3-319-49890-4_18

Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE

Lorenzo Grassi
, Christian Rechberger

Department of Applied Mathematics and Computer Science

Graz University of Technology

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

446 Downloads (Orbit)

Abstract

Subspace trail cryptanalysis is a very recent new cryptanalysis technique, and includes differential, truncated differential, impossible differential, and integral attacks as special cases.

In this paper, we consider PRINCE, a widely analyzed block cipher proposed in 2012. After the identification of a 2.5 rounds subspace trail of PRINCE, we present several (truncated differential) attacks up to 6 rounds of PRINCE. This includes a very practical attack with the lowest data complexity of only 8 plaintexts for 4 rounds, which co-won the final round of the PRINCE challenge in the 4-round chosen-plaintext category. The attacks have been verified using a C implementation.

Of independent interest, we consider a variant of PRINCE in which ShiftRows and MixLayer operations are exchanged in position. In particular, our result shows that the position of ShiftRows and MixLayer operations influences the security of PRINCE. The same analysis applies to follow-up designs inspired by PRINCE.

Original language	English
Title of host publication	Progress in Cryptology – INDOCRYPT 2016 : Proceedings of the 17th International Conference on Cryptology in India
Publisher	Springer
Publication date	2016
Pages	322-342
ISBN (Print)	978-3-319-49889-8
ISBN (Electronic)	978-3-319-49890-4
DOIs	https://doi.org/10.1007/978-3-319-49890-4_18
Publication status	Published - 2016
Event	17th International Conference on Cryptology in India - Kolkata, India Duration: 11 Dec 2016 → 14 Dec 2016 Conference number: 17 http://indocrypt2016.iiitd.edu.in/

Conference

Conference	17th International Conference on Cryptology in India
Number	17
Country/Territory	India
City	Kolkata
Period	11/12/2016 → 14/12/2016
Internet address	http://indocrypt2016.iiitd.edu.in/

Series	Lecture Notes in Computer Science
Volume	10095
ISSN	0302-9743

Keywords

PRINCE
Subspace trails cryptanalysis
Invariant subspace attack
Truncated differential attack
Practical attack
MANTIS

Access to Document

10.1007/978-3-319-49890-4_18

964Accepted author manuscript, 666 KB

OpenUrl availability

Full text

Cite this

@inproceedings{27e8cdd0efc34168b8af061b4104e3c9,

title = "Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE",

abstract = "Subspace trail cryptanalysis is a very recent new cryptanalysis technique, and includes differential, truncated differential, impossible differential, and integral attacks as special cases. In this paper, we consider PRINCE, a widely analyzed block cipher proposed in 2012. After the identification of a 2.5 rounds subspace trail of PRINCE, we present several (truncated differential) attacks up to 6 rounds of PRINCE. This includes a very practical attack with the lowest data complexity of only 8 plaintexts for 4 rounds, which co-won the final round of the PRINCE challenge in the 4-round chosen-plaintext category. The attacks have been verified using a C implementation. Of independent interest, we consider a variant of PRINCE in which ShiftRows and MixLayer operations are exchanged in position. In particular, our result shows that the position of ShiftRows and MixLayer operations influences the security of PRINCE. The same analysis applies to follow-up designs inspired by PRINCE.",

keywords = "PRINCE, Subspace trails cryptanalysis, Invariant subspace attack, Truncated differential attack, Practical attack, MANTIS",

author = "Lorenzo Grassi and Christian Rechberger",

year = "2016",

doi = "10.1007/978-3-319-49890-4\_18",

language = "English",

isbn = "978-3-319-49889-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "322--342",

booktitle = "Progress in Cryptology – INDOCRYPT 2016",

note = "17th International Conference on Cryptology in India, INDOCRYPT 2016 ; Conference date: 11-12-2016 Through 14-12-2016",

url = "http://indocrypt2016.iiitd.edu.in/",

}

Grassi, L & Rechberger, C 2016, Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE. in Progress in Cryptology – INDOCRYPT 2016: Proceedings of the 17th International Conference on Cryptology in India. Springer, Lecture Notes in Computer Science, vol. 10095, pp. 322-342, 17th International Conference on Cryptology in India, Kolkata, India, 11/12/2016. https://doi.org/10.1007/978-3-319-49890-4_18

Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE. / Grassi, Lorenzo; Rechberger, Christian.
Progress in Cryptology – INDOCRYPT 2016: Proceedings of the 17th International Conference on Cryptology in India. Springer, 2016. p. 322-342 (Lecture Notes in Computer Science, Vol. 10095).

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

TY - GEN

T1 - Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE

AU - Grassi, Lorenzo

AU - Rechberger, Christian

N1 - Conference code: 17

PY - 2016

Y1 - 2016

N2 - Subspace trail cryptanalysis is a very recent new cryptanalysis technique, and includes differential, truncated differential, impossible differential, and integral attacks as special cases. In this paper, we consider PRINCE, a widely analyzed block cipher proposed in 2012. After the identification of a 2.5 rounds subspace trail of PRINCE, we present several (truncated differential) attacks up to 6 rounds of PRINCE. This includes a very practical attack with the lowest data complexity of only 8 plaintexts for 4 rounds, which co-won the final round of the PRINCE challenge in the 4-round chosen-plaintext category. The attacks have been verified using a C implementation. Of independent interest, we consider a variant of PRINCE in which ShiftRows and MixLayer operations are exchanged in position. In particular, our result shows that the position of ShiftRows and MixLayer operations influences the security of PRINCE. The same analysis applies to follow-up designs inspired by PRINCE.

AB - Subspace trail cryptanalysis is a very recent new cryptanalysis technique, and includes differential, truncated differential, impossible differential, and integral attacks as special cases. In this paper, we consider PRINCE, a widely analyzed block cipher proposed in 2012. After the identification of a 2.5 rounds subspace trail of PRINCE, we present several (truncated differential) attacks up to 6 rounds of PRINCE. This includes a very practical attack with the lowest data complexity of only 8 plaintexts for 4 rounds, which co-won the final round of the PRINCE challenge in the 4-round chosen-plaintext category. The attacks have been verified using a C implementation. Of independent interest, we consider a variant of PRINCE in which ShiftRows and MixLayer operations are exchanged in position. In particular, our result shows that the position of ShiftRows and MixLayer operations influences the security of PRINCE. The same analysis applies to follow-up designs inspired by PRINCE.

KW - PRINCE

KW - Subspace trails cryptanalysis

KW - Invariant subspace attack

KW - Truncated differential attack

KW - Practical attack

KW - MANTIS

U2 - 10.1007/978-3-319-49890-4_18

DO - 10.1007/978-3-319-49890-4_18

M3 - Article in proceedings

SN - 978-3-319-49889-8

T3 - Lecture Notes in Computer Science

SP - 322

EP - 342

BT - Progress in Cryptology – INDOCRYPT 2016

PB - Springer

T2 - 17th International Conference on Cryptology in India

Y2 - 11 December 2016 through 14 December 2016

ER -

Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE

Abstract

Conference

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this