ORIGINAL ARTICLE Construction of S-box based on chaotic Boolean functions and its application in image encryption Majid Khan 1 • Tariq Shah 2 • Syeda Iram Batool 2 Received: 26 July 2014 / Accepted: 14 March 2015 Ó The Natural Computing Applications Forum 2015 Abstract In numerous encryption frameworks, the first information is changed into encoded form by applying nonlinear substitutions and affecting diffusion. The goal of the nonlinear change is to accomplish high level of ran- domness in the image content. The choice of the source of randomness is critical because the success in cryptanalysis is demarked by the characteristics identified in the en- crypted data. The chaotic frameworks show random con- duct that is suitable for encryption applications where nonlinear transformations are needed in the middle of plaintext and the scrambled information. The application of nonlinear functional chaos-based system with embedded chaotic systems and binary chaotic sequences can prompt randomness and diffusion in the information. In addition to the high state of randomness, the requirement for various round keys is needed in a run of the mill substitution– permutation process. The proposed strategy kills the re- quirement for different round keys, which is suitable for high-speed communication frameworks. The measurable analyses performed on the proposed nonlinear algorithm which show improvement in encryption quality and safety against numerous brute-force and statistical attacks. Also, the proposed framework demonstrates high safety against differential and linear cryptanalysis. Keywords Chaos  Binary chaotic sequences  Substitution box 1 Introduction In this period of fast correspondence where high quantities of clients are included in securing numerous connections and offering information, it is vital to guarantee security and information security in place manufacture trust and stay away from any unapproved access. The accomplish- ment of any correspondence frameworks lies in the capa- bility to effectively secure and scramble information prepared and exchanged among different clients. Specifically, Internet is a typical medium utilized for cor- respondence by numerous people and corporate elements. The information transmitted in various configurations and representations to which image and features help consid- erably [1–3]. In unique circumstances, the information qualities and its encryption procedure can assume an im- perative part in deciding the quality exhibited by the figure. Along these lines, an encryption system suitable for a specific sort of information may not be suitable for quali- ties with diverse organization and attributes. In media ap- plications, the measure of information volume is generally high, hence proficient and rapid encryption is obliged [4, 5]. The real-time systems additionally crave fast encryption applications, which is like sight and sound information [6– 10]. Traditional image encryption structures oblige various rounds of key era and substitution–permutation (S-P) change that is once in a while insufficient for high velocity constant correspondence frameworks [11–13]. In [14–20], we see various encryption applications relating to fast image-handling frameworks. In present work, we endeavor to streamline the en- cryption prepare by diminishing the computational many- sided quality while in the meantime expanding the en- cryption quality. The proposed encryption calculation is & Majid Khan m_khannu@yahoo.com; m_khannu@yahoomail.com 1 Department of Sciences and Humanities, National University of Computer and Emerging Sciences, Islamabad, Pakistan 2 Department of Mathematics, Quaid-i-Azam University, Islamabad, Pakistan 123 Neural Comput & Applic DOI 10.1007/s00521-015-1887-y