2005 IEEE International Symposium on Circuits and Systems
DOI: 10.1109/iscas.2005.1465668
|View full text |Cite
|
Sign up to set email alerts
|

A New RSA Encryption Architecture and Hardware Implementation based on Optimized Montgomery Multiplication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
39
0
1

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 28 publications
(40 citation statements)
references
References 13 publications
0
39
0
1
Order By: Relevance
“…Therefore, we can have those operations concurrently executed for the two signed-digit segments. Furthermore, we can have the proposed improved MSD-CMM algorithm work more efficiently over signeddigit recoding arithmetic in massively parallel computing design for cryptographic hardware implementation [24].…”
Section: Discussionmentioning
confidence: 99%
“…Therefore, we can have those operations concurrently executed for the two signed-digit segments. Furthermore, we can have the proposed improved MSD-CMM algorithm work more efficiently over signeddigit recoding arithmetic in massively parallel computing design for cryptographic hardware implementation [24].…”
Section: Discussionmentioning
confidence: 99%
“…When implemented on Xilinx XC2V4000 for k = 1024 , the maximum frequency achieved becomes 129.05 MHz; the total time 7.95 μs, and the throughput rate 128.80 Mb/s. As shown in Table 1, the resulting throughput rates are faster than [21,22,23], and almost the same speed as [24], which are also architectures using CSAs to realize Montgomery multipliers. Addition with CRPA takes k/w clock cycles, where k is the key length and w is the word length of CRPA.…”
Section: Ensure: (T C T S) = (Xc Xs) (Y C Y S) Rmentioning
confidence: 97%
“…Therefore, this modular multiplication algorithm is timeconsuming algorithm [11,17]. To further improve the performance of Montgomery modular multiplication algorithm, several computational techniques and hardware implementation have been proposed such as [7,9,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27 ]. One of the efficient modular multiplication algorithms is KPartition Montgomery Modular Multiplication (KPM3) algorithm [7].…”
Section: Preliminariesmentioning
confidence: 99%
“…Although hardware implementation of the binary Montgomery modular multiplication is simple, but it is time-consuming operation. To improve the performance of Montgomery modular multiplication algorithm and architecture, several hardware implementation method and computational techniques have been developed that can be categories into four groups: using high-radix technique [11][12][13][14][15][16][17], using systolic array architecture [18][19][20], using carry-save addition architecture [11,16,21,22,23], and using scalable architecture [9,12,24,25,26,27].…”
Section: Introductionmentioning
confidence: 99%