This paper presents a characteristic more efficient and has better properties than the set method for solving Boolean equations, which is general characteristic set method. In particular, the authors give a disjoint a...This paper presents a characteristic more efficient and has better properties than the set method for solving Boolean equations, which is general characteristic set method. In particular, the authors give a disjoint and monic zero decomposition algorithm for the zero set of a Boolean equation system and an explicit formula for the number of solutions of a Boolean equation system. The authors also prove that a characteristic set can be computed with a polynomial number of multiplications of Boolean polynomials in terms of the number of variables. As experiments, the proposed method is used to solve equations from cryptanalysis of a class of stream ciphers based on nonlinear filter generators. Extensive experiments show that the method is quite effective.展开更多
For a parametric algebraic system in finite fields, this paper presents a method for computing the cover and the refined cover based on the characteristic set method. From the cover, the author knows for what parametr...For a parametric algebraic system in finite fields, this paper presents a method for computing the cover and the refined cover based on the characteristic set method. From the cover, the author knows for what parametric values the system has solutions and at the same time presents the solutions in the form of proper chains. By the refined cover, the author gives a complete classification of the number of solutions for this system, that is, the author divides the parameter space into several disjoint components, and on every component the system has a fix number of solutions. Moreover, the author develops a method of quantifier elimination for first order formulas in finite fields.展开更多
A brief introduction to the characteristic set method is given for solving algebraic equation systems and then the method is extended to algebraic difference systems. The method can be used to decompose the zero set f...A brief introduction to the characteristic set method is given for solving algebraic equation systems and then the method is extended to algebraic difference systems. The method can be used to decompose the zero set for a difference polynomial set in general form to the union of difference polynomial sets in triangular form. Based on the characteristic set method, a decision procedure for the first order theory over an algebraically closed field and a procedure to prove certain difference identities are proposed.展开更多
In this paper, we generalize the method of mechanical theorem proving in curves to prove theorems about surfaces in differential geometry with a mechanical procedure. We improve the classical result on Wronskian deter...In this paper, we generalize the method of mechanical theorem proving in curves to prove theorems about surfaces in differential geometry with a mechanical procedure. We improve the classical result on Wronskian determinant, which can be used to decide whether the elements in a partial differential field are linearly dependent over its constant field. Based on Wronskian determinant, we can describe the geometry statements in the surfaces by an algebraic language and then prove them by the characteristic set method.展开更多
Level set methods are widely used for predicting evolutions of complex free surface topologies,such as the crystal and crack growth,bubbles and droplets deformation,spilling and breaking waves,and two-phase flow pheno...Level set methods are widely used for predicting evolutions of complex free surface topologies,such as the crystal and crack growth,bubbles and droplets deformation,spilling and breaking waves,and two-phase flow phenomena.This paper presents a characteristic level set equation which is derived from the two-dimensional level set equation by using the characteristic-based scheme.An explicit finite volume element method is developed to discretize the equation on triangular grids.Several examples are presented to demonstrate the performance of the proposed method for calculating interface evolutions in time.The proposed level set method is also coupled with the Navier-Stokes equations for two-phase immiscible incompressible flow analysis with surface tension.The Rayleigh-Taylor instability problem is used to test and evaluate the effectiveness of the proposed scheme.展开更多
In this paper,a new method to analyze Boolean functions is proposed.By this method,one can analyze the balancedness,the nonlinearity,and the input-output correlation of vectorial Boolean functions.The basic idea of th...In this paper,a new method to analyze Boolean functions is proposed.By this method,one can analyze the balancedness,the nonlinearity,and the input-output correlation of vectorial Boolean functions.The basic idea of this method is to compute the refined covers of some parametric Boolean polynomial systems which are equivalent to these problems.By a refined cover,the parameter space is divided into several disjoint components,and on each component,the parametric Boolean polynomial system has a fixed number of solutions.An efficient algorithm based on the characteristic set method to compute refined covers of parametric Boolean polynomial systems is presented.The experimental results about some instances generated from cryptanalysis show that this new method is efficient and can solve some instances which can not be solved in reasonable time by other methods.展开更多
基金This research is partially supported by a National Key Basic Research Project of China under Grant No.2004CB318000.
文摘This paper presents a characteristic more efficient and has better properties than the set method for solving Boolean equations, which is general characteristic set method. In particular, the authors give a disjoint and monic zero decomposition algorithm for the zero set of a Boolean equation system and an explicit formula for the number of solutions of a Boolean equation system. The authors also prove that a characteristic set can be computed with a polynomial number of multiplications of Boolean polynomials in terms of the number of variables. As experiments, the proposed method is used to solve equations from cryptanalysis of a class of stream ciphers based on nonlinear filter generators. Extensive experiments show that the method is quite effective.
基金supported by the National 973 Program of China under Grant No.2011CB302400the National Natural Science Foundation of China under Grant No.60970152
文摘For a parametric algebraic system in finite fields, this paper presents a method for computing the cover and the refined cover based on the characteristic set method. From the cover, the author knows for what parametric values the system has solutions and at the same time presents the solutions in the form of proper chains. By the refined cover, the author gives a complete classification of the number of solutions for this system, that is, the author divides the parameter space into several disjoint components, and on every component the system has a fix number of solutions. Moreover, the author develops a method of quantifier elimination for first order formulas in finite fields.
基金This work is supported by the National Grand Fundamental Research 973 Program of China under Grant No. 2004CB318000. Acknowledgement We would like to take this opportunity to express our deep gratitude to the National Natural Science Foundation of China （NSFC） for its support during the past twenty years. Without the support from NSFC, mathematics mechanization is impossible to be so prosperous today. The second author would like, in particular, to thank NSFC for an 0utstanding Young Investigator Award for the period 1998 to 2001.
文摘A brief introduction to the characteristic set method is given for solving algebraic equation systems and then the method is extended to algebraic difference systems. The method can be used to decompose the zero set for a difference polynomial set in general form to the union of difference polynomial sets in triangular form. Based on the characteristic set method, a decision procedure for the first order theory over an algebraically closed field and a procedure to prove certain difference identities are proposed.
基金the National Key Basic Research Project of China (Grant No.2004CB318000)
文摘In this paper, we generalize the method of mechanical theorem proving in curves to prove theorems about surfaces in differential geometry with a mechanical procedure. We improve the classical result on Wronskian determinant, which can be used to decide whether the elements in a partial differential field are linearly dependent over its constant field. Based on Wronskian determinant, we can describe the geometry statements in the surfaces by an algebraic language and then prove them by the characteristic set method.
基金King Mongkut’s University of Technology North Bangkok (KMUTNB)the Office of the Higher Education Commission (OHEC)the National Metal and Materials Technology Center (MTEC) for supporting this research work
文摘Level set methods are widely used for predicting evolutions of complex free surface topologies,such as the crystal and crack growth,bubbles and droplets deformation,spilling and breaking waves,and two-phase flow phenomena.This paper presents a characteristic level set equation which is derived from the two-dimensional level set equation by using the characteristic-based scheme.An explicit finite volume element method is developed to discretize the equation on triangular grids.Several examples are presented to demonstrate the performance of the proposed method for calculating interface evolutions in time.The proposed level set method is also coupled with the Navier-Stokes equations for two-phase immiscible incompressible flow analysis with surface tension.The Rayleigh-Taylor instability problem is used to test and evaluate the effectiveness of the proposed scheme.
基金the National Natural Science Foundation of China under Grant Nos.61977060 and 61877058。
文摘In this paper,a new method to analyze Boolean functions is proposed.By this method,one can analyze the balancedness,the nonlinearity,and the input-output correlation of vectorial Boolean functions.The basic idea of this method is to compute the refined covers of some parametric Boolean polynomial systems which are equivalent to these problems.By a refined cover,the parameter space is divided into several disjoint components,and on each component,the parametric Boolean polynomial system has a fixed number of solutions.An efficient algorithm based on the characteristic set method to compute refined covers of parametric Boolean polynomial systems is presented.The experimental results about some instances generated from cryptanalysis show that this new method is efficient and can solve some instances which can not be solved in reasonable time by other methods.
