An expandable Montgomery modular multiplication processor
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. A design for expandable modular multiplication hardware is proposed. This design allows for cascading the hardware if larger moduli are required. The proposed design uses a Montgomery modular multipli...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | article |
| منشور في: |
1999
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/14541/1/14541_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14541/2/14541_2.doc |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. A design for expandable modular multiplication hardware is proposed. This design allows for cascading the hardware if larger moduli are required. The proposed design uses a Montgomery modular multiplication algorithm (Koc et al, IEEE Micro, pp. 26-33, June 1996). |
|---|