We use cookies to improve your experience with our site.

低轮SIMON算法的零相关线性分析

Zero-Correlation Linear Cryptanalysis of Reduced-Round SIMON

  • 摘要: 2013年6月, 美国国家安全局提出了两族轻量级分组密码算法, 分别叫做SIMON和SPECK。这两族分组密码的设计目标是在硬件和软件都有很好的实现性能。本文主要给出了SIMON族算法各个版本的零相关线性分析结果。首先, 利用中间相错的方法, 我们构造了SIMON族算法的零相关线性区分器, 并根据密钥恢复过程的详细分析给出了零相关线性分析结果。之后, 我们利用多维零相关线性分析降低了攻击的数据复杂度。我们的零相关线性分析结果比Abed等人在ePrint报告2013/568上提出的不可能差分分析结果更好。最后, 我们利用分而治之技术改进了Javad等人在ePrint报告2013/663上给出的线性分析结果。

     

    Abstract: In June 2013, the U.S. National Security Agency proposed two families of lightweight block ciphers, called SIMON and SPECK respectively. These ciphers are designed to perform excellently on both hardware and software platforms. In this paper, we mainly present zero-correlation linear cryptanalysis on various versions of SIMON. Firstly, by using missin- the-middle approach, we construct zero-correlation linear distinguishers of SIMON, and zero-correlation linear attacks are presented based on careful analysis of key recovery phase. Secondly, multidimensional zero-correlation linear attacks are used to reduce the data complexity. Our zero-correlation linear attacks perform better than impossible differential attacks proposed by Abed et al. in ePrint Report 2013/568. Finally, we also use the divide-and-conquer technique to improve the results of linear cryptanalysis proposed by Javad et al. in ePrint Report 2013/663.

     

/

返回文章
返回