THE CLASSICAL AES-LIKE CRYPTOLOGY VIA THE FIBONACCI POLYNOMIAL MATRIX

Abstract

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.

Keywords

• Fibonacci numbers
• Fibonacci polynomial numbers
• Cassini identity
• Fibonacci matrix
• Galois field

References

1. Uçar, S , Taş, N., and Özgür, N. (2019). "A New Application to Coding Theory via Fibonacci and Lucas Numbers". MSAEN 7: 62-70.
2. Paar, C., and Pelzl, J. (2009). “Understanding cryptography: a textbook for students and practitioners.” Springer Science, Business Media.
3. Koshy, T. (2018). “Fibonacci and Lucas Numbers with Applications.” Volume 1, John Wiley & Sons, New Jersey.
4. Koshy, T. (2019). “Fibonacci and Lucas Numbers with Applications.” Volume 2, John Wiley & Sons, New Jersey.
5. Stewart, I. (1990). “Galois theory.” Chapman and Hall/CRC.
6. Klima, R. E., and Sigmon, N. P. (2012). “Cryptology: classical and modern with maplets.” Chapman and Hall/CRC.
7. Daemen,, J., and Rijmen, V. (2003). "AES Proposal: Rijndael". National Institute of Standards and Technology. p. 1. Archived from the original on 5 March 2013. Retrieved 21 February 2013.
8. Avaroğlu, E., Koyuncu, I., Özer, A. B., and Türk, M. (2015). “Hybrid pseudo-random number generator for cryptographic systems.” Nonlinear Dynamics, 82(1-2), 239-248.