@Article{cmes.2022.017898,
AUTHOR = {Mustafa Asci, Suleyman Aydinyuz},
TITLE = {k-Order Fibonacci Polynomials on AES-Like Cryptology},
JOURNAL = {Computer Modeling in Engineering \& Sciences},
VOLUME = {131},
YEAR = {2022},
NUMBER = {1},
PAGES = {277--293},
URL = {http://www.techscience.com/CMES/v131n1/46636},
ISSN = {1526-1506},
ABSTRACT = {The Advanced Encryption Standard (AES) is the most widely used symmetric cipher today. AES has an important
place in cryptology. Finite field, also known as Galois Fields, are cornerstones for understanding any cryptography.
This encryption method on AES is a method that uses polynomials on Galois fields. In this paper, we generalize
the AES-like cryptology on 2 × 2 matrices. We redefine the elements of k-order Fibonacci polynomials sequences
using a certain irreducible polynomial in our cryptology algorithm. So, this cryptology algorithm is called AES-like
cryptology on the k-order Fibonacci polynomial matrix.},
DOI = {10.32604/cmes.2022.017898}
}