Parallelization of Two Arithmetic Operations over Finite Field GF(2ⁿ)

This paper presents two parallel algorithms of basic arithmetic operations concerning multiple-precision integers over finite field GF(2n). The parallel algorithms of reduction operation and inversion-multiplication operation are designed by analyzing their data dependencies. Time complexities of th...

Full description

Saved in:
Bibliographic Details
Published inInternational Journal of Security and Its Applications Vol. 6; no. 2; pp. 223 - 228
Format Journal Article
LanguageEnglish
Published 30.04.2012
Subjects
inversion-multiplic
finite field GF(2n)
reduction
parallel algorithm
Online AccessGet full text
ISSN1738-9976

Cover

More Information
Summary:This paper presents two parallel algorithms of basic arithmetic operations concerning multiple-precision integers over finite field GF(2n). The parallel algorithms of reduction operation and inversion-multiplication operation are designed by analyzing their data dependencies. Time complexities of the parallel algorithms and the sequential algorithms are calculated to make the quantitative comparison. The performance evaluation shows high efficiencies of the proposed parallel algorithms.
ISSN:1738-9976