We propose a novel image encryption algorithm based on two pseudorandom bit generators: Chebyshev map based and rotation equation based. The first is used for permutation, and the second one for substitution operations. Detailed security analysis has been provided on the novel image encryption algorithm using visual testing, key space evaluation, histogram analysis, information entropy calculation, correlation coefficient analysis, differential analysis, key sensitivity test, and computational and complexity analysis. Based on the theoretical and empirical results the novel image encryption scheme demonstrates an excellent level of security.

In this paper, a new cryptographic method is proposed, designed for audio files’ security. The encryption algorithm is based on classic symmetric models using pseudo-random number generator composed with chaotic circle map and modified rotation equations. The scheme of a new pseudo-random generator is presented and used as basis for chaotic bit-level permutations and substitutions applied to audio files structure for successful encryption. The audio encryption and decryption algorithms are described and explained. Proving the high level of security we provide extensive cryptographic analysis including key sensitivity analysis, key-space analysis, waveform and spectrogram analysis, correlation analysis, number of sample change rate analysis, level of noise analysis and speed performance test.

We present a novel image encryption algorithm using Chebyshev polynomial based on permutation and substitution and Duffing map based on substitution. Comprehensive security analysis has been performed on the designed scheme using key space analysis, visual testing, histogram analysis, information entropy calculation, correlation coefficient analysis, differential analysis, key sensitivity test, and speed test. The study demonstrates that the proposed image encryption algorithm shows advantages of more than 10113 key space and desirable level of security based on the good statistical results and theoretical arguments.

The chaotic map based pseudo-random number generators with good statistical properties have been widely used in modern cryptography algorithms. This paper proposes a Tinkerbell map as a novel pseudorandom number generator. We evaluated the proposed approach with various statistical packages: NIST, DIEHARD and ENT. The results of the analysis demonstrate that the new derivative bit stream scheme is very suitable for embedding in critical cryptographic applications.

Abstract-We propose a novel least significant bit steganography algorithm based on a Hitzl-Zele chaotic function. On the first step a pseudorandom generator is constructed for chaotic pixel selection for hiding the secret message. 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.