Sign in
Back
Pipelining GF(P) elliptic curve cryptography computation
Conference proceeding

Pipelining GF(P) elliptic curve cryptography computation

Adnan Abdul-Aziz Gutub, Mohammad K. Ibrahim, Ahmad Kayali and IEEE
2006 IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1-3, Vol.2006, pp.93-99
International Conference on Computer Systems and Applications
01/01/2006
DOI: https://doi.org/10.1109/AICCSA.2006.205073

Abstract

Computer Science Computer Science, Artificial Intelligence Computer Science, Theory & Methods Science & Technology Technology Telecommunications
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.

Metrics

1 Record Views

Details