Skip to main navigation Skip to search Skip to main content

Parallelizing GF(P) elliptic curve cryptography computations for security and speed

  • Adnan Abdul Aziz Gutub
  • , Mohammad K. Ibrahim
  • , Turki F. Al-Somani

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

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.

Original languageEnglish
Title of host publication2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings
DOIs
StatePublished - 2007
Externally publishedYes

Publication series

Name2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings

Keywords

  • ECC
  • GF(p) arithmetic
  • Parallel elliptic curve point operations
  • Projective coordinate systems

ASJC Scopus subject areas

  • Signal Processing

Fingerprint

Dive into the research topics of 'Parallelizing GF(P) elliptic curve cryptography computations for security and speed'. Together they form a unique fingerprint.

Cite this