Design of modular multiplier based on improved Montgomery algorithm and systolic array

被引：7

作者：

Gang, Feng ^{[1
]}

机构：

[1] Harbin Engn Univ, Coll Comp Sci & Technol, Harbin 150001, Peoples R China

来源：

First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS 2006), Proceedings, Vol 2 | 2006年

关键词：

D O I：

10.1109/IMSCCS.2006.209

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Montgomery algorithm is widely used in public-key cryptographic algorithms. In this paper, A improved CSA is used to remove the carry chain while implementing Montgomery algorithm. It has a shorter delay. To eliminate the signal's global broadcasting, the algorithm is mapped to a systolic array. The RSA encryption / decryption chip is implemented by the modular multiplier based on Montgomery systolic array. It has a very high run speed.

引用

页码：356 / 359

页数：4

共 6 条

[1]

Huang WH, 2005, J HIGH ENERGY PHYS

[2] Systolic multiplier for Montgomery's algorithm [J].

Lee, KJ ;

Yoo, KY .

INTEGRATION-THE VLSI JOURNAL, 2002, 32 (1-2) :99-109

[3]

[雷明 Lei Ming], 2003, [计算机工程, Computer Engineering], V29, P45

[4] Modified Montgomery modular multiplication and RSA exponentiation techniques [J].

McIvor, C ;

McLoone, M ;

McCanny, JV .

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2004, 151 (06) :402-408

[5]

WANG X, 2004, J SHANGHAI JIATONG U, V38, P243

[6]

[项玮 Xiang Wei], 2004, [计算机工程与应用, Computer Engineering and Application], V40, P115

← 1 →