Gutub, Adnan and Ibrahim, Mohammad K. and Kayali, Ahmad (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]](http://eprints.kfupm.edu.sa/style/images/fileicons/text_html.png) | HTML (Abstract) 7Kb | |
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_pdf.png)
| PDF (Paper) 344Kb |
Official URL: http://ieeexplore.ieee.org/iel5/10748/33913/016183...
Abstract
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) |
|---|---|
| Date: | 11 March 2006 |
| Date Type: | Publication |
| Subjects: | Math Computer Systems Electrical |
| Divisions: | College Of Computer Sciences and Engineering > Computer Engineering Dept |
| Creators: | Gutub, Adnan and Ibrahim, Mohammad K. and Kayali, Ahmad |
| Email: | gutub@kfupm.edu.sa, ibrahim@dmu.ac.uk, UNSPECIFIED |
| ID Code: | 1292 |
| Deposited By: | ADNAN ABDUL-AZIZ M. GUTUB (gutub |
| Deposited On: | 17 May 2008 08:32 |
| Last Modified: | 12 Apr 2011 13:08 |
Repository Staff Only: item control page