On Encryption by Stirling Polynomial Matrices

In this article, by examining Stirling numbers, a new matrix type containing these numbers is defined and this matrix is called Stirling matrix. Based on the fact that the use of matrices is very common and convenient in the field of encryption, we used the newly defined Stirling matrix to perform AES type encryption. Inspired by the properties of integer sequences, a new recurrence relation that gives Stirling polynomials is defined. The Stirling polynomials used in our study are associated with k-order generalized matrices. LU decomposition of this generalized matrix is performed and examined. The L matrix obtained with the help of this decomposition is used in AES-like encryption methods. In our study, the examination and verification of this algorithm are given with an application.