The main purpose of this article is to find the upper bound of the third Hankel determinant for a family of q-starlike functions which are associated with the Ruscheweyh-type q-derivative operator. The work is motivated by several special cases and consequences of our main results, which are pointed out herein.
In this research paper, a hybrid method called Laplace Adomian Decomposition Method (LADM) is used for the analytical solution of the system of time fractional Navier-Stokes equation. The solution of this system can be obtained with the help of Maple software, which provide LADM algorithm for the given problem. Moreover, the results of the proposed method are compared with the exact solution of the problems, which has confirmed, that as the terms of the series increases the approximate solutions are convergent to the exact solution of each problem. The accuracy of the method is examined with help of some examples. The LADM, results have shown that, the proposed method has higher rate of convergence as compare to ADM and HPM.
This article presents certain families of analytic functions regarding q-starlikeness and q-convexity of complex order . This introduced a q-integral operator and certain subclasses of the newly introduced classes are defined by using this q-integral operator. Coefficient bounds for these subclasses are obtained. Furthermore, the -neighborhood of analytic functions are introduced and the inclusion relations between the -neighborhood and these subclasses of analytic functions are established. Moreover, the generalized hyper-Bessel function is defined, and application of main results are discussed.
This article deals with q-starlike functions associated with conic domains, defined by Janowski functions. It generalizes the recent study of q-starlike functions while associating it with the conic domains. Certain renowned coefficient inequalities in connection with the previously known ones have been included in this work.
10 April 2018 in Security and Communication Networks
Substitution box (-box), being the only nonlinear component, contributes to the confusion creating capability of a cryptosystem. Keeping in view the predominant role of -box, many design algorithms to synthesize cryptographically stronger -boxes have gained pivotal attention. A quick review of these algorithms shows that all these ideas mainly concentrate on the choice of bijective Boolean functions, with nonobservance to the irreducible polynomial that generates the Galois field. In this paper, we propose that the selection of irreducible polynomial has a deep influence on the highly desirable features of an -box such as nonlinearity, strict avalanche, bit independence, linear approximation probability, and differential approximation probability. We underpin our claim by investigating a detailed model, which deploys the same algorithm but different polynomials and produces unusual changes in the results regarding the performance parameters of -box.
In the theory of analytic and univalent functions, coefficients of functions’ Taylor series representation and their related functional inequalities are of major interest and how they estimate functions’ growth in their specified domains. One of the important and useful functional inequalities is the Fekete-Szegö inequality. In this work, we aim to analyze the Fekete-Szegö functional and to find its upper bound for certain analytic functions which give parabolic and petal type regions as image domains. Coefficient inequalities and the Fekete-Szegö inequality of inverse functions to these certain analytic functions are also established in this work.