Cryptanalysis of 6-round PRINCE using 2 Known Plaintexts

Shahram Rasoolzadeh; Håvard Raddum

Paper 2016/132

Cryptanalysis of 6-round PRINCE using 2 Known Plaintexts

Shahram Rasoolzadeh and Håvard Raddum

Abstract

In this paper we focus on the PRINCE block cipher reduced to 6 rounds, with two known plaintext/ciphertext pairs. We develop two attacks on 6-round PRINCE based on accelerated exhaustive search, one with negligible memory usage and one having moderate memory requirements. The time complexities for the two attacks are $2^{96.78}$ and $2^{88.85}$ , respectively. The memory consumption of the second attack is less than 200MB and so is not a restricting factor in a real-world setting.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
Keywords: lightweight cipher PRINCE exhaustive search
Contact author(s): shahram @ simula no
History: 2016-08-24: revised; 2016-02-15: received; See all versions
Short URL: https://ia.cr/2016/132
License: CC BY

BibTeX

@misc{cryptoeprint:2016/132,
      author = {Shahram Rasoolzadeh and Håvard Raddum},
      title = {Cryptanalysis of 6-round {PRINCE} using 2 Known Plaintexts},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/132},
      year = {2016},
      url = {https://eprint.iacr.org/2016/132}
}