Nanofluids are potential heat transfer fluids with improved thermophysical properties and heat transfer performance. Double diffusion convection plays an important role in natural processes and technical applications. The effect of double convection by diffusion is not limited to oceanography, but is also evident in geology, astrophysics, and metallurgy. For such a vital role of such factors in applications, the authors have presented the analytical solutions of pumping flow of third-grade nanofluid and described the effects of double diffusion convection through a compliant curved channel. The model used for the third-grade nanofluid includes the presence of Brownian motion and thermophoresis. Additionally, thermal energy expressions suggest regular diffusion and cross-diffusion terms. The governing equations have been constructed for incompressible laminar flow of the non-Newtonian nanofluid along with the assumption of long wavelength. The obtained analytical expressions for velocity, temperature, and nanoparticle concentration have been sketched for various considerable parameters. The effects of regular buoyancy ratio, buoyancy parameter, modified Dufour parameter, and Dufour-solutal Lewis number have been analyzed along with wall properties and pumping characteristics. This study concludes that fluid becomes hotter with increase in regular buoyancy ratio and a modified Dufour parameter, but a decrease in temperature is observed for the buoyancy parameter. Moreover, the solutal concentration is behaving inversely against the Defour-Solutal Lewis number.

The success of AES encryption standard created challenges for the cryptographers to construct strong substitution-boxes using different underlying approaches. It is because they are solely responsible to decide the robustness of cryptosystem against linear and differential cryptanalyses. With an aim to fulfill the mentioned requirement of robustness, a novel group theoretic and graphical method is proposed to construct S-box with optimal features. Firstly, a strong S-box is generated with the help of orbits of coset graphs and the action of proposed powerful permutation of symmetric group S256. In addition, a specific group is designed the action of whose pairs of permutations has the ability to generate as many as 462422016 strong S-boxes. Few of such proposed S-boxes are reported and assessed against standard performance parameters to validate the effectiveness of proposed findings. The features of proposed S-boxes are compared with most of the recent S-boxes to validate the superior performance. Moreover, they are also applied for image encryption to demonstrate their suitability for multimedia security applications.

The substitution box is a basic tool to convert the plaintext into an enciphered format. In this paper, we use coset diagram for the action of PSL(2,Z) on projective line over the finite field GF29 to construct proposed S-box. The vertices of the cost diagram are elements of GF29 which can be represented by powers of α, where α is the root of irreducible polynomial px=x9+x4+1 over Z2. Let GF⁎29 denote the elements of GF29 which are of the form of even powers of α. In the first step, we construct a 16×16 matrix with the elements of GF⁎29 in a specific order, determined by the coset diagram. Next, we consider h:GF⁎29⟶GF28 defined by hα2n=ωn to destroy the structure of GF28. In the last step, we apply a bijective map g on each element of the matrix to evolve proposed S-box. The ability of the proposed S-box is examined by different available algebraic and statistical analyses. The results are then compared with the familiar S-boxes. We get encouraging statistics of the proposed box after comparison.

This paper proposes to present a novel group theoretic approach of improvising the cryptographic features of substitution-boxes. The approach employs a proposed finite Abelian group of order 3720 with three generators and six relations. The pre and post-action of the new Abelian group on some nonlinear schemes is analyzed and investigated. It has been found that post-action is competent to construct substitution-boxes whose cryptographic strengths are quite better compared to them before the group action. The S-box strength improvisation has been perceived on multiple performance parameters including nonlinearity, differential uniformity, bits independent criteria, linear approximation probability, and auto-correlation functions along with the satisfaction of strict avalanche criteria. The suitability of proposed improved S-box is tested for image encryption applications under the majority logic criterions and differential analyses. The conducted statistical investigations demonstrated the proficiency of anticipated group action approach and its suitability for cryptographic usages.

Protection of sensitive information has been always the major security concern since decades to withstand against illegitimate access and usage. Substitution-boxes (S-boxes) are vital components of any modern day cryptographic system that allows us to ensure its resistance to attacks. The prime problem with creating S-box is that we are generally unable to discover a consistent distribution among its numerous features to withstand diverse cryptanalysis attacks. The majority of S-boxes investigated in the literature has good cryptographic defenses against some attacks but are susceptible to others. Keeping these considerations in mind, this paper proposes a novel approach for S-box design based on a pair of coset graphs and a newly defined operation of row and column vectors on a square matrix. Several standard performance assessment criteria are used to evaluate the reliability of proposed approach, and the results demonstrate that the developed S-box satisfies all criterions for being robust for secure communication and encryption.

Due to privacy and sensitivity of the medical images, the creation of strong medical image encryption schemes has gained the attention of cryptographers. In this study, a robust medical image encryption scheme is developed involving a fuzzy subset of integers from 1 to 256 characterized by membership values. The S-box entries are determined using a precise mathematical formulation. Various standard analyses are performed to check the reliability and security of the newly devised S-box. Furthermore, this newly devised S-box is utilized to design proposed encrypting technique. A thorough benchmarking analysis that is specifically designed for image encryption schemes has been conducted in order to assess the algorithm’s performance. The findings of these analyses obtained through the proposed scheme, in comparison to some recently developed image encryption schemes; show that the proposed approach exhibits exceptional attributes and formidable cryptographic potency. Consequently, the algorithm not only showcases remarkable effectiveness but also holds great promise in the realm of securing medical images for telemedicine.