Institutional Repository
| Reflection cryptanalysis of PRINCE-like ciphers | |
| Soleimany, Hadi (1); Blondeau, Cé line (1); Yu, Xiaoli (2); Wu, Wenling (2); Nyberg, Kaisa (1); Zhang, Huiling (2); Zhang, Lei (2); Wang, Yanfeng (2); Soleimany, H.(hadi.soleimany@aalto.fi) | |
| 2014 | |
| Conference Name | 20th International Workshop on Fast Software Encryption, FSE 2013 |
| Pages | 71-91 |
| Conference Date | March 11, 2013 - March 13, 2013 |
| Conference Place | Singapore, Singapore |
| Indexed Type | EI |
| Publish Place | Springer Verlag |
| ISSN | 3029743 |
| ISBN | 9783662439326 |
| Department | (1) Department of Information and Computer Science, Aalto University, School of Science, Espoo, Finland; (2) TCA, Institute of Software, Chinese Academy of Sciences, Beijing, China; (3) Graduate University, Chinese Academy of Sciences, Beijing, China |
| English Abstract | PRINCE is a low-latency block cipher presented at ASIACRYPT 2012. The cipher was designed with a property called α-reflection which reduces the definition of the decryption with a given key to an encryption with a different but related key determined by . In the design document, it was shown that PRINCE is secure against known attacks independently of the value of , and the design criteria for remained open. In this paper, we introduce new generic distinguishers on PRINCE-like ciphers. First, we show that, by folding the cipher in the middle, the number of rounds can be halved due to the α-reflection property. Furthermore, we investigate many classes of α and find the best differential characteristic for the folded cipher. For such α there exist an efficient key-recovery attack on the full 12-round cipher with the data complexity of 257.98 known plaintexts and time complexity of 272.39 encryptions. With the original value of we can attack a reduced six-round version of PRINCE. As a result of the new cryptanalysis method presented in this paper, new design criteria concerning the selection of the value of for PRINCE-like ciphers are obtained. © 2014 Springer-Verlag.; PRINCE is a low-latency block cipher presented at ASIACRYPT 2012. The cipher was designed with a property called α-reflection which reduces the definition of the decryption with a given key to an encryption with a different but related key determined by . In the design document, it was shown that PRINCE is secure against known attacks independently of the value of , and the design criteria for remained open. In this paper, we introduce new generic distinguishers on PRINCE-like ciphers. First, we show that, by folding the cipher in the middle, the number of rounds can be halved due to the α-reflection property. Furthermore, we investigate many classes of α and find the best differential characteristic for the folded cipher. For such α there exist an efficient key-recovery attack on the full 12-round cipher with the data complexity of 257.98 known plaintexts and time complexity of 272.39 encryptions. With the original value of we can attack a reduced six-round version of PRINCE. As a result of the new cryptanalysis method presented in this paper, new design criteria concerning the selection of the value of for PRINCE-like ciphers are obtained. © 2014 Springer-Verlag. |
| Language | 英语 |
| WOS ID | WOS:000358935100010 |
| Citation statistics | |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16573 |
| Collection | 中国科学院软件研究所 |
| Corresponding Author | Soleimany, H.(hadi.soleimany@aalto.fi) |
| Recommended Citation GB/T 7714 | Soleimany, Hadi ,Blondeau, Cé,line ,et al. Reflection cryptanalysis of PRINCE-like ciphers[C]. Springer Verlag,2014:71-91. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment