Multiple Differential Cryptanalysis of Round-Reduced PRINCE (Full version)
Anne Canteaut, Thomas B. Fuhr, María Naya‐Plasencia, Henri Gilbert, Jean-René Reinhard · 2014
Abstract. PRINCE is a lightweight block cipher proposed by Borghoff et al. at Asiacrypt 2012. Due to its originality, novel design and low num-ber of rounds, it has already attracted the attention of a large number of cryptanalysts. Several results on reduced versions have been published to date; the best one is an attack on 8 rounds out of the total number of 12. In this paper we improve this result by two rounds: we provide an attack on 10 rounds of the cipher with a data complexity of 257.94 and a time complexity of 260.62, corresponding to 118.56 security bits, instead of 126 for the generic attacks. Our attack uses multiple differen-tials and exploits some properties of PRINCE for recovering the whole key. PRINCE is defined as a member of a family of ciphers, differing by the choice of an Sbox among a distinguished set. We also show that the security offered by all the members of the family is not equivalent, by identifying an Sbox for which our attack can be extended up to 11 rounds with a data complexity of 259.81 and a time complexity of 262.43.