减缩轮PRIDE算法的线性分析
发布时间：2019-05-20 19:40
【摘要】：PRIDE是Albrecht等人在2014美密会上提出的轻量级分组密码算法.PRIDE采用典型SPN密码结构,共迭代20轮.其设计主要关注于线性层,兼顾了算法的效率和安全.该文探讨了S盒和线性层矩阵的线性性质,构造了16条优势为2~(-5)的2轮线性逼近和8条优势为2-3的1轮线性逼近.利用合适的线性逼近,结合密钥扩展算法、S盒的线性性质和部分和技术,我们对18轮和19轮PRIDE算法进行了线性分析.该分析分别需要260个已知明文,2~(74.9)次18轮加密和262个已知明文,2~(74.9)次19轮加密.另外,我们给出了一些关于S盒差分性质和线性性质之间联系的结论,有助于减少攻击过程中的计算量.本文是已知明文攻击.本文是关于PRIDE算法的第一个线性分析.
[Abstract]:The PRIDE is the lightweight packet cipher algorithm proposed by Albrecht et al. at the 2014 Mead Meeting. The PRIDE uses a typical SPN password structure with a total of 20 rounds. The design is mainly focused on the linear layer, and the efficiency and safety of the algorithm are taken into account. In this paper, the linear properties of S-box and linear-layer matrix are discussed, and two-wheel linear approximation with two advantages of 2-(-5) and 1-wheel linear approximation with the advantage of 2-3 are constructed. The linear analysis of the 18-wheel and 19-wheel PRIDE algorithm is carried out by means of the appropriate linear approximation, the combination of the key extension algorithm, the linear nature of the S-box, and the part and technique. The analysis requires 260 known clear text,2-(74.9) times of 18-wheel encryption and 262 known clear-text, and 2-(74.9) times of 19-wheel encryption. In addition, we give some conclusion on that relationship between the difference property and the linear property of the S-box, which can help to reduce the amount of calculation in the attack process. This article is a known plain text attack. This paper is the first linear analysis of the PRIDE algorithm.
【作者单位】： 数学工程与先进计算国家重点实验室;
【基金】：信息保障技术重点实验室开放基金(No.KJ-13-010)
【分类号】：TN918.1
，
本文编号：2481902
[Abstract]:The PRIDE is the lightweight packet cipher algorithm proposed by Albrecht et al. at the 2014 Mead Meeting. The PRIDE uses a typical SPN password structure with a total of 20 rounds. The design is mainly focused on the linear layer, and the efficiency and safety of the algorithm are taken into account. In this paper, the linear properties of S-box and linear-layer matrix are discussed, and two-wheel linear approximation with two advantages of 2-(-5) and 1-wheel linear approximation with the advantage of 2-3 are constructed. The linear analysis of the 18-wheel and 19-wheel PRIDE algorithm is carried out by means of the appropriate linear approximation, the combination of the key extension algorithm, the linear nature of the S-box, and the part and technique. The analysis requires 260 known clear text,2-(74.9) times of 18-wheel encryption and 262 known clear-text, and 2-(74.9) times of 19-wheel encryption. In addition, we give some conclusion on that relationship between the difference property and the linear property of the S-box, which can help to reduce the amount of calculation in the attack process. This article is a known plain text attack. This paper is the first linear analysis of the PRIDE algorithm.
【作者单位】： 数学工程与先进计算国家重点实验室;
【基金】：信息保障技术重点实验室开放基金(No.KJ-13-010)
【分类号】：TN918.1
，
本文编号：2481902
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2481902.html
