Cryptology ePrint Archive: Report 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.

Category / Keywords: secret-key cryptography / lightweight cipher, PRINCE, exhaustive search

Date: received 13 Feb 2016, last revised 24 Aug 2016

Contact author: shahram at simula no

Available format(s): PDF | BibTeX Citation

Version: 20160824:131649 (All versions of this report)

Short URL: ia.cr/2016/132

Discussion forum: Show discussion | Start new discussion