Recent developments in the field of fluid dynamics have led to a new interest stability analysis. The numerical solution obtained from problems flow at stagnation point, as well heat transfer with MHD and thermal radiation effects over shrinking sheet, is used carry out this problem considered nanofluids Buongiorno's model employed. boundary layer equation by reducing governing equations an ord...

In this study, we examined the impact of Cu-H2O nanoparticles on two-dimensional Casson nanofluid flows past permeable stretching/shrinking sheet embedded in a Darcy-Forchheimer porous medium presence slipperiness surface, suction/injection, viscous dissipation, and convective heating. Using some realistic assumptions appropriate similarity transformations, governing nonlinear partial different...

In this correspondence, it is given a correction to Theorem 4 in Y. Hu, and G. Xiao, “Generalized Self-Shrinking Generator,” IEEE Transactions on Information Theory, vol. 50, No. 4, pp. 714-719, April 2004.

In 2004, Y. Hu and G. Xiao introduced the generalized self-shrinking generator, a simple bit-stream generator considered as a specialization of the shrinking generator as well as a generalization of the self-shrinking generator. The authors conjectured that the family of generalized self-shrinking sequences took their least periods in the set {1, 2, 2}, where L is the length of the Linear Feedb...

The need of software-flexible stream ciphers has led to several alternative proposals in the last few years. One of them is a new Pseudo Random Number Generator (PRNG), named N-adic Summation-Shrinking (NSumSG), which architecture is described in this paper. It uses N-1 parallel working slave summation generators and one N-adic summation generator, controlling the nonlinearity in the generator....

This work shows that the cryptanalysis of the shrinking generator requires fewer intercepted bits than that indicated by the linear complexity. Indeed, whereas the linear complexity of shrunken sequences is between A·2(S−2) and A·2(S−1), we claim that the initial states of both component registers are easily computed with less than A · S shrunken bits. Such a result is proven thanks to the defi...

The shrinking generator is a keystream generator which is good for stream ciphers in wireless mobile communications, because it has simple structure and generates a keystream faster than other generators. Nevertheless, it has a serious disadvantage that its keystream is not balanced if they use primitive polynomials as their feedback polynomials. In this paper, we present a method to construct ...