發(fā)布時(shí)間：2018-09-04 07:19

【摘要】：隨著計(jì)算機(jī)計(jì)算速度的飛速提升,對(duì)信息的加密強(qiáng)度也隨之提高。目前廣泛應(yīng)用的RSA(Rivest-Shamir-Adleman)算法已經(jīng)不能滿足人們?cè)诎踩阅苌系囊�。擁有更高加密�?qiáng)度的橢圓曲線加解密算法成了替代它的必然選擇。2010年12月,國(guó)家商用密碼管理辦公室發(fā)布了SM2橢圓曲線公鑰密碼算法,規(guī)定了基于橢圓曲線加密原理的SM2算法。橢圓曲線加密(Elliptic Curve Cryptography,ECC)理論于1985年提出,同RSA加密算法相比,ECC算法具有安全性能高、計(jì)算量小、處理速度快等特點(diǎn)。加解密運(yùn)算常常應(yīng)用在實(shí)時(shí)性要求較高的場(chǎng)合,快速的運(yùn)算是必然的要求,因此,提高SM2算法的運(yùn)算速度是非常重要的。在SM2算法中,需要執(zhí)行大量的加法與乘法運(yùn)算。本文采用二位元擴(kuò)域進(jìn)行運(yùn)算,在m次二位元擴(kuò)域中,加法運(yùn)算只需通過m個(gè)異或門即可實(shí)現(xiàn),而乘法運(yùn)算則需要大量的與門和異或門來共同實(shí)現(xiàn),這極大地增加了運(yùn)行時(shí)間。乘法器部分我們分析了傳統(tǒng)乘法器的架構(gòu)形式,通過對(duì)其分析構(gòu)思自己的乘法器。本文的設(shè)計(jì)目標(biāo)是設(shè)計(jì)出一種具有更短計(jì)算時(shí)間的新型乘法器,應(yīng)用在SM2算法上提高加解密過程的時(shí)間效率。本文提出了一種基于雙基底的新型乘法器,它結(jié)合PB(polynomial basis)基底和MPB(modified polynomial basis)基底,利用Toeplitz矩陣特性構(gòu)建實(shí)現(xiàn)整個(gè)乘法器。實(shí)驗(yàn)結(jié)果表明,本文提出的新型乘法器與傳統(tǒng)乘法器相比,可以節(jié)省約50%的乘法運(yùn)算時(shí)間。提升了SM2算法加解密過程的效率。
[Abstract]:With the rapid improvement of computer computing speed, the encryption intensity of information is also improved. At present, the widely used RSA (Rivest-Shamir-Adleman) algorithm can not meet the requirements of security performance. The elliptic curve encryption and decryption algorithm with higher encryption intensity has become the inevitable choice to replace it. In December 2010, the National Office of Commercial Cryptography published the SM2 elliptic curve public key cryptography algorithm, which specifies the SM2 algorithm based on elliptic curve encryption principle. The theory of elliptic curve encryption (Elliptic Curve Cryptography,ECC) was put forward in 1985. Compared with the RSA encryption algorithm, the ECC algorithm has the advantages of high security performance, low computational cost and fast processing speed. Encryption and decryption operations are often used in situations where real-time requirements are high, and fast operation is a necessary requirement. Therefore, it is very important to improve the speed of SM2 algorithm. In the SM2 algorithm, a large number of addition and multiplication operations need to be performed. In this paper, the two-bit extension field is used to perform the operation. In the m-order binary extension domain, the addition operation can only be achieved through m XOR gates, while the multiplication operation needs a large number of gate and XOR gates to implement together, which greatly increases the running time. In the part of multiplier, we analyze the architecture of traditional multiplier, and conceive our multiplier by analyzing it. The aim of this paper is to design a new multiplier with shorter computing time, which can be used in SM2 algorithm to improve the efficiency of encryption and decryption. In this paper, a new multiplier based on double bases is proposed. It combines PB (polynomial basis) base with MPB (modified polynomial basis) base, and uses the characteristic of Toeplitz matrix to construct the whole multiplier. The experimental results show that the proposed new multiplier can save about 50% of the multiplication time compared with the traditional multiplier. Improve the efficiency of SM2 encryption and decryption process.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN918.4

【相似文獻(xiàn)】

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

1 張乃千;趙文濤;楊海;劉文杰;;基于SM2算法的密鑰安全存儲(chǔ)系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)[J];信息安全與技術(shù);2014年07期

2 李崢;楊先文;田志剛;;可信密碼模塊中SM2引擎的系統(tǒng)設(shè)計(jì)[J];信息安全與通信保密;2010年12期

3 伍娟;;基于國(guó)密SM4和SM2的混合密碼算法研究與實(shí)現(xiàn)[J];軟件導(dǎo)刊;2013年08期

4 駱釗;謝吉華;顧偉;徐芳;金鈞華;;基于SM2密碼體系的電網(wǎng)信息安全支撐平臺(tái)開發(fā)[J];電力系統(tǒng)自動(dòng)化;2014年06期

5 ;[J];;年期

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

1 李絳絳;SM2橢圓曲線密碼系統(tǒng)的軟件設(shè)計(jì)與實(shí)現(xiàn)[D];青島科技大學(xué);2014年

2 白忠海;基于雙基底乘法器的SM2公鑰密碼算法研究與實(shí)現(xiàn)[D];哈爾濱工業(yè)大學(xué);2014年

3 方魏;基于商密SM2算法的輕型PKI系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)[D];西安電子科技大學(xué);2014年

，

本文編號(hào)：2221385