Pipelining GF(P) Elliptic Curve Cryptography Computation

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.

• Type: Conference
• Year: 2006
• Where: AICCSA
• Authors: Adnan Abdul-Aziz Gutub, Mohammad K. Ibrahim, Ahmad Kayali
• Keywords: AICCSA 2006, Elliptic Curve, Elliptic Curve Cryptography, Elliptic Curve Point