检索结果-南通市图书馆

Improved Known-Key Distinguisher on Round-Reduced 3D Block Cipher

Chinese Journal of Electronics 2015年第1期24卷 199-204页

作者： ZHA Daren WU Shuang WANG Qiongxiao University of Chinese Academy of Sciences Data Assurance and Communication Security Research Center of Chinese Academy of Sciences

The 3D block cipher is a three-dimensional version of AES(Advanced encryption standard), which use a three-dimensional state and similar round functions. In this paper, we will use the known-key attack model proposed by Knudsen and Rijmen, and propose an improved distinguisher on 15 rounds of 3D, which has 22 rounds in total. The distinguisher is constructed using rebound techniques. In the previous distinguisher, only three inbound phases are merged. Here we propose a method to merge four inbound phases using gradual matching *** improved complexity of this distinguisher is 2128 computations and 264 memory. The computational complexity is significantly reduced from 2200 in the previous attack.

关键词： 3D block cipher Known-key distinguisher rebound attack Gradual matching.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes

引用

Frontiers of Computer Science 2014年第3期8卷 513-525页

作者： Le DONG Wenling WU Shuang WU Jian ZOU College of Mathematics and Information Science Henan Normal University Xinxiang 453007 China Institute of Software Chinese Academy of Sciences Beijing 100190 China Graduate University of Chinese Academy of Sciences Beijing 100149 China

We present some known-key distinguishers for a type-1 Feistel scheme with a permutation as the round function. To be more specific, the 29-round known-key truncated differential distinguishers are given for the 256-bit type-1 Feistel scheme with an SP （substitution-permutation） round function by using the rebound attack, where the S-boxes have perfect differential and linear properties and the linear diffusion layer has a maximum branch number. For two 128-bit versions, the distinguishers can be applied on 25- round structures. Based on these distinguishers, we construct near-collision attacks on these schemes with MMO （Matyas- Meyer-Oseas） and MP （Miyaguchi-Preneel） hashing modes, and propose the 26-round and 22-round near-collision attacks for two 256-bit schemes and two 128-bit schemes, respectively. We apply the near-collision attack on MAME and obtain a 26-round near-collision attack. Using the algebraic degree and some integral properties, we prove the correctness of the 31-round known-key integral distinguisher proposed by Sasaki et al. We show that if the round function is a permutation, the integral distinguisher is suitable for a type-1 Feistel scheme of any size.

关键词： known-key block cipher generalized Feistel scheme type-1 rebound attack integral distinguisher algebraic degree

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：