【摘要】：針對嵌入式系統(tǒng)中頻繁的內(nèi)存存取影響Montgomery模乘算法效率的問題,提出了一種優(yōu)化的分離連續(xù)操作數(shù)緩存算法。該算法基于連續(xù)操作數(shù)緩存算法并進(jìn)行優(yōu)化,應(yīng)用于計(jì)算多精度乘法和約減兩部分,將整個(gè)計(jì)算分塊使得每塊內(nèi)操作數(shù)只被加載一次;為了不破壞操作數(shù)加載的連續(xù)性,在多精度乘法和約減之間采用分離集成的方式;通過動態(tài)地使用寄存器和有效的緩存操作數(shù)來減少嵌入式系統(tǒng)中算法使用內(nèi)存存取操作的總量,實(shí)現(xiàn)提高模乘算法效率的目的。實(shí)驗(yàn)結(jié)果表明:在使用MIPS64架構(gòu)的處理器上,當(dāng)模數(shù)為1 024bit時(shí),與應(yīng)用廣泛的粗粒度集成操作數(shù)掃描算法相比,該算法的效率提高了4.17%。在嵌入式系統(tǒng)中,可將該算法應(yīng)用于公鑰密碼體系中的模乘運(yùn)算,在提高模乘效率的同時(shí)提高公鑰密碼算法的運(yùn)算效率。
[Abstract]:In order to solve the problem that frequent memory access in embedded systems affects the efficiency of Montgomery modular multiplication algorithm, an optimized discrete continuous Operand buffer algorithm is proposed. The algorithm is based on the continuous Operand Cache algorithm and optimized. The algorithm is applied to the computation of multiple precision multiplication and reduction. The whole calculation block is divided so that the operands in each block are loaded only once, so that the continuity of Operand loading is not broken. In order to improve the efficiency of the modular multiplication algorithm, the method of separation and integration between multi-precision multiplication and reduction is adopted, and the total amount of memory access operations in embedded system is reduced by using registers and effective cache operands dynamically. The experimental results show that the efficiency of this algorithm is 4.1717 higher than that of coarse-grained integrated Operand scanning algorithm when the modulus is 1 024bit on the processor with MIPS64 architecture. In the embedded system, the algorithm can be applied to the modular multiplication operation in the public key cryptosystem, which not only improves the efficiency of modular multiplication, but also improves the efficiency of the public key cryptosystem.
【作者單位】： 中國科學(xué)院聲學(xué)研究所國家網(wǎng)絡(luò)新媒體工程技術(shù)研究中心;中國科學(xué)院大學(xué)電子電氣與通信工程學(xué)院;
【基金】：中國科學(xué)院戰(zhàn)略性先導(dǎo)科技專項(xiàng)課題資助項(xiàng)目(XDA06010302);中國科學(xué)院聲學(xué)研究所知識創(chuàng)新工程資助項(xiàng)目(Y154191601)
【分類號】：TP332

【相似文獻(xiàn)】

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

1 劉鐸,宋濤,戴一奇;Isomorphism and Generation of Montgomery-Form Elliptic Curves Suitable for Cryptosystems[J];Tsinghua Science and Technology;2005年02期

2 王喜成,張振華;預(yù)計(jì)算式Montgomery算法研究[J];桂林電子工業(yè)學(xué)院學(xué)報(bào);2001年03期

3 陳昭智,鄭建德;Montgomery算法在大數(shù)模冪運(yùn)算中的改進(jìn)[J];廈門大學(xué)學(xué)報(bào)(自然科學(xué)版);2004年S1期

4 李明久;季曉勇;劉鞭箭;;Montgomery算法分析與研究[J];科學(xué)技術(shù)與工程;2006年12期

5 靳蓓蓓;張仕斌;;Montgomery模冪運(yùn)算的一種改進(jìn)方案[J];長春大學(xué)學(xué)報(bào);2006年08期

6 鄧銳;周玉潔;;Montgomery逆算法的改進(jìn)和應(yīng)用[J];計(jì)算機(jī)科學(xué);2006年05期

7 李明久;;Montgomery算法分析與應(yīng)用改進(jìn)[J];計(jì)算機(jī)工程與應(yīng)用;2007年01期

8 王金榮;周，

本文編號：2241654