GCD OF AUNU BINARY POLYNOMIALS OF CARDINALITY SEVEN USING EXTENDED EUCLIDEAN ALGORITHM

Finite fields is considered to be the most widely used algebraic structures today due to its applications in cryptography, coding theory, error correcting codes among others. This paper reports the use of extended Euclidean algorithm in computing the greatest common divisor (gcd) of Aunu binary polynomials of cardinality seven. Each class of the polynomial is permuted into pairs until all the succeeding classes are exhausted. The findings of this research reveals that the gcd of most of the pairs of the permuted classes are relatively prime. This results can be used further in constructing some cryptographic architectures that could be used in design of strong encryption schemes