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) |
出版日期 | 2014 |
会议名称 | 20th International Workshop on Fast Software Encryption, FSE 2013 |
会议日期 | March 11, 2013 - March 13, 2013 |
会议地点 | Singapore, Singapore |
页码 | 71-91 |
通讯作者 | Soleimany, H.(hadi.soleimany@aalto.fi) |
中文摘要 | 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. |
收录类别 | EI |
会议录出版地 | Springer Verlag |
语种 | 英语 |
ISSN号 | 3029743 |
ISBN号 | 9783662439326 |
WOS记录号 | WOS:000358935100010 |
源URL | [http://ir.iscas.ac.cn/handle/311060/16573] ![]() |
专题 | 软件研究所_软件所图书馆_会议论文 |
推荐引用方式 GB/T 7714 | Soleimany, Hadi ,Blondeau, Cé,line ,et al. Reflection cryptanalysis of PRINCE-like ciphers[C]. 见:20th International Workshop on Fast Software Encryption, FSE 2013. Singapore, Singapore. March 11, 2013 - March 13, 2013. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。