【摘要】：LBlock算法是2011年在ACNS會議上提出的輕量級分組密碼算法,目前已存在17輪、19輪LBlock算法的中間相遇攻擊.文中評估LBlock算法在預(yù)建表中間相遇攻擊下的安全性.預(yù)建表中間相遇攻擊提出并發(fā)展于AES算法(高級加密標(biāo)準(zhǔn))的安全性分析,是近些年密碼分析中的一個(gè)研究熱點(diǎn).預(yù)建表中間相遇攻擊屬于典型的區(qū)分器類攻擊,包含離線和在線兩個(gè)階段.文中通過綜合離線階段區(qū)分器的建立過程和在線階段密鑰的恢復(fù)過程,利用程序搜索LBlock算法有效區(qū)分器與對應(yīng)初始密鑰的最優(yōu)攻擊參數(shù).結(jié)果表明,LBlock算法存在11輪區(qū)分器,21輪LBlock算法不抵抗預(yù)建表中間相遇攻擊,攻擊的數(shù)據(jù)復(fù)雜度僅為2~(34.1)選擇明文,計(jì)算復(fù)雜度為2~(75.8)次21輪加密,存儲復(fù)雜度為2~(74.8)個(gè)64比特塊.與LBlock算法已有中間相遇攻擊相比,文中將攻擊輪數(shù)由19輪擴(kuò)展至21輪,刷新了LBlock算法在中間相遇攻擊下的安全性評估結(jié)果.與不可能差分、積分分析等其他分析結(jié)果相比,文中攻擊具有顯著的低數(shù)據(jù)復(fù)雜度,在實(shí)際攻擊環(huán)境下具有重要意義.此外,為了提高LBlock密鑰擴(kuò)展算法的擴(kuò)散速度,汪艷鳳等人提出了一種新的密鑰擴(kuò)展算法.文中評估了采用新的密鑰擴(kuò)展算法的LBlock在預(yù)建表中間相遇攻擊下的安全性,并成功得到了復(fù)雜度優(yōu)于窮舉搜索的20輪攻擊,結(jié)果顯示新的密鑰擴(kuò)展算法以1輪的優(yōu)勢增強(qiáng)了LBlock算法抵抗此類攻擊的能力.
[Abstract]:LBlock algorithm is a lightweight block cipher algorithm proposed at the ACNS conference in 2011. At present, there are 17 rounds of 19 rounds of LBlock algorithm in the middle of the encounter attack. This paper evaluates the security of the LBlock algorithm under the encounter attack in the middle of the pre-built table. The security analysis of pre-built table intermediate encounter attack developed from AES (Advanced encryption Standard) is a hot topic in cryptographic analysis in recent years. The pre-built table encounter attack is a typical discriminator attack, which includes two stages: offline and online. By synthesizing the building process of off-line phase discriminator and the restoration process of online key, the LBlock algorithm is used to search the optimal attack parameters of the discriminator and the corresponding initial key. The results show that the LBlock algorithm has 11 rounds of discriminator and 21 rounds of LBlock, and the data complexity of the attack is only 2 ~ (34.1) selected plaintext, the computational complexity is 2 ~ (75.8) times 21 rounds of encryption, and the storage complexity is 2 ~ (74.8) 64 bits. Compared with the existing intermediate encounter attack of LBlock algorithm, the number of attack rounds is extended from 19 to 21 rounds, which refreshes the security evaluation results of LBlock algorithm under the intermediate encounter attack. Compared with other analysis results, such as impossible difference analysis and integral analysis, the attack in this paper has significant low data complexity and is of great significance in the actual attack environment. In addition, in order to improve the diffusion speed of LBlock key extension algorithm, Wang Yanfeng and others proposed a new key extension algorithm. In this paper, we evaluate the security of LBlock with a new key extension algorithm under the encounter attack of pre-built table, and obtain 20 attacks whose complexity is better than that of exhaustive search. The results show that the new key extension algorithm enhances the ability of LBlock algorithm to resist such attacks by one round.
【作者單位】： 中國科學(xué)院軟件研究所可信計(jì)算與信息保障實(shí)驗(yàn)室;中國科學(xué)院大學(xué)研究生院;
【基金】：國家“九七三”重點(diǎn)基礎(chǔ)研究發(fā)展規(guī)劃項(xiàng)目基金(2013CB338002) 國家自然科學(xué)基金(61272476,61672509,61232009)資助~~
【分類號】：TN918.1

【相似文獻(xiàn)】

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

1 杜欽生,王美琴,曹寶香;Rijndael加密算法的密鑰擴(kuò)展算法的研究[J];信息技術(shù)與信息化;2005年05期

2 李政;;基于Feistel網(wǎng)絡(luò)的AES密鑰擴(kuò)展算法[J];計(jì)算機(jī)與現(xiàn)代化;2007年09期

3 ;[J];;年期

相關(guān)會議論文 前1條

1 羅春麗;林勝釗;張鴻飛;崔珂;王堅(jiān);;基于Hash函數(shù)的安全密鑰擴(kuò)展算法的研究[A];第十六屆全國核電子學(xué)與核探測技術(shù)學(xué)術(shù)年會論文集（上冊）[C];2012年

相關(guān)碩士學(xué)位論文 前3條

1 賀亮;RC4密鑰擴(kuò)展算法的不動點(diǎn)數(shù)分析[D];青島大學(xué);2008年

2 袁巍;AES算法的設(shè)計(jì)原則與其密鑰擴(kuò)展算法的改進(jìn)[D];吉林大學(xué);2010年

3 閆智佳;IDEA子密鑰擴(kuò)展算法的分析及改進(jìn)[D];吉林大學(xué);2012年

，

本文編號：2259605