【摘要】：PRIDE是Albrecht等人在2014美密會上提出的輕量級分組密碼算法.PRIDE采用典型SPN密碼結(jié)構(gòu),共迭代20輪.其設(shè)計(jì)主要關(guān)注于線性層,兼顧了算法的效率和安全.該文探討了S盒和線性層矩陣的線性性質(zhì),構(gòu)造了16條優(yōu)勢為2~(-5)的2輪線性逼近和8條優(yōu)勢為2-3的1輪線性逼近.利用合適的線性逼近,結(jié)合密鑰擴(kuò)展算法、S盒的線性性質(zhì)和部分和技術(shù),我們對18輪和19輪PRIDE算法進(jìn)行了線性分析.該分析分別需要260個(gè)已知明文,2~(74.9)次18輪加密和262個(gè)已知明文,2~(74.9)次19輪加密.另外,我們給出了一些關(guān)于S盒差分性質(zhì)和線性性質(zhì)之間聯(lián)系的結(jié)論,有助于減少攻擊過程中的計(jì)算量.本文是已知明文攻擊.本文是關(guān)于PRIDE算法的第一個(gè)線性分析.
[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.
【作者單位】： 數(shù)學(xué)工程與先進(jìn)計(jì)算國家重點(diǎn)實(shí)驗(yàn)室;
【基金】：信息保障技術(shù)重點(diǎn)實(shí)驗(yàn)室開放基金(No.KJ-13-010)
【分類號】：TN918.1
，

本文編號：2481902