Power-time flexible architecture for GF(2k) elliptic curve cryptosystem computation

(2003) Power-time flexible architecture for GF(2k) elliptic curve cryptosystem computation. In: The 13th ACM Great Lakes Symposium on VLSI, April 28 - 29, 2003, Washington, D. C., USA.

[img] HTML (Abstract)
C_h.htm

Download (11kB)
[img]
Preview
PDF (Paper)
C_H.pdf

Download (153kB) | Preview

Abstract

New elliptic curve cryptographic processor architecture is presented that result in considerable reduction in power consumption as well as giving a range of trade-off between speed and power consumption. This is achieved by exploiting the inherent parallelism that exist in elliptic curve point addition and doubling. Further trade-off is achieved by using digit serial-parallel multipliers instead of the serial-serial multipliers used in conventional architectures. In effect, the new architecture exploits parallelism at the algorithm level as well as at the arithmetic element level. This parallelism can be exploited either to increase the speed of operation or to reduce power consumption by reducing the frequency of operation and hence the supply voltage.

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