基于Chebyshev多項(xiàng)式的公鑰密碼及相關(guān)研究
發(fā)布時(shí)間：2019-02-09 16:55
【摘要】：隨著信息化進(jìn)程的飛速發(fā)展,云計(jì)算和大數(shù)據(jù)等新技術(shù)應(yīng)用所面臨的信息安全隱患不斷增加,密碼成為保證信息安全的關(guān)鍵技術(shù)。由于通信環(huán)境的日趨復(fù)雜和破譯能力的不斷提升,一些傳統(tǒng)密碼算法被攻破或安全性受到威脅�；煦缡怯纱_定系統(tǒng)產(chǎn)生的貌似隨機(jī)性的行為,具有對(duì)初始條件和系統(tǒng)參數(shù)的極端敏感性和長(zhǎng)期不可預(yù)測(cè)性等特征,滿足密碼設(shè)計(jì)的混淆與擴(kuò)散原則,因而混沌理論為新形態(tài)密碼學(xué)技術(shù)研究注入了新的活力。目前混沌密碼學(xué)的研究集中在序列密碼、分組密碼等方面,混沌公鑰密碼的研究相對(duì)薄弱。本文對(duì)基于Chebyshev多項(xiàng)式的混沌公鑰密碼進(jìn)行研究,涉及到混沌Hash函數(shù)、公鑰密碼的安全構(gòu)造、數(shù)字簽名和密鑰交換協(xié)議的設(shè)計(jì)以及公鑰密碼在混沌圖像加密中的應(yīng)用研究,主要成果如下：(1)基于全局耦合時(shí)空混沌系統(tǒng)提出一種具有并行結(jié)構(gòu)的Hash函數(shù)設(shè)計(jì)方案(HFGCS),'它可以根據(jù)實(shí)際需要靈活調(diào)整所處理明文塊的大小以及生成Hash值的長(zhǎng)度。實(shí)驗(yàn)分析表明HFGCS方案具有較好的明文敏感性和混淆擴(kuò)散能力,相關(guān)的比較也顯示了其良好的性能�；煦鏗ash函數(shù)為公鑰密碼及相關(guān)研究提供了工具。(2)針對(duì)有限域Chebyshev-Elgamal類型的公鑰密碼方案(CEPKC)無(wú)法抵抗選擇密文攻擊的缺陷,提出兩種基于Chebyshev多項(xiàng)式的公鑰密碼的安全設(shè)計(jì)方案：CEPKC-Ⅰ和CEPKC-Ⅱ都能夠抵抗選擇密文攻擊,并保證信息的完整性驗(yàn)證。相比于CEPKC-Ⅰ, CEPKC-Ⅲ能夠突破加密明文長(zhǎng)度的限制,具有更小的密文擴(kuò)張率,并且在標(biāo)準(zhǔn)模型下針對(duì)不可區(qū)分適應(yīng)性選擇密文攻擊模型(IND-CCA2)是可證明安全的。利用基于Chebyshev多項(xiàng)式的公鑰密碼提出一種基于身份的前向安全數(shù)字簽名方案(IBFSS),它可以通過(guò)身份信息對(duì)簽名進(jìn)行驗(yàn)證,并且即使在當(dāng)前密鑰泄露的情況下仍能保證其先前簽名消息的不可偽造性。IBFSS方案安全性基于大整數(shù)因式分解和Cheyshev離散對(duì)數(shù)難題(CDLP),具有結(jié)構(gòu)簡(jiǎn)單和計(jì)算量小的優(yōu)點(diǎn)。指出一種基于Chebyshev多項(xiàng)式的三方密鑰交換協(xié)議方案(3PKAC-Ⅰ)存在的安全和性能缺陷,然后提出一種改進(jìn)方案(3PKAC-Ⅱ)。它能夠保證用戶身份信息保密性和相互認(rèn)證,降低密鑰分配和管理費(fèi)用。為了降低密鑰交換協(xié)議的網(wǎng)絡(luò)通信負(fù)擔(dān),本文提出一種新的基于Chebyshev多項(xiàng)式的兩方密鑰交換協(xié)議方案(2PKAC),具有高效的密鑰分發(fā)和管理策略,安全分析表明2PKAC方案能夠抵抗各種不同的攻擊。(3)利用DNA編碼和混沌系統(tǒng),提出一種新的選擇圖像加密方案(SIE)。Loistic和時(shí)空混沌系統(tǒng)的極端敏感性以及結(jié)構(gòu)復(fù)雜性可以增加其復(fù)雜度,DNA編碼和代數(shù)操作可以加快圖像混淆和擴(kuò)散的速度,通過(guò)選擇每個(gè)像素前四個(gè)高處有效位能減少一半的加密數(shù)據(jù)量。SIE方案將圖像信息熵調(diào)制為時(shí)空混沌系統(tǒng)的參數(shù),使其能抵抗選擇明文攻擊。為了解決密鑰分發(fā)和信息熵傳輸問(wèn)題,本文結(jié)合SIE方案和CEPKC-Ⅱ公鑰密碼方案,形成一種混合加密體制。實(shí)驗(yàn)?zāi)M和安全性能分析表明SIE方案能夠保證安全性和高效性。
[Abstract]:With the rapid development of the information process, the information security hidden danger faced by new technology applications such as cloud computing and big data is increasing, and the password becomes the key technology to ensure information security. Due to the increasing complexity of the communication environment and the continuous improvement of the decoding ability, some traditional cipher algorithms have been breached or the security is threatened. It is a kind of random behavior that is produced by the system, which has the characteristics of extreme sensitivity and long-term unpredictability to the initial conditions and system parameters, and satisfies the confusion and diffusion principle of the cipher design. At present, the research of hybrid cryptography is relatively weak in the key cryptography, packet cipher, and so on. This paper studies the code of the public key based on Chebyshev polynomial, which involves the design of the hash function, the security structure of the public key's password, the design of the digital signature and the key exchange protocol, and the application of the public key code in the encryption of the hybrid image. The main results are as follows: (1) a Hash function design scheme (HFGCS) with a parallel structure is proposed based on a global coupling space-time hybrid system, it can flexibly adjust the size of the processed plaintext block and the length of the hash value according to the actual needs. The experimental results show that the HFGCS solution has good clear-text sensitivity and confusion diffusion ability, and the related comparison also shows its good performance. The hybrid Hash function provides a tool for the public key cryptography and the related research. (2) The public key cryptography scheme (CEPKC) of the Chebyshev-Elgamal type of the finite field is unable to resist the selection of the defect of the ciphertext attack, and proposes two security designs of the public key password based on the Chebyshev polynomial: Both CEPKC-I and CEPKC-II can resist the selection of ciphertext attack and ensure the integrity verification of the information. Compared with the CPKC-I, the CPKC-鈪，
本文編號(hào)：2419183
[Abstract]:With the rapid development of the information process, the information security hidden danger faced by new technology applications such as cloud computing and big data is increasing, and the password becomes the key technology to ensure information security. Due to the increasing complexity of the communication environment and the continuous improvement of the decoding ability, some traditional cipher algorithms have been breached or the security is threatened. It is a kind of random behavior that is produced by the system, which has the characteristics of extreme sensitivity and long-term unpredictability to the initial conditions and system parameters, and satisfies the confusion and diffusion principle of the cipher design. At present, the research of hybrid cryptography is relatively weak in the key cryptography, packet cipher, and so on. This paper studies the code of the public key based on Chebyshev polynomial, which involves the design of the hash function, the security structure of the public key's password, the design of the digital signature and the key exchange protocol, and the application of the public key code in the encryption of the hybrid image. The main results are as follows: (1) a Hash function design scheme (HFGCS) with a parallel structure is proposed based on a global coupling space-time hybrid system, it can flexibly adjust the size of the processed plaintext block and the length of the hash value according to the actual needs. The experimental results show that the HFGCS solution has good clear-text sensitivity and confusion diffusion ability, and the related comparison also shows its good performance. The hybrid Hash function provides a tool for the public key cryptography and the related research. (2) The public key cryptography scheme (CEPKC) of the Chebyshev-Elgamal type of the finite field is unable to resist the selection of the defect of the ciphertext attack, and proposes two security designs of the public key password based on the Chebyshev polynomial: Both CEPKC-I and CEPKC-II can resist the selection of ciphertext attack and ensure the integrity verification of the information. Compared with the CPKC-I, the CPKC-鈪，
本文編號(hào)：2419183
本文鏈接：http://sikaile.net/shoufeilunwen/xxkjbs/2419183.html
最近更新
教材專著
