Pipelining GF(P) elliptic curve cryptography computation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

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.

Original languageEnglish
Title of host publicationIEEE International Conference on Computer Systems and Applications, 2006
PublisherIEEE Computer Society
Pages93-99
Number of pages7
ISBN (Print)1424402123, 9781424402120
DOIs
StatePublished - 2006

Publication series

NameIEEE International Conference on Computer Systems and Applications, 2006
Volume2006

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Pipelining GF(P) elliptic curve cryptography computation'. Together they form a unique fingerprint.

Cite this