In this section

    An expandable Montgomery modular multiplication processor

    (1999) An expandable Montgomery modular multiplication processor. Microelectronics, 1999. ICM '99. The Eleventh International conference, 1.

    [img]
    Preview
    		 PDF
    14541_1.pdf
    Download (18kB) | Preview
    [img] Microsoft Word
    14541_2.doc
    Download (26kB)

    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
    Subjects: Computer
    Department: College of Computing and Mathematics > Computer Engineering
    Depositing User: Mr. Admin Admin
    Date Deposited: 24 Jun 2008 13:39
    Last Modified: 01 Nov 2019 14:06
    URI: http://eprints.kfupm.edu.sa/id/eprint/14541