Chaotic substitution for highly autocorrelated data in encryption algorithm

• A major drawback in substitution process of encryption algorithms is pointed out.
• A novel chaotic substitution technique has been proposed.
• Analyses of proposed technique and existing technique have been carried out.

This paper addresses the major drawback of substitution-box in highly auto-correlated data and proposes a novel chaotic substitution technique for encryption algorithm to sort the problem. Simulation results reveal that the overall strength of the proposed technique for encryption is much stronger than most of the existing encryption techniques. Furthermore, few statistical security analyses have also been done to show the strength of anticipated algorithm.