KFUPM ePrints

GF(2 K) elliptic curve cryptographic processor architecture based n bit level pipelined digit serial multiplication

Gutub, A.A.-A. (2003) GF(2 K) elliptic curve cryptographic processor architecture based n bit level pipelined digit serial multiplication. Computer Systems and Applications, 2003. Book of Abstracts. ACS/IEEE International conference, 1.

[img]
Preview
PDF
18Kb
[img]Microsoft Word
26Kb

Abstract

Summary form only given. New processor architecture for elliptic curve encryption is proposed. The architecture exploits projective coordinates to convert GF(2 k) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2 k) multipliers implemented using bit-level pipelined digit serial computation. It is shown that this results in a faster operation than using fully parallel multipliers with the added advantage of requiring less area. The proposed architecture is a serious contender for implementing data security systems based on elliptic curve cryptography.



Item Type:Article
Date:July 2003
Date Type:Publication
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Gutub, A.A.-A.
ID Code:14737
Deposited By:KFUPM ePrints Admin
Deposited On:24 Jun 2008 16:47
Last Modified:12 Apr 2011 13:16

Repository Staff Only: item control page