A Potential Constraints Method of Finding Nonclassical Symmetry of PDEs Based on Wu’s Method

Solving nonclassical symmetry of partial differential equations (PDEs) is a challenging problem in applications of symmetry method. In this paper, an alternative method is proposed for computing the nonclassical symmetry of PDEs. The method consists of the following three steps: firstly, a relationship between the classical and nonclassical symmetries of PDEs is established; then based on the link, we give three principles to obtain additional equations (constraints) to extend the system of the determining equations of the nonclassical symmetry. The extended system is more easily solved than the original one; thirdly, we use Wu’s method to solve the extended system. Consequently, the nonclassical symmetries are determined. Due to the fact that some constraints may produce trivial results, we name the candidate constraints as “potential” ones. The method gives a new way to determine a nonclassical symmetry. Several illustrative examples are given to show the efficiency of the presented method.

Applications of Differential Form Wu’s Method to Determine Symmetries of (Partial) Differential Equations

In this paper, we present an application of Wu’s method (differential characteristic set (dchar-set) algorithm) for computing the symmetry of (partial) differential equations (PDEs) that provides a direct and systematic procedure to obtain the classical and nonclassical symmetry of the differential equations. The fundamental theory and subalgorithms used in the proposed algorithm consist of a different version of the Lie criterion for the classical symmetry of PDEs and the zero decomposition algorithm of a differential polynomial (d-pol) system (DPS). The version of the Lie criterion yields determining equations (DTEs) of symmetries of differential equations, even those including a nonsolvable equation. The decomposition algorithm is used to solve the DTEs by decomposing the zero set of the DPS associated with the DTEs into a union of a series of zero sets of dchar-sets of the system, which leads to simplification of the computations.

Improvements for Finding Impossible Differentials of Block Cipher Structures

We improve Wu and Wang’s method for finding impossible differentials of block cipher structures. This improvement is more general than Wu and Wang’s method where it can find more impossible differentials with less time. We apply it on Gen-CAST256, Misty, Gen-Skipjack, Four-Cell, Gen-MARS, SMS4, MIBS, Camellia⁎, LBlock, E2, and SNAKE block ciphers. All impossible differentials discovered by the algorithm are the same as Wu’s method. Besides, for the 8-round MIBS block cipher, we find 4 new impossible differentials, which are not listed in Wu and Wang’s results. The experiment results show that the improved algorithm can not only find more impossible differentials, but also largely reduce the search time.