本文關(guān)鍵詞： 差分密碼分析 線性密碼分析 不可能差分 零相關(guān)線性逼近 ESF MILP　出處：《計(jì)算機(jī)研究與發(fā)展》2017年10期 　論文類型：期刊論文

【摘要】：自動(dòng)化分析是當(dāng)前對密碼算法進(jìn)行安全性評估的重要方法之一,具有高效、易實(shí)現(xiàn)的特點(diǎn).對面向位的分組密碼,自從Sun等人在2014年亞洲密碼年會(huì)上提出基于MILP問題的差分和線性自動(dòng)化搜索方法,該方法受到了許多密碼學(xué)者的關(guān)注.目前,針對求解多輪密碼算法MILP模型,如何減少變量和約束不等式的研究工作相對較少,還有很多問題有待解決.根據(jù)異或操作的差分傳播模式,在2017年歐洲密碼年會(huì)上,Sasaki等人給出了不帶假設(shè)變量的新約束不等式,該約束不等式在降低變量和約束數(shù)量的前提下保留了異或操作的差分傳播性質(zhì).同時(shí),對于S盒的性質(zhì),當(dāng)輸入差分變量(線性掩碼)非零時(shí),該S盒必定活躍,Sun等人用了4個(gè)約束不等式來刻畫該性質(zhì),經(jīng)過簡單的變換,可以用1個(gè)約束來表示該性質(zhì).基于這些精煉的約束和自動(dòng)化搜索方法,針對輕量級分組密碼算法ESF,建立單密鑰下精煉的差分和線性MILP模型,首次給出了ESF算法在單密鑰情形下的差分和線性分析結(jié)果,得到了15輪ESF算法差分最小活躍S盒數(shù)量為19和16輪ESF算法線性最小活躍S盒數(shù)量為15.此外,還搜索到了輪數(shù)最長的不可能差分和零相關(guān)線性逼近區(qū)分器.
[Abstract]:Automated analysis is one of the most important methods to evaluate the security of cryptographic algorithms. It has the characteristics of high efficiency and easy implementation. Since Sun et al proposed a differential and linear automated search method based on the MILP problem at the Asian Cryptography Conference in 2014, this method has attracted the attention of many cryptographers. For solving the MILP model of multi-wheeled cryptographic algorithm, the research work on how to reduce variables and constraint inequalities is relatively few, there are still many problems to be solved. According to the difference propagation mode of XOR operation. In 2017, Sasaki et al presented a new constraint inequality without assumed variables at the European Cryptography Conference. The constraint inequality preserves the differential propagation property of the XOR operation while reducing the number of variables and constraints. At the same time, for the S-box property, the input differential variable (linear mask) is not 00:00. The S-box must be active and Sun et al used four constraint inequalities to characterize this property. After a simple transformation, the property can be represented by a constraint based on these refined constraints and automated search methods. For the lightweight block cipher algorithm, the differential and linear MILP models of refinement under the single secret key are established, and the difference and linear analysis results of the ESF algorithm in the case of single secret key are presented for the first time. The minimum number of S-boxes of 15 rounds of ESF algorithm is 19 and 16 rounds of ESF algorithm is 15. In addition, the number of least active S-boxes is 15. An impossibility difference and zero correlation linear approximation discriminator with the longest number of wheels is also found.
【作者單位】： 數(shù)學(xué)工程與先進(jìn)計(jì)算國家重點(diǎn)實(shí)驗(yàn)室(中國人民解放軍信息工程大學(xué));中國科學(xué)院信息工程研究所;中國科學(xué)院大學(xué);國防科學(xué)技術(shù)大學(xué);陸軍航空兵學(xué)院;
【基金】：國家自然科學(xué)基金項(xiàng)目(61502532,61379150,61772519,61309016,61502529) 數(shù)學(xué)工程與先進(jìn)計(jì)算國家重點(diǎn)實(shí)驗(yàn)室開放基金課題(2016A02) 河南省重點(diǎn)科技攻關(guān)計(jì)劃項(xiàng)目(122102210126,092101210502)~~
【分類號】：TN918.1
【正文快照】： This work was supported by the National Natural Science Foundation of China(61502532,61379150,61772519,61309016,61502529),the Open Foundation of the State Key Laboratory of Mathematical Engineering and Advanced Computing(2016A02),and the Key Scientific a

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 何乃味;;分組密碼算法的可重構(gòu)設(shè)計(jì)模型與結(jié)構(gòu)分析[J];河池學(xué)院學(xué)報(bào);2012年05期

2 孫紅波;傅仕諍;徐日;;分組密碼算法的基礎(chǔ)平臺研究[J];無線電工程;2014年01期

3 雷旭,徐重陽;一種新的對稱分組密碼算法的設(shè)計(jì)[J];電視技術(shù);2002年05期

4 李順東,覃征,王向華,賈曉琳;面向移動(dòng)商務(wù)的分組密碼算法[J];西安交通大學(xué)學(xué)報(bào);2003年08期

5 尤坤,呂永其;分組密碼算法芯片驗(yàn)證[J];通信技術(shù);2003年11期

6 王勇 ,陳小平;一種以移位為基礎(chǔ)的分組密碼算法[J];信息網(wǎng)絡(luò)安全;2004年12期

7 彭巍,周亮;分組密碼算法測試平臺設(shè)計(jì)[J];成都信息工程學(xué)院學(xué)報(bào);2005年05期

8 孫旭;李雪梅;魯長江;;分組密碼算法的研究與實(shí)現(xiàn)[J];成都理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2006年06期

9 yど僖，

本文編號：1463933