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

(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
14737_1.pdf

Download (18kB) | Preview
[img] Microsoft Word
14737_2.doc

Download (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
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: Mr. Admin Admin
Date Deposited: 24 Jun 2008 13:47
Last Modified: 01 Nov 2019 14:07
URI: https://eprints.kfupm.edu.sa/id/eprint/14737