The confirming of security and confidentiality of multimedia data is a serious challenge through the growing dependence on digital communication. This paper offers a new image cryptography based on the Chebyshev chaos polynomials map, via employing the randomness characteristic of chaos concept to improve security. The suggested method includes block shuffling, dynamic offset chaos key production, inter-layer XOR, and block 90 degree rotations to disorder the correlations intrinsic in image. The method is aimed for efficiency and scalability, accomplishing  complexity order for n-pixels over specific cipher rounds. The experiment outcomes depict great resistant to cryptanalysis attacks, containing statistical, differential and brut

The research is an article that teaches some classes of fully stable Banach - Å modules. By using Unital algebra studies the properties and characterizations of all classes of fully stable Banach - Å modules. All the results are existing, and they've been listed to complete the requested information.

     This article is devoted to presenting results on invariant approximations over a non-star-shsped weakly compact subset of a complete modular space by introduced a new notion called S-star-shaped with center f:  if   be a mapping and , . Then the existence of common invariant best approximation is proved for Banach operator pair of mappings by combined the hypotheses with Opial’s condition or demi-closeness condition

Speech encryption approaches are used to prevent eavesdropping, tracking, and other security concerns in speech communication. In this paper, a new cryptography algorithm is proposed to encrypt digital speech files. Initially, the digital speech files are rearranged as a cubic model with six sides to scatter speech data. Furthermore, each side is encrypted by random keys that are created by using two chaotic maps (Hénon and Gingerbread chaotic maps). Encryption for each side of the cube is achieved, using the based map vector that is generated randomly by using a simple random function. Map vector that consists of six bits, each bit refers to one of the specific chaotic maps that generate a random key to encrypt each face of the cube. R

Let be a ring with 1 and D is a left module over . In this paper, we study the relationship between essentially small quasi-Dedekind modules with scalar and multiplication modules. We show that if D is a scalar small quasi-prime -module, thus D is an essentially small quasi-Dedekind -module. We also show that if D is a faithful multiplication -module, then D is an essentially small prime -module iff is an essentially small quasi-Dedekind ring.

       In recent years, encryption technology has been developed rapidly and many image encryption methods have been put forward. The chaos-based image encryption technique is a modern encryption system for images. To encrypt images, it uses random sequence chaos, which is an efficient way to solve the intractable problem of simple and highly protected image encryption. There are, however, some shortcomings in the technique of chaos-based image encryption, such limited accuracy issue. The approach focused on the chaotic system in this paper is to construct a dynamic IP permutation and S-Box substitution by following steps. First of all, use of a new IP table for more diffusion of al

The behaviour of certain dynamical nonlinear systems are described in term as chaos, i.e., systems' variables change with the time, displaying very sensitivity to initial conditions of chaotic dynamics. In this paper, we study archetype systems of ordinary differential equations in two-dimensional phase spaces of the Rössler model. A system displays continuous time chaos and is explained by three coupled nonlinear differential equations. We study its characteristics and determine the control parameters that lead to different behavior of the system output, periodic, quasi-periodic and chaos. The time series, attractor, Fast Fourier Transformation and bifurcation diagram for different values have been described.

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app