KFUPM ePrints

Parallelizing GF(P) Elliptic Curve Cryptography Computations for Security and Speed

Gutub, Adnan and Ibrahim, Mohammad K. and Al-Somani, Turki Faisal (2007) Parallelizing GF(P) Elliptic Curve Cryptography Computations for Security and Speed. In: International Conference on Information Sciences, Signal Processing and their Applications (ISSPA), February 12-15, 2007, Sharjah, United Arab Emirates.

[img]HTML (Abstract)
7Kb
[img]
Preview
PDF (Paper)
121Kb

Official URL: http://www.isspa07.org/ISSPA07_ProgramGuide_final_...

Abstract

The elliptic curve cryptography can be observed as two levels of computations, upper scalar multiplication level and lower point operations level. We combine the inherited parallelism in both levels to reduce the delay and improve security against the simple power attack. The best security and speed performance is achieved when parallelizing the computation to eight parallel multiplication operations. This strategy is worth considering since it shows very attractive performance conclusions.



Item Type:Conference or Workshop Item (Paper)
Date:15 February 2007
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. and Al-Somani, Turki Faisal
Email:gutub@kfupm.edu.sa, ibrahim@dmu.ac.uk, tfsomani@uqu.edu.sa
ID Code:1289
Deposited By:ADNAN ABDUL-AZIZ M. GUTUB (gutub
Deposited On:17 May 2008 08:33
Last Modified:12 Apr 2011 13:08

Repository Staff Only: item control page