A fast algorithm for multiplicative inversion in GF(2m) using normal basis

doi:10.1109/12.926155

A fast algorithm for multiplicative inversion in GF(2m) using normal basis

2001-05-01

63

PRE

AI

DOI：10.1109/12.926155

Original

Original request for help

Save

Abstract

En 中文

A fast algorithm for multiplicative inversion in GF(2(m)) using normal basis is proposed. It is an improvement on those proposed by Itoh and Tsujii and by Chang et al., which are based on Fermat's Theorem and require O(log m) multiplications. The number of multiplications is reduced by decomposing m - 1 into several factors and a small remainder.

Keywords:

finite field

finite field inversion

Fermat's theorem

normal basis

A fast algorithm for multiplicative inversion in GF(2m) using normal basis

Abstract

Journal

Organization