Construction of nonlinear component of block cipher using coset graph

In recent times, the research community has shown interest in information security due to the increasing usage of internet-based mobile and web applications. This research presents a novel approach to constructing the nonlinear component or Substitution Box (S-box) of block ciphers by employing coset graphs over the Galois field. Cryptographic techniques are employed to enhance data security and address current security concerns and obstacles with ease. Nonlinear component is a keystone of cryptography that hides the association between plaintext and cipher-text. Cryptographic strength of nonlinear component is directly proportional to the data security provided by the cipher. This research aims to develop a novel approach for construction of dynamic S-boxes or nonlinear components by employing special linear group $PSL(2,\mathbb{Z})$ over the Galois Field $GF\left(2^{10}\right)$. The vertices of coset diagram belong to $GF\left(2^{10}\right)$ and can be expressed as powers of α, where α represents the root of an irreducible polynomial $p\left(x\right)=x^{10}+x^3+1$. We constructed several nonlinear components by using ${GF}^{\ast }\left(2^{10}\right)$. Furthermore, we have introduced an exceptionally effective algorithm for optimizing nonlinearity, which significantly enhances the cryptographic properties of the nonlinear component. This algorithm leverages advanced techniques to systematically search for and select optimal S-box designs that exhibit improved resistance against various cryptographic attacks.