| Budget Amount *help |
¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2013: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
New algorithms using minimal signed-digit (SD) number representation for the residue exponential operations with long word length were presented. A binary recoding method for the SD number is used for implementing the residue additions. By applying the recoding and the minimal signed-digit number representation, the residue addition circuit performance was modified. The proposed residue arithmetic circuits can be applied for the implementation of the RSA encryption with very long word length. To reduce the complexity of the residue operations, an efficient algorithm has been also proposed to obtain the minimal signed-digit number representations.
The design and simulation results show that high-speed exponential operations can be implemented by the proposed method.
|
