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

(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)
C_p.htm

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

Download (124kB) | Preview

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)
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:33
Last Modified: 01 Nov 2019 16:26
URI: http://eprints.kfupm.edu.sa/id/eprint/1289