Scalable VLSI design for fast GF(p) montgomery inverse computation

Warning The system is temporarily closed to updates for reporting purpose.

Gutub, Adnan Abdül-Aziz and Savaş, Erkay and Kalganova, Tatiana (2006) Scalable VLSI design for fast GF(p) montgomery inverse computation. In: IEEE International Conference on Computer & Communication Engineering (ICCCE '06), Malaysia

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


This paper accelerates a scalable GF(p) Montgomery inversion hardware. The hardware is made of two parts a memory and a computing unit. We modified the original memory unit to include parallel shifting of all bits which was a task handled by the computing unit. The new hardware modeling, simulating, and synthesizing is performed through VHDL for several 160-bits designs showing interesting speedup to the inverse computation.

Item Type:Papers in Conference Proceedings
Uncontrolled Keywords:Montgomery inverse; elliptic curve cryptography; scalable hardware design.
Subjects:Q Science > QA Mathematics
ID Code:1231
Deposited By:Erkay Savaş
Deposited On:18 Dec 2006 02:00
Last Modified:30 Aug 2007 23:14

Repository Staff Only: item control page