Affiliation:
1. İZMİR DEMOKRASİ ÜNİVERSİTESİ
Abstract
The amount of information transmitted over the internet network has dramatically increased with the prevailing of internet use. As a result of this increase, the algorithms used in data encryption methods have gained importance. In this paper, h(x)-Fibonacci coding/decoding method for h(x)-Fibonacci polynomials is introduced. The proposed method is fast because it is based on basic matrix operations, and it is suitable for cryptographic applications because it uses the ASCII character encoding system. For this reason, it differs from the classical algebraic methods in literature. Furthermore, the fact that h(x) is a polynomial improves the security of cryptography.
Publisher
Balikesir Universitesi Fen Bilimleri Enstitusu Dergisi
Reference26 articles.
1. Lee, G., Asci, M., Some properties of the (p,q)-Fibonacci and (p,q)-Lucas polynomials, J. Appl. Math, 264842, (2012).
2. Simsek, Y. Construction of general forms of ordinary generating functions for more families of numbers and multiple variables polynomials, Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 117, 3, 130, (2023).
3. Zhang, C., Khan, W. A. and Kızılateş, C., On (p,q)–Fibonacci and (p,q)–Lucas Polynomials Associated with Changhee Numbers and Their Properties, Symmetry, 15(4), 851, (2023).
4. Prasad, B., Coding theory on Lucas p -numbers, Discrete Math. Algorithms Appl., 17,8, no.4, 17 pages, (2016).
5. Basu, M. and Prasad, B., The generalized relations among the code elements for Fibonacci coding theory, Chaos Solitons Fractals, 41, 5, 2517-2525, (2009).