本文選題：噴泉碼　切入點(diǎn)：密鑰長度　出處：《武漢紡織大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：在當(dāng)今這個信息時代,信息貫穿我們整個社會、經(jīng)濟(jì)、文化等,這些信息與我們的利益緊密相關(guān),信息的安全性日益受到人們關(guān)注,怎么確保信息安全是當(dāng)前人們最需要解決的問題之一。而傳統(tǒng)的對稱加密算法是針對大容量數(shù)據(jù)加密算法,保證其信息的安全性,例如DES加密算法的安全性不高,容易破解。網(wǎng)絡(luò)數(shù)據(jù)是通過噴泉碼來傳輸數(shù)據(jù),為了保證數(shù)據(jù)傳輸?shù)目煽啃?噴泉碼采用隨機(jī)化編碼原理。為了提高加密算法的安全性,本文將將噴泉碼的隨機(jī)化編碼應(yīng)用于加密算法,本論文提出基于噴泉碼加密算法(FEA),其采用對稱加密算法。FEA的密鑰繼承噴泉碼的隨機(jī)化編碼特性,加密密鑰對原始數(shù)據(jù)進(jìn)行隨機(jī)化循環(huán)移位運(yùn)算和迭代異或運(yùn)算,其結(jié)果再與加密密鑰進(jìn)行密鑰擾亂異或運(yùn)算,獲得密文數(shù)據(jù)。研究分析,FEA的密鑰具有唯一性和隨機(jī)性,且隨機(jī)化循環(huán)移位、迭代異或運(yùn)算、密鑰擾亂異或運(yùn)算增加加密算法的復(fù)雜性,共進(jìn)行n輪迭代加密算法,因此,FEA的安全性是比較高的。FEA的密鑰長度是可變的(可擴(kuò)展的),隨著密鑰長度增長,其熵越大,密碼的破解難度越大,信息越安全。FEA的密鑰長度是可變的,而傳統(tǒng)加密算法的密鑰長度是固定的,用戶想根據(jù)信息的重要程度設(shè)置其相應(yīng)的密鑰長度,即重要信息設(shè)置較長的密鑰或非重要信息設(shè)置較短的密鑰,因此FEA比傳統(tǒng)加密算法更適合用戶有效地管理信息與密鑰。實(shí)驗(yàn)證明,FEA通過表的形式進(jìn)行加密運(yùn)算,極大降低了加密算法的計(jì)算量,極大降低了加密時間,且FEA的加密時間低于傳統(tǒng)加密算法的加密時間,FEA的加密效率高于傳統(tǒng)加密算法的加密效率,FEA滿足了用戶對大文件加密效率的需求。本文通過窮舉法和超級計(jì)算機(jī)來破譯加密算法的密碼,FEA的密碼長度是可變的(可擴(kuò)展的),隨著密碼長度的增長,破譯加密算法的密鑰時間變的更長,信息的安全性也更高。
[Abstract]:In this information age, information runs through our whole society, economy, culture and so on. These information are closely related to our interests, and the security of information has been paid more and more attention to by people. How to ensure the information security is one of the most important problems that people need to solve at present. The traditional symmetric encryption algorithm is aimed at the large capacity data encryption algorithm to ensure the security of its information, such as the security of DES encryption algorithm is not high. The network data is transmitted by fountain code. In order to ensure the reliability of data transmission, fountain code adopts random coding principle, in order to improve the security of encryption algorithm, In this paper, the randomization coding of fountain code is applied to encryption algorithm. In this paper, a new encryption algorithm based on fountain code is proposed, which adopts symmetric encryption algorithm .FEA to inherit the randomization of fountain code. The encryption key performs random cyclic shift operation and iterative XOR operation on the original data. The result of the encryption key scrambles the XOR operation with the encryption key and obtains the ciphertext data. This paper studies and analyzes the uniqueness and randomness of the key of FEA. Moreover, random cyclic shift, iterative XOR operation, key scrambling XOR operation increase the complexity of encryption algorithm, and carry out n round iterative encryption algorithm. Therefore, the security of FEA is relatively high. The key length of FEA is variable. With the increase of key length, the greater the entropy, the more difficult it is to break the password, and the more secure the information is, the more the key length of FEA is variable. However, the key length of the traditional encryption algorithm is fixed. The user wants to set the key length according to the importance of the information, that is, the important information sets the long key or the non-important information sets the shorter key. Therefore, FEA is more suitable for users to manage information and keys effectively than traditional encryption algorithms. And the encryption time of FEA is lower than that of traditional encryption algorithm. The encryption efficiency of FEA is higher than that of traditional encryption algorithm. The password length of the FEA to decipher the encryption algorithm is variable (Extensible, as the password length grows, The key time of the decryption encryption algorithm becomes longer, and the security of information is also higher.
【學(xué)位授予單位】：武漢紡織大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP309.7

【參考文獻(xiàn)】

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

1 高家利;;一種Raptor碼編碼技術(shù)的改進(jìn)算法[J];電視技術(shù);2015年03期

2 馬蕾;李云瑋;劉建平;;對稱密鑰高識別率虛假認(rèn)證的改進(jìn)K協(xié)議實(shí)現(xiàn)[J];科技通報(bào);2014年08期

3 李湘鋒;趙有健;全成斌;;對稱密鑰加密算法在IPsec協(xié)議中的應(yīng)用[J];電子測量與儀器學(xué)報(bào);2014年01期

4 張偉;雷維嘉;謝顯中;;一種基于反饋的Raptor碼編碼改進(jìn)方案[J];河南科技大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年05期

5 石井;吳哲;譚璐;王昊鵬;王娜;;RSA數(shù)據(jù)加密算法的分析與改進(jìn)[J];濟(jì)南大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年03期

6 邵明珠;李保華;;基于改進(jìn)橢圓加密算法的網(wǎng)絡(luò)加密技術(shù)[J];科技通報(bào);2012年10期

7 付永貴;馬尚才;;一種改進(jìn)的對稱密鑰動態(tài)生成算法及應(yīng)用[J];計(jì)算機(jī)系統(tǒng)應(yīng)用;2011年06期

8 卜曉燕;張根耀;郭協(xié)潮;;基于AES算法實(shí)現(xiàn)對數(shù)據(jù)的加密[J];電子設(shè)計(jì)工程;2009年03期

9 林元乖;;網(wǎng)絡(luò)加解密算法AES分析[J];微計(jì)算機(jī)信息;2007年18期

10 羅祖玲;;基于DES算法的數(shù)據(jù)庫加密[J];裝備制造技術(shù);2007年06期

，

本文編號：1579673