Least Significant Bit Steganography using Hitzl-Zele Chaotic Map

We propose a novel least significant bit steganography algorithm based on a Hitzl-Zele chaotic function. Exact study has been provided on the novel scheme using visual inspection, peak signal-to-noise ratio, and histogram analysis. The experimental data show excellent performance of the novel stego technique

Randomness properties of sequence generated using logistic map with novel permutation and substitution techniques

In this paper, a design of a chaos-based keystream generator (KSG) using a novel permutation technique with various two-dimensional patterns and a substitution technique with Z4 mapping is proposed. Initially, a chaotic function such as a logistic map is used to generate a pseudo-random number. Then these numbers are converted into binary sequences using binary mapping. In order to achieve statistical properties of the resultant binary sequences, a novel method of KSG is developed by considering parameters such as initial value “x0”, system parameter “r”, novel permutation techniques defined by 2-dimensional patterns, and substitution technique defined over Z4 transformation. The binary sequences so obtained are subjected to randomness tests by applying the National Institute of Standards and Technology (NIST) SP-800-22 (Revision 1a) test suite for investigation of its randomness properties to obtain suitable sequences which can be used as a key for cryptographic applications. From the results obtained, it is found that the binary sequences exhibit better randomness properties as per the cryptographic requirements

From continuous-time chaotic systems to pseudo random number generators: Analysis and generalized methodology

The use of chaotic systems in electronics, such as Pseudo-Random Number Generators (PRNGs), is very appealing. Among them, continuous-time ones are used less because, in addition to having strong temporal correlations, they require further computations to obtain the discrete solutions. Here, the time step and discretization method selection are first studied by conducting a detailed analysis of their effect on the systems’ statistical and chaotic behavior. We employ an approach based on interpreting the time step as a parameter of the new “maps”. From our analysis, it follows that to use them as PRNGs, two actions should be achieved (i) to keep the chaotic oscillation and (ii) to destroy the inner and temporal correlations. We then propose a simple methodology to achieve chaos-based PRNGs with good statistical characteristics and high throughput, which can be applied to any continuous-time chaotic system. We analyze the generated sequences by means of quantifiers based on information theory (permutation entropy, permutation complexity, and causal entropy × complexity plane). We show that the proposed PRNG generates sequences that successfully pass Marsaglia Diehard and NIST (National Institute of Standards and Technology) tests. Finally, we show that its hardware implementation requires very few resources.Fil: de Micco, Luciana. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata. Instituto de Investigaciones Científicas y Tecnológicas en Electrónica. Universidad Nacional de Mar del Plata. Facultad de Ingeniería. Instituto de Investigaciones Científicas y Tecnológicas en Electrónica; ArgentinaFil: Antonelli, Maximiliano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata. Instituto de Investigaciones Científicas y Tecnológicas en Electrónica. Universidad Nacional de Mar del Plata. Facultad de Ingeniería. Instituto de Investigaciones Científicas y Tecnológicas en Electrónica; ArgentinaFil: Rosso, Osvaldo Anibal. Universidade Federal de Alagoas; Brasi