检索结果-南通市图书馆

Improved meet-in-the-middle attacks on reduced-round Piccolo

Science China(Information Sciences) 2018年第3期61卷 95-107页

作者： Ya LIU Liang CHENG Zhiqiang LIU Wei LI Qingju WANG Dawu GU Department of Computer Science and Engineering University of Shanghai for Science and Technology State Key Laboratory of Cryptology Department of Computer Science and Engineering Shanghai Jiao Tong University School of Computer Science and Technology Donghua University Shanghai Key Laboratory of Integrated Administration Technologies for Information Security Department of Applied Mathematics and Computer Science Technical University of Denmark

Piccolo is a lightweight block cipher that adopts a generalized Feistel network structure with4 branches, each of which is 16 bit long. The key length is 80 or 128 bit, denoted by Piccolo-80 and Piccolo-128, respectively. In this paper, we mounted meet-in-the-middle attacks on 14-round Piccolo-80 without preand post-whitening keys and 18-round Piccolo-128 with post-whitening keys by exploiting the properties of the key schedule and Maximum Distance Separable（MDS） matrix. For Piccolo-80, we first constructed a 5-round distinguisher. Then 4 rounds and 5 rounds were appended at the beginning and at the end,respectively. Based on this structure, we mounted an attack on 14-round Piccolo-80 from the 5 th round to the 18 th round. The data, time, and memory complexities were 2;chosen plaintexts, 2;encryptions, and 2;blocks, respectively. For Piccolo-128, we built a 7-round distinguisher to attack 18-round Piccolo-128 from the 4 th round to the 21st round. The data, time, and memory complexities were 2;chosen plaintexts,2;encryptions, and 2;blocks, respectively. If not considering results on biclique cryptanalysis,these are currently the best public results on this reduced version of the Piccolo block cipher.

关键词： block cipher lightweight Piccolo meet-in-the-middle attack distinguisher

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Sandwich-Boomerang attack on reduced round CLEFIA

引用

High Technology Letters 2014年第1期20卷 48-53页

作者：毛明 Qin Zhiguang School of Computer Science and Engineering University of Electronic Science and Technology of China

CLEFIA(named after the French word "Clef" meaning "Key") is an efficient,highly secure block cipher proposed by SONY Corporation in the 14 th International Workshop on Fast Software Encryption(FSE-2007) and many cryptanalyses have been used to analyze *** to the property of CLEFIA,a new technique Sandwich-Boomerang cryptanalysis is used on *** 8-round Sandwich-Boomerang distinguisher of CLEFIA is constructed using the best differential characteristic of *** then,based on the distinguisher,an attack against 10-round CLEFIA is *** number of chosen plaintexts required is 2^(119)(or 2^(120)) and the time complexity is 2^(120)(or 2^(121)).Compared with a 7-round impossible Boomerang distinguisher presented by Choy in the 4th International Workshop on Security(IWSEC-2009),the differential characteristics used in the attack are all the best ones,so it is believed that the attack is the best result that the Boomerang attacks can get on CLEFIA at present.

关键词： block cipher CLEFIA Sandwich-Boomerang distinguisher

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Cryptanalysis of TEA Using Quantum-Inspired Genetic Algorithms

引用

Journal of Software Engineering and Applications 2010年第1期3卷 50-57页

作者： Wei Hu 不详

The Tiny Encryption Algorithm (TEA) is a Feistel block cipher well known for its simple implementation, small memory footprint, and fast execution speed. In two previous studies, genetic algorithms (GAs) were employed to investigate the randomness of TEA output, based on which distinguishers for TEA could be designed. In this study, we used quan-tum-inspired genetic algorithms (QGAs) in the cryptanalysis of TEA. Quantum chromosomes in QGAs have the advan-tage of containing more information than the binary counterpart of the same length in GAs, and therefore generate a more diverse solution pool. We showed that QGAs could discover distinguishers for reduced cycle TEA that are more efficient than those found by classical GAs in two earlier studies. Furthermore, we applied QGAs to break four-cycle and five-cycle TEAs, a considerably harder problem, which the prior GA approach failed to solve.

关键词： Cryptanalysis distinguisher Feistel Block Cipher Genetic Algorithms Optimization Quantum Computing TEA

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：