Scalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation

(2002) Scalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation. In: IEEE Computer Society Annual Symposium on VLSI, ISVLSI’02, April 25-26, 2002, Pittsburgh, Pennsylvania, USA.

[img] HTML (Abstract)
C_j.htm

Download (7kB)
[img]
Preview
PDF (Paper)
C_J.pdf

Download (270kB) | Preview

Abstract

Modular inverse computation is needed in several public key cryptographic applications. In this work, we present two VLSI hardware implementations used in the calculation of Montgomery modular inverse operation. The implementations are based on the same inversion algorithm, however, one is fixed (fully parallel) and the other is scalable. The scalable design is the novel modification performed on the fixed hardware to make it occupy a small area and operate within better or similar speed. Both hardware designs are compared based on their speed and area. The area of the scalable design is on average 42% smaller than the fixed one. The delay of the designs, however, depends on the actual data size and the maximum numbers the hardware can handle. As the actual data size approach the hardware limit the scalable hardware speedup reduces in comparison to the fixed one, but still its delay is practical.

Item Type: Conference or Workshop Item (Paper)
Subjects: Math
Systems
Computer
Electrical
Divisions: College Of Computer Sciences and Engineering > Computer Engineering Dept
Depositing User: ADNAN ABDU GUTUB (gutub
Date Deposited: 17 May 2008 08:30
Last Modified: 01 Nov 2019 16:26
URI: http://eprints.kfupm.edu.sa/id/eprint/1302