检索结果-南通市图书馆

Impossible Differential Evaluations for New-Structure Series

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2014年第2期23卷 357-360页

作者： CUI Ting JIN Chenhui Information Engineering University

Impossible differential cryptanalysis is a powerful tool to evaluate the strength of a block cipher structure, and the key step of this cryptanalysis is to find the longest impossible differential. Recently a series of generalized Feistel structures named New-structure I, II,III and IV were proposed, which were designed with full consideration of differential and linear cryptanalysis security. In this paper, we investigate the impossible differential properties of New-structure series, and we show that there always exists 14/∞/19/15 rounds impossible differential for New-structure I, II, III and IV respectively.

关键词： Impossible differential cryptanalysis Generalized Feistel structure New-structure series Substution-permutation(SP) structure

Automatic Search of Impossible Differentials and Zero-Correlation Linear Hulls for ARX Ciphers

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2018年第2期15卷 54-66页

作者： Kai Zhang Jie Guan Bin Hu Zhengzhou Information Science and Technology Institute Zhengzhou 450000 China

In lightweight cryptographic primitives, round functions with only simple operations XOR, modular addition and rotation are widely used nowadays. This kind of ciphers is called ARX ciphers. For ARX ciphers, impossible differential cryptanalysis and zero-correlation linear cryptanalysis are among the most powerful attacks, and the key problems for these two attacks are discovering more and longer impossible differentials(IDs) and zero-correlation linear hulls(ZCLHs). However, finding new IDs and ZCLHs for ARX ciphers has been a manual work for a long time, which has been an obstacle in improving these two attacks. This paper proposes an automatic search method to improve the efficiency of finding new IDs and ZCLHs for ARX ciphers. In order to prove the efficiency of this new tool, we take HIGHT, LEA, SPECK three typical ARX algorithms as examples to explore their longer and new impossible differentials and zero-correlation linear hulls. To the best of our knowledge, this is the first application of automatic search method for ARX ciphers on finding new IDs and ZCLHs. For HIGHT, we find more 17 round IDs and multiple 17 round ZCLHs. This is the first discovery of 17 round ZCLHs for HIGHT. For LEA, we find extra four 10 round IDs and several 9 round ZCLHs. In the specification of LEA, the designers just identified three 10 round IDs and one 7round ZCLH. For SPECK, we find thousands of 6 round IDs and forty-four 6 round ZCLHs. Neither IDs nor ZCLHs of SPECK has been proposed before. The successful application of our new tool shows great potential in improving the impossible differential cryptanalysis and zero-correlation linear cryptanalysis on ARX ciphers..

关键词：线性密码 ARX 关联自动搜索搜索方法翻译模块化攻击

Real-time state recovery attack against MORUS in nonce-misuse setting

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2019年第3期62卷 214-216页

作者： Tairong SHI Jie GUAN Information Science and Technology Institute

Dear editor,CAESAR [1] is a large-scale cryptographic competition supported by the US National Institute of Standards and Technology, which mainly calls for authenticated ciphers. MORUS [2], an authenticated stream ci... 详细信息

关键词： Real-time state recovery attack against MORUS in nonce-misuse setting Si Pi

Collision Attacks against AEZ-PRF for Authenticated Encryption AEZ

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2018年第2期15卷 46-53页

作者： Tairong Shi Chenhui Jin Jie Guan Information Science and Technology Institute Science Avenue High-Tech Zone Zhengzhou Henan 450001 China

AEZ is an AES-based authenticated encryption submitted to the ongoing CAESAR competition and was presented at Eurocrypt2015 with AEZ v3. There are three models for AEZ, AEZ-core, AEZ-tiny and AEZ-prf. In this paper, we consider the security of AEZprf for AEZ v4.2, the latest version of AEZ.Our major finding is a collision of any 256-bit associated data for AES-prf. Then we launch collision attacks in a quantum setting and a classical setting respectively under different assumptions. In the quantum setting, by Simon's quantum algorithm, we amount a forgery with O(n) quantum superposition queries and an overwhelming probability close to 1.In the classical setting, one with the key of AEZ-prf can also construct the forgeries. Our results show that the AEZ-prf models of AEZ v4.2 is not secure in both the quantum setting and classical world. Furthermore, our results can also be applied to AEZ v3, which has been published on Eurocrypt 2015. As far as we know, no cryptanalysis of AEZ v4.2 has been published so far.

关键词：碰撞攻击加密 AES prf 联系数古典 mon 量算法

Variable Selection of Partially Linear Single-index Models

在线全文

学校读者我要写书评

暂无评论

Chinese Quarterly Journal of Mathematics 2014年第3期29卷 392-399页

作者： L U Yi-qiang HU Bin Institute of Cryptography and Engineering the PLA Information Engineering University Zhengzhou450000 China

In this article, we study the variable selection of partially linear single-index model(PLSIM). Based on the minimized average variance estimation, the variable selection of PLSIM is done by minimizing average variance with adaptive l1 penalty. Implementation algorithm is given. Under some regular conditions, we demonstrate the oracle properties of aLASSO procedure for PLSIM. Simulations are used to investigate the effectiveness of the proposed method for variable selection of PLSIM.

