High Radix Parallel Architecture For GF(p) Elliptic Curve Processor

(2003) High Radix Parallel Architecture For GF(p) Elliptic Curve Processor. In: IEEE Conference on Acoustics, Speech, and Signal Processing, ICASSP 2003, April 6-10, 2003, Hong Kong.

[img] HTML (Abstract)
C_e.htm

Download (8kB)
[img]
Preview
PDF (Paper)
C_E.pdf

Download (84kB) | Preview

Abstract

A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential designs, we show that projecting into (X/Z,Y/Z) leads to a much better improved performance than conventional choice of projecting into the current (X/Z^2,Y/Z^3). We also propose to use high radix modulo multipliers which give a wide range of area-time trade-offs. The proposed architecture is a significant challenger for implementing data security systems based on elliptic curve cryptography.

Item Type: Conference or Workshop Item (Paper)
Subjects: Math
Computer
Systems
Electrical
Divisions: College Of Computer Sciences and Engineering > Computer Engineering Dept
Depositing User: ADNAN ABDU GUTUB (gutub
Date Deposited: 17 May 2008 08:28
Last Modified: 01 Nov 2019 16:26
URI: http://eprints.kfupm.edu.sa/id/eprint/1305