Event Details

Extended Euclidean and Itoh-Tsujii Algorithms in GF(2m) using polynomial bases

Presenter: Fan Zhou
Supervisor:

Date: Wed, January 24, 2018
Time: 10:00:00 - 11:00:00
Place: EOW 230

ABSTRACT

ABSTRACT: Finite field arithmetic is important for the field of information security. The inversion operation consumes most of the time and resources among all finite field arithmetic operations. Two main classes of algorithms for inversion are studied. The first class of inverters is Extended Euclidean based inverters. Extended Euclidean Algorithm is an extension of Euclidean algorithm that computes the greatest common divisor. The other class of inverters is based on Fermat's little theorem. This class of inverters is also called multiplicative based inverters, because, in these algorithms, the inversion is performed by a sequence of multiplication operations and squaring.