Cryptanalysis of full PRIDE block cipher

详细信息    查看全文

• 作者：Yibin Dai ; Shaozhen Chen
• 关键词：cryptanalysis ; block cipher ; PRIDE ; iterative characteristics ; related ; key differential
• 刊名：SCIENCE CHINA Information Sciences
• 出版年：2017
• 出版时间：May 2017
• 年：2017
• 卷：60
• 期：5
• 全文大小：315 KB
• 刊物类别：Computer Science
• 刊物主题：Chinese Library of Science
  Information Systems and Communication Service
  
• 出版者：Science China Press, co-published with Springer
• ISSN：1869-1919
• 卷排序：60

文摘

PRIDE is a lightweight block cipher proposed at CRYPTO 2014 by Albrecht et al., who claimed that the construction of linear layers is efficient and secure. In this paper, we investigate the key schedule and find eight 2-round iterative related-key differential characteristics, which can be used to construct 18-round related-key differentials. A study of the first subkey derivation function reveals that there exist three weak-key classes, as a result of which all the differences of subkeys for each round are identical. For the weak-key classes, we also find eight 2-round iterative related-key differential characteristics. Based on one of the related-key differentials, we launch an attack on the full PRIDE block cipher. The data and time complexity are 239 chosen plaintexts and 292 encryptions, respectively. Moreover, by using multiple related-key differentials, we improve the cryptanalysis, which then requires 241.6 chosen plaintexts and 242.7 encryptions, respectively. Finally, we use two 17-round related-key differentials to analyze full PRIDE, which requires 235 plaintexts and 254.7 encryptions. These are the first results on full PRIDE, and show that the PRIDE block cipher is not secure against related-key differential attack.