Galois field, has an important position in cryptology. Advanced Encryption Standard (AES) also used in polynomial
operations. In this paper, we consider the polynomial operations on the Galois fields, the Fibonacci polynomial sequences.
Using a certain irreducible polynomial, we redefine the elements of Fibonacci polynomial sequences to use in our
cryptology algorithm. So, we find the classical AES-like cryptology via the Fibonacci polynomial matrix. Successful
results were achieved with the method used.