IEEE International Conference on Computer & Communication Engineering (ICCCE '06), Faculty of Engineering, International Islamic University Malaysia, Kuala Lumpur, Malaysia, 9-11 May 2006.   


Scalable VLSI Design for Fast GF(p) Montgomery Inverse Computation


Adnan Gutub, Erkay Savas, and Tatiana Kalganova



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.


Keywords: Montgomery inverse, Elliptic curve cryptography, Scalable hardware design