Pipelining GF(P) Elliptic Curve Cryptography Computation

(2006) Pipelining GF(P) Elliptic Curve Cryptography Computation. In: The 4th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA-06), March 8-11, 2006, American University of Sharjah (AUS), Sharjah, United Arab Emirates.

[img] HTML (Abstract)

Download (7kB)
PDF (Paper)

Download (353kB) | Preview


This paper proposes a new method to compute Elliptic Curve Cryptography in Galois Fields GF(p). The method incorporates pipelining to utilize the benefit of both parallel and serial methodology used before. It allows the exploitation of the inherited independency that exists in elliptic curve point addition and doubling operations. The results showed attraction because of its improvement over many parallel and serial techniques of elliptic curve crypto-computations.

Item Type: Conference or Workshop Item (Paper)
Subjects: Math
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: ADNAN ABDU GUTUB (gutub
Date Deposited: 17 May 2008 05:32
Last Modified: 01 Nov 2019 13:26
URI: http://eprints.kfupm.edu.sa/id/eprint/1292