Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/12223
Title: Scalable VLSI design for fast GF (p) montgomery inverse computation
Authors: Gutub, AA-A
Savaş, E
Kalganova, T
Keywords: Montgomery inverse;Elliptic curve cryptography;Scalable hardware design
Issue Date: 2006
Publisher: IEEE
Citation: IEEE International Conference on Computer & Communication Engineering, Kuala Lumpur, Malaysia, 09-11 May 2006
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.
URI: www.iiu.edu.my/iccce06/
http://bura.brunel.ac.uk/handle/2438/12223
Appears in Collections:Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf259.34 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.