Some algorithms related to matrices with entries in a finite field
Pablo Freyre, N. Díaz, Eberto R. Morgado · Journal of Discrete Mathematical Sciences and Cryptography · 2009
In this paper four new algorithms for matrices with entries in finite fields are defined. The first one consists in the computation of the inverse of a nonsingular matrix; the second one leads to the decision of whether a matrix is singular or not; the third one determines the rank and a maximal set of linearly independent rows in any matrix; and the fourth one computes the multiplication of two matrices. The involved operations are multiplications of polynomials, module a primitive polynomial, besides addition and multiplication in the given field.