Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers

Nonlinear filter generators are commonly used as keystream generators in stream ciphers. A nonlinear filter generator utilizes a nonlinear filtering function to combine the outputs of a linear feedback shift register (LFSR) to improve the linear complexity of keystream sequences. However, the LFSR-based stream ciphers are still potentially vulnerable to algebraic attacks that recover the key from some keystream bits. Although the known algebraic attacks only require polynomial time complexity of computations, all have their own constraints. This paper uses the linearization of nonlinear filter generators to cryptanalyze LFSR-based stream ciphers. Such a method works for any nonlinear filter generators. Viewing a nonlinear filter generator as a Boolean network that evolves as an automaton through Boolean functions, we first give its linearization representation. Compared to the linearization representation in Limniotis et al. (2008), this representation requires lower spatial complexity of computations in most cases. Based on the representation, the key recoverability is analyzed via the observability of Boolean networks. An algorithm for key recovery is given as well. Compared to the exhaustive search to recover the key, using this linearization representation requires lower time complexity of computations, though it leads to exponential time complexity.     

Approximations to Isentropic Planar Magneto-Hydrodynamics Equations by Relaxed Euler-Type Systems

In this paper, the authors consider an approximation to the isentropic planar Magneto-hydrodynamics (MHD for short) equations by a kind of relaxed Euler-type system. The approximation is based on the generalization of the Maxwell law for nonNewtonian fluids together with the Maxwell correction for the Amp`ere law, hence the approximate system becomes a first-order quasilinear symmetrizable hyperbolic systems with partial dissipation. They establish the global-in-time smooth solutions to the approximate Euler-type equations in a small neighbourhood of constant equilibrium states and obtain the global-in-time convergence towards the isentropic planar MHD equations. In addition, they also establish the global-in-time error estimates of the limit based on stream function techniques and energy estimates for error variables.     

An activated fluid stream – New techniques for cold water cleaning

Electrochemical, acoustic and imaging techniques are used to characterise surface cleaning with particular emphasis on the understanding of the key phenomena relevant to surface cleaning. A range of novel techniques designed to enhance and monitor the effective cleaning of a solid/liquid interface is presented. Among the techniques presented, mass transfer of material to a sensor embedded in a surface is demonstrated to be useful in the further exploration of ultrasonic cleaning of high aspect ratio micropores. In addition the effect of micropore size on the cleaning efficacy is demonstrated. The design and performance of a new cleaning system reliant on the activation of bubbles within a free flowing stream is presented. This device utilised acoustic activation of bubbles within the stream and at a variety of substrates. Finally, a controlled bubble swarm is generated in the stream using electrolysis, and its effect on both acoustic output and cleaning performance are compared to the case when no bubbles are added. This will demonstrate the active role that the electrochemically generated bubble swarm can have in extending the spatial zone over which cleaning is achieved.     

A pair of stream functions for three-dimensional vortex flows

Introducing a vector potential, that is based on a pair of stream functions, and a velocity potential, antisymmetric equations for the stream functions are derived with the help of a variational principle. It is found that the equations are in a suitable form to investigate flows with helical symmetry, and, for example, to connect upstream axisymmetric flows with downstream helical flows. The special case of a transition from an upstream solid-body vortex to a downstream helical flow is investigated in detail. Furthermore, the stream-function equations are particularly useful to investigate general small-amplitude inertia waves on vortex flows. Time-dependent helical flows that are time-independent in a suitably rotating frame of reference can also be discussed with the proposed method.     

Projection conditions on the vorticity in viscous incompressible flows

The problem of establishing appropriate conditions for the vorticity transport equation is considered. It is shown that, in viscous incompressible flows, the boundary conditions on the velocity imply conditions of an integral type on the vorticity. These conditions determine a projection of the vorticity field on the linear manifold of the harmonic vector fields. Some computational consequences of the above result in two-dimensional calculations by means of the nonprimitive variables, stream function and vorticity, are examined. As an example of the application of the discrete analogue of the projection conditions, numerical solutions of the driven cavity problem are reported.     

Group theoretic properties of Rijndael-like ciphers

We provide conditions for which the round functions of an ?-bit Rijndael-like block cipher generate the alternating group on the set {0,1}^?. These conditions show that the class of Rijndael-like ciphers whose round functions generate the alternating group on their message space is large, and includes both the actual Rijndael and the block cipher used by the compression function of the Whirlpool hash function. The result indicates that there is no trapdoor design for a Rijndael-like cipher based on the imprimitivity of the group action of its proper round functions which is difficult to detect.     

Consistency,stability and convergence of the finite-difference equations for flow about a rotating sphere in an axial stream

The finite-difference equations which have previously been developed to solve the problem of laminar boundary layer flow about a rotating sphere in an axial stream are analysed according to the available numerical stability theories. This analysis is necessary to determine the restrictions on velocities and mesh sizes required to obtain a convergent numerical solution. Convergence can be achieved if both consistency and stability of the finite-difference equations are fulfilled. The analysis reported in the present paper shows that the developed finite-difference equations are consistent with their original partial differential equations. Also, the analysis proves that the developed finite-difference procedure is numerically stable for all mesh sizes as long as the downstream meridional velocity is non-negative, i.e.as long as no flow reversals occur within the domain of solution.     

Attacks on the RC4 stream cipher

In this article we present some weaknesses in the RC4 cipher and their cryptographic applications. Especially we improve the attack described by Fluhrer, Mantin, Shamir (In: Selected Areas in Cryptography, 2001) in such a way, that it will work, if the weak keys described in that paper are avoided. A further attack will work even if the first 256 Byte of the output remain unused. Finally we show that variants of the RC4 algorithm like NGG and RC4A are also vulnerable by these techniques.      

Finite element stream function-vorticity solutions of the incompressible Navier-Stokes equations

The incompressible, two-dimensional Navier-Stokes equations are solved by the finite element method (FEM) using a novel stream function/vorticity formulation. The no-slip solid walls boundary condition is applied by taking advantage of the simple implementation of natural boundary conditions in the FEM, eliminating the need for an iterative evaluation of wall vorticity formulae. In addition, with the proper choice of elements, a stable scheme is constructed allowing convergence to be achieved for all Reynolds numbers, from creeping to inviscid flow, without the traditional need for upwinding and its associated false diffusion. Solutions are presented for a variety of geometries.     

Error linear complexity measures for multisequences

Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences. For finite multisequences as well as for periodic multisequences with prime period, we present formulas for the number of multisequences with given error linear complexity for several cases, and we present lower bounds for the expected error linear complexity.