本文選題：不可分辨性　切入點(diǎn)：Feistel結(jié)構(gòu)　出處：《山東大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：之前的工作已經(jīng)證明Feistel結(jié)構(gòu)與隨機(jī)置換是不可分辨的,隨后研究員開始研究如何在這樣的Feistel結(jié)構(gòu)中添加密鑰獲取一個(gè)可證明安全的分組密碼。在Feistel結(jié)構(gòu)中,假設(shè)輪函數(shù)是n比特到n比特的隨機(jī)函數(shù),各輪所采用的輪函數(shù)是相互獨(dú)立且公開的,相同密鑰交替的混合進(jìn)狀態(tài)的一半,這樣設(shè)計(jì)的結(jié)構(gòu)正是SIMON族分組密碼的基本結(jié)構(gòu)。更詳細(xì)地,狀態(tài)更新可以描述為:(xi,xi-1)→(xi-1(?)Fi(xi)(?)k,xi)本文借鑒John Steinberger教授的思想,修改了郭與林之前證明中用到的模擬器,證明18輪足夠可以使得這樣Feistel結(jié)構(gòu)的密碼與分組長(zhǎng)度為2n,密鑰長(zhǎng)度為n比特的理想密碼不可分辨,成功地將之前的21輪才能證明Feistel結(jié)構(gòu)的密碼與理想密碼不可分辨性結(jié)論修改為18輪。
[Abstract]:Previous work has proved that the Feistel structure is indistinguishable from the random permutation, and researchers then began to study how to add a key to such a Feistel structure to obtain a provable secure block cipher. Assuming that the wheel function is a random function from n-bit to n-bit, the wheel functions used in each round are independent and open, half of the intermingled state with the same key alternately. The structure so designed is the basic structure of the SIMON family block cipher. In more detail, the status update can be described as:. 鈫扻i-1a? What is it? This paper uses Professor John Steinberger's idea for reference and modifies the simulator used in Guo Yulin's previous proof. It is proved that 18 rounds can make the ciphers of this Feistel structure indistinguishable from the ideal ciphers of 2nn, n-bit key length. The indiscernibility conclusion of the previous 21 rounds to prove that the Feistel structure is indistinguishable from the ideal cipher is modified to 18 rounds.
【學(xué)位授予單位】：山東大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN918.4

【相似文獻(xiàn)】

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

1 趙艷敏;SIMON類密鑰交替Feistel密碼不可分辨性分析的改進(jìn)[D];山東大學(xué);2017年

，

本文編號(hào)：1595699