| linear approximations of addition modulo 2n-1 | |
| Zhou Chunfang; Feng Xiutao; Wu Chuankun | |
| 2011 | |
| 会议名称 | 18th International Workshop on Fast Software Encryption, FSE 2011 |
| 会议录名称 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| 页码 | 359-377 |
| 会议日期 | 1-Feb |
| 会议地点 | Lyngby, Denmark |
| 出版地 | Germany |
| ISSN | 3029743 |
| ISBN | 9783642217012 |
| 部门归属 | (1) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China; (2) Graduate University, Chinese Academy of Science, Beijing, 100049, China |
| 摘要 | Addition modulo 231 - 1 is a basic arithmetic operation in the stream cipher ZUC. For evaluating ZUC's resistance against linear cryptanalysis, it is necessary to study properties of linear approximations of the addition modulo 231 - 1. In this paper we discuss linear approximations of the addition of k inputs modulo 2n - 1 for n ≥ 2. As a result, an explicit expression of the correlations of linear approximations of the addition modulo 2n - 1 is given when k = 2, and an iterative expression when k > 2. For a class of special linear approximations with all masks being equal to 1, we further discuss the limit of their correlations when n goes to infinity. It is shown that when k is even, the limit is equal to zero, and when k is odd, the limit is bounded by a constant depending on k. © 2011 Springer-Verlag. |
| 关键词 | Security Of Data |
| 内容类型 | 会议论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/14271 |
| 专题 | 信息安全国家重点实验室 |
| 推荐引用方式 GB/T 7714 | Zhou Chunfang,Feng Xiutao,Wu Chuankun. linear approximations of addition modulo 2n-1[C]. Germany,2011:359-377. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| linear approximation（297KB） | 开放获取 | -- | 请求全文 | |||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论