KFUPM ePrints

GF(2k) Elliptic Curve Cryptographic Processor Architecture Based on Bit Level Pipelined Digit Serial Multiplication

Gutub, Adnan (2003) GF(2k) Elliptic Curve Cryptographic Processor Architecture Based on Bit Level Pipelined Digit Serial Multiplication. In: ACS/IEEE International Conference on Computer Systems and Applications (AICCSA'03), July 14-18, 2003, Tunisia.

[img]HTML (Abstract)
8Kb
[img]
Preview
PDF (Paper)
65Kb

Official URL: http://ieeexplore.ieee.org/iel5/8696/27539/0122744...

Abstract

New processor architecture for elliptic curve encryption is proposed in this paper. The architecture exploits projective coordinates to convert GF(2k) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2k) 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:Conference or Workshop Item (Paper)
Date:18 July 2003
Date Type:Publication
Subjects:Math
Computer
Systems
Electrical
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Gutub, Adnan
Email:gutub@kfupm.edu.sa
ID Code:1301
Deposited By:ADNAN ABDUL-AZIZ M. GUTUB (gutub
Deposited On:17 May 2008 08:30
Last Modified:12 Apr 2011 13:08

Repository Staff Only: item control page