On composition operators of Fibonacci matrix and applications of Hausdorff measure of noncompactness

The aim of the paper is introduced the composition of the two infinite matrices $\Lambda=(\lambda_{nk})$ and $\widehat{F}=\left( f_{nk} \right).$ Further, we determine the $\alpha$-, $\beta$-, $\gamma$-duals of new spaces and also construct the basis for the space $\ell_{p}^{\lambda}(\widehat{F}).$ Additionally, we characterize some matrix classes on the spaces $\ell_{\infty}^{\lambda}(\widehat{F})$ and $\ell_{p}^{\lambda}(\widehat{F}).$ We also investigate some geometric properties concerning Banach-Saks type $p.$Finally we characterize the subclasses $\mathcal{K}(X:Y)$ of compact operators by applying the Hausdorff measure of noncompactness, where $X\in\{\ell_{\infty}^{\lambda}(\widehat{F}),\ell_{p}^{\lambda}(\widehat{F})\}$ and $Y\in\{c_{0},c, \ell_{\infty}, \ell_{1}, bv\},$ and $1\leq p<\infty.$

Generalized Galois-Fibonacci Matrix Generators Pseudo-Random Sequences

The article discusses various options for constructing binary generators of pseudo-random numbers (PRN) based on the so-called generalized Galois and Fibonacci matrices. The terms "Galois matrix" and "Fibonacci matrix" are borrowed from the theory of cryptography, in which the linear feedback shift registers (LFSR) generators of the PRN according to the Galois and Fibonacci schemes are widely used. The matrix generators generate identical PRN sequences as the LFSR generators. The transition from classical to generalized matrix PRN generators (PRNG) is accompanied by expanding the variety of generators, leading to a significant increase in their cryptographic resistance. This effect is achieved both due to the rise in the number of elements forming matrices and because generalized matrices are synthesized based on primitive generating polynomials and polynomials that are not necessarily primitive. Classical LFSR generators of PRN (and their matrix equivalents) have a significant drawback: they are susceptible to Berlekamp-Messi (BM) attacks. Generalized matrix PRNG is free from BM attack. The last property is a consequence of such a feature of the BM algorithm. This algorithm for cracking classical LFSR generators of PRN solves the problem of calculating the only unknown – a primitive polynomial generating the generator. For variants of generalized matrix PRNG, it becomes necessary to determine two unknown parameters: both an irreducible polynomial and a forming element that produces a generalized matrix. This problem turns out to be unsolvable for the BM algorithm since it is designed to calculate only one unknown parameter. The research results are generalized for solving PRNG problems over a Galois field of odd characteristics.

On Skew Fibonacci Matrices

In this paper we mainly define the skew Fibonacci sequence and skew Fibonacci matrices, and give the eigenvalues of skew Fibonacci matrices. Furthermore, we present some conditions for a matrix to be a skew Fibonacci matrix.

The generalized relations among the code elements for a new complex Fibonacci matrix

In this paper, we introduce a new complex Fibonacci matrix [Formula: see text] whose elements are complex Fibonacci numbers and we developed a new coding and decoding method followed from this complex Fibonacci matrix [Formula: see text]. We establish the relations among the code matrix elements, error detection and correction for this coding theory.