Group classification of the generalized complex Ginzburg-Landau equations is presented. An approach to group classification of systems of reaction-diffusion equations with general diffusion matrix is formulated.

We consider the simultaneous diffusion and homogenization limit of the linear Boltzmann equation in a periodic medium in the regime where the mean free path is much smaller than the lattice constant. The resulting equation is a diffusion equation, with an averaged diffusion matrix that is formally obtained by first performing the diffusion limit and then the homogenization one. The rigorous pro...

In this article, we investigate the construction of lightweight MDS matrices over the matrix polynomial residue ring. According to distributions of the minimum polynomial, distributions of XOR count and equivalence classes of MDS matrices, we propose an algorithm, which not only can construct lightest MDS matrices, but also is evidently more efficient than previous methods. Moreover, we investi...

A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Separable) linear codes over finite fields is generalized to MDS group codes over abelian groups, using the notion of quasideterminants defined for matrices over non-commutative rings.

Zhang Shi-Yi, Wang Yong-juan, Gao Yang, Wang Tao Corresponding author: Wang Yong-juan, E-mail: [email protected] Abstract: The 4 4  MDS matrix over 2 F is widely used in the design of block cipher's linear diffusion layers. However, considering the cost of a lightweight cipher's implementation, the sum of XOR operations of a MDS matrix usually plays the role of measure. During the research on t...

Maximum distance separable (MDS) matrices have applications not only in coding theory but also are of great importance in the design of block ciphers and hash functions. It is highly nontrivial to find MDS matrices which could be used in lightweight cryptography. In a crypto 2011 paper, Guo et. al. proposed a new MDS matrix Serial(1, 2, 1, 4) over F28 . This representation has a compact hardwar...

We study strong existence and pathwise uniqueness for stochastic differential equations in R with rough coefficients, and without assuming uniform ellipticity for the diffusion matrix. Our approach relies on direct quantitative estimates on solutions to the SDE, assuming Sobolev bounds on the drift and diffusion coefficients, and L bounds for the solution of the corresponding Fokker-Planck PDE,...

Although linear perfect diffusion primitives, i.e. MDS matrices, are widely used in block ciphers, e.g. AES, very little systematic work has been done on how to find “efficient” ones. In this paper we attempt to do so by considering software implementations on various platforms. These considerations lead to interesting combinatorial problems: how to maximize the number of occurrences of 1 in th...

Group classification of systems of two coupled nonlinear reaction-diffusion equation with a diagonal diffusion matrix is carried out. Symmetries of diffusion systems with singular diffusion matrix and additional first order derivative terms are described.

Group classification of systems of two coupled nonlinear reaction-diffusion equation with a diagonal diffusion matrix is carried out. Symmetries of diffusion systems with singular diffusion matrix and additional first order derivative terms are described.