Gutub, A.A.A. and Amin, A.A.M. (1999) An expandable Montgomery modular multiplication processor. Microelectronics, 1999. ICM '99. The Eleventh International conference, 1.
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_pdf.png)
| PDF 17Kb | |
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_msword.png) | Microsoft Word 25Kb |
Abstract
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).
| Item Type: | Article |
|---|---|
| Date: | November 1999 |
| Date Type: | Publication |
| Subjects: | Computer |
| Divisions: | College Of Computer Sciences and Engineering > Computer Engineering Dept |
| Creators: | Gutub, A.A.A. and Amin, A.A.M. |
| ID Code: | 14541 |
| Deposited By: | KFUPM ePrints Admin |
| Deposited On: | 24 Jun 2008 16:39 |
| Last Modified: | 12 Apr 2011 13:17 |
Repository Staff Only: item control page