Sciweavers

CSC
2006

Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm

14 years 25 days ago
Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm
- 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.
Gang Feng, Guang-Sheng Ma, Zhi Yang
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2006
Where CSC
Authors Gang Feng, Guang-Sheng Ma, Zhi Yang
Comments (0)