Utilizing Probabilistic Linear Equations in Cube Attacks
文献类型：期刊论文
| 作者 | Yao, Y ; Zhang, B ; Wu, WL |
| 刊名 | JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
 |
| 出版日期 | 2016 |
| 卷号 | 31期号:2页码:317-325 |
| 关键词 | cube attack sequential probability ratio test maximum likelihood decoding Trivium |
| ISSN号 | 1000-9000 |
| 中文摘要 | Cube attacks, proposed by Dinur and Shamir at EUROCRYPT 2009, have shown huge power against stream ciphers. In the original cube attacks, a linear system of secret key bits is exploited for key recovery attacks. However, we find a number of equations claimed linear in previous literature actually nonlinear and not fit into the theoretical framework of cube attacks. Moreover, cube attacks are hard to apply if linear equations are rare. Therefore, it is of significance to make use of probabilistic linear equations, namely nonlinear superpolys that can be approximated by linear expressions effectively. In this paper, we suggest a way to test out and utilize these probabilistic linear equations, thus extending cube attacks to a wider scope. Concretely, we employ the standard parameter estimation approach and the sequential probability ratio test (SPRT) for linearity test in the preprocessing phase, and use maximum likelihood decoding (MLD) for solving the probabilistic linear equations in the online phase. As an application, we exhibit our new attack against 672 rounds of Trivium and reduce the number of key bits to search by 7. |
| 英文摘要 | Cube attacks, proposed by Dinur and Shamir at EUROCRYPT 2009, have shown huge power against stream ciphers. In the original cube attacks, a linear system of secret key bits is exploited for key recovery attacks. However, we find a number of equations claimed linear in previous literature actually nonlinear and not fit into the theoretical framework of cube attacks. Moreover, cube attacks are hard to apply if linear equations are rare. Therefore, it is of significance to make use of probabilistic linear equations, namely nonlinear superpolys that can be approximated by linear expressions effectively. In this paper, we suggest a way to test out and utilize these probabilistic linear equations, thus extending cube attacks to a wider scope. Concretely, we employ the standard parameter estimation approach and the sequential probability ratio test (SPRT) for linearity test in the preprocessing phase, and use maximum likelihood decoding (MLD) for solving the probabilistic linear equations in the online phase. As an application, we exhibit our new attack against 672 rounds of Trivium and reduce the number of key bits to search by 7. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000372154100007 |
| 公开日期 | 2016-12-09 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/17344]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Yao, Y,Zhang, B,Wu, WL. Utilizing Probabilistic Linear Equations in Cube Attacks[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2016,31(2):317-325. |
| APA | Yao, Y,Zhang, B,&Wu, WL.(2016).Utilizing Probabilistic Linear Equations in Cube Attacks.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,31(2),317-325. |
| MLA | Yao, Y,et al."Utilizing Probabilistic Linear Equations in Cube Attacks".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 31.2(2016):317-325. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。