关键词： variable selection adaptive LASSO minimized average variance estimation(MAVE) partially linear single-index model

在线全文

学校读者我要写书评

暂无评论

一种基于完全性的不可能差分区分器构造方法

电子与信息学报 2018年第2期40卷 430-437页

作者：李俊志关杰信息工程大学电子技术学院郑州450001

基于混合运算的密码算法(MOC)以安全性高、软硬件实现效率高等特点受到人们的广泛关注。完全性指输出的每一比特都包含有输入每一比特的信息,达到完全性是密码算法设计的一个基本原则。该文提出针对MOC算法完全性分析的通用算法,并在此... 详细信息

基于混合运算的密码算法(MOC)以安全性高、软硬件实现效率高等特点受到人们的广泛关注。完全性指输出的每一比特都包含有输入每一比特的信息,达到完全性是密码算法设计的一个基本原则。该文提出针对MOC算法完全性分析的通用算法,并在此基础上提出利用完全性寻找MOC算法的不可能差分区分器的方法,此构造方法可直接给出MOC算法高重量的不可能差分区分器且搜索效率高,为MOC算法不可能差分区分器的实际构造提供了理论指导和技术支持。应用此方法找到了SIMON系列算法全部现有的最长不可能差分区分器,并找到了SPECK系列算法更多的不可能差分区分器。

关键词：基于混合运算密码算法不可能差分区分器完全性 SIMON SPECK

在线全文

学校读者我要写书评

暂无评论

MORUS算法的抗碰撞性分析

电子与信息学报 2017年第7期39卷 1704-1710页

作者：关杰施泰荣李俊志张沛解放军信息工程大学郑州450001

MORUS算法是CAESAR竞赛第3轮的候选认证加密算法之一,该文评估了MORUS-640-128算法对碰撞攻击的安全性。由碰撞关系确定一系列非线性方程,采用分块分析的方法,从非线性方程中找到消息字差分间的信息泄漏规律,首次给出了算法在两步后发... 详细信息

MORUS算法是CAESAR竞赛第3轮的候选认证加密算法之一,该文评估了MORUS-640-128算法对碰撞攻击的安全性。由碰撞关系确定一系列非线性方程,采用分块分析的方法,从非线性方程中找到消息字差分间的信息泄漏规律,首次给出了算法在两步后发生碰撞的必要条件集,确定了输入差分的字分布情况。在此基础上,将碰撞的必要条件转化成伪布尔函数最优化问题,利用混合整数规划模型进行求解。实验结果显示算法发生碰撞时,输入差的汉明重量至少为28,其碰撞概率小于1402-,得到了比文献[7]更紧致的概率上界(原为1302-)。结果表明MORUS-640-128算法具备良好的抗碰撞攻击能力。

关键词： CAESAR竞赛 MORUS算法碰撞攻击差分重量下界

New State Recovery Attacks on the Grain v1 Stream Cipher

在线全文

学校读者我要写书评

暂无评论

China Communications 2016年第11期13卷 180-188页

作者： Lin Ding Chenhui Jin Jie Guan Shaowu Zhang Junzhi Li Hong Wang Wei Zhao Zhengzhou Information Science and Technology Institute 450000 Zhengzhou China Science and Technology on Communication Security Laboratory 610041 Chengdu China

The Grain v1 stream cipher is one of the seven finalists in the final e STREAM portfolio. Though many attacks have been published,no recovery attack better than exhaustive key search on full Grain v1 in the single key setting has been found yet. In this paper,new state recovery attacks on Grain v1 utilizing the weak normality order of the employed keystream output function in the cipher are proposed. These attacks have remarkable advantages in the offline time,online time and memory complexities,which are all better than exhaustive key search. The success probability of each new attack is 0.632. The proposed attack primarily depends on the order of weak normality of the employed keystream output function. This shows that the weak normality order should be carefully considered when designing the keystream output functions of Grain-like stream ciphers.

关键词：密码攻击粮食输出功能穷举搜索密钥流成功概率流密码秩序

在线全文

学校读者我要写书评

暂无评论

Keccak类S盒的线性性质研究

电子与信息学报 2020年第7期42卷 1790-1795页

作者：关杰黄俊君战略支援部队信息工程大学郑州450001

该文将Keccak的S盒一般化为n元Keccak类S盒,研究了Keccak类S盒的线性性质。证明了这类S盒的相关优势的取值都为0或2-k,其中k∈Z且0≤k≤[2-1n],并且对于此范围内的任意k,都存在输入输出掩码使得相关优势取到2-k;证明了当输出掩码确定时... 详细信息

该文将Keccak的S盒一般化为n元Keccak类S盒,研究了Keccak类S盒的线性性质。证明了这类S盒的相关优势的取值都为0或2-k,其中k∈Z且0≤k≤[2-1n],并且对于此范围内的任意k,都存在输入输出掩码使得相关优势取到2-k;证明了当输出掩码确定时,其非平凡相关优势都相等;给出了非平凡相关优势为最大值2-1时的充要条件与计数,解决了这类S盒的Walsh谱分布规律问题。

关键词：哈希函数 Keccak S盒线性性质