Name
Abstract | ||
|---|---|---|
A modified Montgomery modular multiplication algorithm using four-to-two CSA (carry save adder) was proposed. The modified algorithm avoids the carry delay and the repeated output/input format conversions. We use this modified algorithm to design the RSA processing unit with 512-bit and 1024-bit key size .The resulting RSA units have a high throughput. |
Year | Venue | Keywords |
|---|---|---|
2006 | CSC | montgomery algorithm,rsa,4-2 csa,high throughput,carry save adder,modular multiplication |
Field | DocType | Citations |
Multiplication algorithm,Computer science,Montgomery reduction,Parallel computing,Kochanski multiplication,Carry-save adder | Conference | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gang Feng | 1 | 7753 | 468.09 |
| Guangsheng Ma | 2 | 10 | 7.66 |
| Zhi Yang | 3 | 9 | 5.65 |