Iqtadar Hussain

Analyses of S-boxes based on interval valued intuitionistic fuzzy sets and image encryption

Decision making implies selection of the best decision from a set of possible options. In some cases, this selection is based on past experience. Past experience is used to analyse the situations and the choice made in these situations. The aim of this work is to analyse the strength of the nonlinear component (S-box) of block cipher for image encryption applications based on Interval Valued Intuitionistic Fuzzy Sets (IVIFS). S-box is the only component in every block cipher which creates confusion in the data. First, we transform the three dimensional matrix corresponding to colour image with the help of nonlinear component and then use the algebraic structure of IVIFS to choose the best substitution box for image encryption based on entropy, contrast, homogeneity, correlation, energy and mean of absolute devotion. The analyses show that the readings of S8 S-box is very good for image data.

An algorithm for the construction of substitution box for block ciphers based on projective general linear group

The aim of this work is to synthesize 8*8 substitution boxes (S-boxes) for block ciphers. The confusion creating potential of an S-box depends on its construction technique. In the first step, we have applied the algebraic action of the projective general linear group PGL(2,GF(28)) on Galois field GF(28). In step 2 we have used the permutations of the symmetric group S256 to construct new kind of S-boxes. To explain the proposed extension scheme, we have given an example and constructed one new S-box. The strength of the extended S-box is computed, and an insight is given to calculate the confusion-creating potency. To analyze the security of the S-box some popular algebraic and statistical attacks are performed as well. The proposed S-box has been analyzed by bit independent criterion, linear approximation probability test, non-linearity test, strict avalanche criterion, differential approximation probability test, and majority logic criterion. A comparison of the proposed S-box with existing S-boxes sho...

A Robust Watermarking Scheme for Online Multimedia Copyright Protection Using New Chaotic Map

The protection of copyrights of digital media uploaded to the Internet is a growing problem. In this paper, first, we present a unified framework for embedding and detecting watermark in digital data. Second, a new robust watermarking scheme is proposed considering this concern. The proposed work incorporates three chaotic maps which specify the location for embedding the watermark. Third, a new chaotic map, the Extended Logistic map, is proposed in this work. The proposed map has a bigger range than logistic and cubic maps. It has shown good results in a bifurcation, sensitivity to initial conditions, and randomness tests. Furthermore, with the detailed analysis of initial parameters, it is justified that Extended Logistic map can be used in secure communication, particularly watermarking. Fourth, to check the robustness of proposed watermarking scheme, we have done a series of analyses and standard attacks. The results confirm that the proposed watermarking scheme is robust against visual and statistical analysis and can resist the standard attacks.