KFUPM ePrints

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

Gutub, Adnan and Ibrahim, Mohammad K. (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)
11Kb
[img]
Preview
PDF (Paper)
149Kb

Official URL: http://portal.acm.org/citation.cfm?id=764870&jmp=c...

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)
Date:29 April 2003
Date Type:Publication
Subjects:Math
Computer
Systems
Electrical
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Gutub, Adnan and Ibrahim, Mohammad K.
Email:gutub@kfupm.edu.sa, ibrahim@dmu.ac.uk
ID Code:1309
Deposited By:ADNAN ABDUL-AZIZ M. GUTUB (gutub
Deposited On:18 May 2008 10:41
Last Modified:12 Apr 2011 13:08

Repository Staff Only: item control page