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

[thumbnail of 3011800000633.pdf] PDF
3011800000633.pdf

Download (265kB)

Abstract

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
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Erkay Savaş
Date Deposited: 18 Dec 2006 02:00
Last Modified: 26 Apr 2022 08:33
URI: https://research.sabanciuniv.edu/id/eprint/1231

Actions (login required)

View Item
View Item