Vol.131, No.1, 2022, pp.277-293, doi:10.32604/cmes.2022.017898
k-Order Fibonacci Polynomials on AES-Like Cryptology
  • Mustafa Asci, Suleyman Aydinyuz*
Pamukkale University, Kinikli, Denizli, 20160, Turkey
* Corresponding Author: Suleyman Aydinyuz. Email:
(This article belongs to this Special Issue: Trend Topics in Special Functions and Polynomials: Theory, Methods, Applications and Modeling)
Received 15 June 2021; Accepted 26 October 2021; Issue published 24 January 2022
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.
Fibonacci numbers; Fibonacci polynomials; k-order Fibonacci polynomials; Fibonacci matrix; k-order Fibonacci polynomial matrix; Galois field
Cite This Article
Asci,, M. (2022). k-Order Fibonacci Polynomials on AES-Like Cryptology. CMES-Computer Modeling in Engineering & Sciences, 131(1), 277–293.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.