k-Order Fibonacci Polynomials on AES-Like Cryptology  

作　　者：Mustafa Asci Suleyman Aydinyuz 

机构地区：[1]Pamukkale University,Kinikli,Denizli,20160,Turkey

出　　处：《Computer Modeling in Engineering & Sciences》2022年第4期277-293,共17页工程与科学中的计算机建模（英文）

基　　金：This work is supported by the Scientific Research Project(BAP)2020FEBE009,Pamukkale University,Denizli,Turkey.

摘　　要：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 

分 类 号：O15[理学—数学]