SavedAdd your journal

Journals / Turkish Journal of Engineering / 2026 / Volume: 4 Issue: 3

THE CLASSICAL AES-LIKE CRYPTOLOGY VIA THE FIBONACCI POLYNOMIAL MATRIX

Erdinç Avaroğlu(MERSIN UNIVERSITY)0000-0003-1976-2526
Orhan Dişkaya0000-0001-5698-7834
Hamza Menken0000-0003-1194-3162
Pages
—
Publication Date
2020-07-01
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Successful results were achieved with the method used.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Galois field, has an important position in cryptology.
📊
Key Findings & Data:Advanced Encryption Standard (AES) also used in polynomial operations.
💡
Conclusion & Impact:Successful results were achieved with the method used.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Fibonacci numbers · Fibonacci polynomial numbers · Cassini identity

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.

🔖

Cite This Article

Avaroğlu, E., Dişkaya, O., Menken, H. (2020). THE CLASSICAL AES-LIKE CRYPTOLOGY VIA THE FIBONACCI POLYNOMIAL MATRIX. Turkish Journal of Engineering, Volume: 4 Issue: 3. https://doi.org/10.31127/tuje.646926

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (9)

  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.
  9. 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.