In this paper we present the results of application of state-ofthe-Art SAT solvers to inversion of cryptographic hash functions from the MD family. In particular we consider the problems of finding preimages and colli...
详细信息
In this paper we present the results of application of state-ofthe-Art SAT solvers to inversion of cryptographic hash functions from the MD family. In particular we consider the problems of finding preimages and collisions for MD4 and MD5. To solve them we use the approach based on reducing the original problems to Boolean satisfiability problem (SAT). The propositional encoding of the algorithms specifying the considered functions was performed using the Transalg software system. The features of this system make it possible to effectively augment the SAT encodings for MD4 and MD5 hash functions with various additional constraints that improve the effectiveness of SAT solvers on corresponding instances. The effectiveness of the proposed algorithms is better than that in a number of preceding papers. We used the developed algorithms to find new families of two-block collisions for MD5 and to construct new differential paths for finding single-block collisions for MD4.
For the tasks considering changes of water level it is required to have a combined (above water and underwater) elevation model. And the highest accuracy requirements are imposed on the parts of the model, which produ...
详细信息
Based on the Boolean constraints method several problems of qualitative analysis of bipartite logical networks are solved. The dynamics of the trajectories behavior of these networks is studied over a finite time inte...
详细信息
In this report we present several different propositional encodings for finding systems of mutually orthogonal Latin squares, and evaluate their effectiveness using state-of-The-Art parallel and sequential algorithms ...
详细信息
In this report we present several different propositional encodings for finding systems of mutually orthogonal Latin squares, and evaluate their effectiveness using state-of-The-Art parallel and sequential algorithms for solving Boolean satisfiability problem (SAT). We also apply the widely used SMAC tool to study the possibility of improving the effectiveness of lingeling SAT solver on the considered tests and discuss the results of corresponding computational experiments.
In this paper we study the problem of estimating the time required to process decompositions of hard SAT instances encoding inversion problems of some cryptographic functions. In particular, we consider one type of SA...
详细信息
The efficiency of decision-making, especially when using multi-method schemes, can be improved by using artificial intelligence methods, in particular, the case-based reasoning approach. The paper presents the applica...
详细信息
The problem of finding a Nash equilibrium in polymatrix game of three players (hexamatrix game) is considered. For the equivalent nonconvex optimization problem an issue of local search is investigated. First, we stud...
详细信息
The development of knowledge bases for classical intelligent systems based on the formalism of logical rules remains an urgent task. One of the ways to improve the efficiency of this task is through visual programming...
详细信息
We consider a linear nonstationary system of ordinary differential equations with interval coefficients which is not solvable with respect to the derivative of the unknown vector-valued function for any matrix coeffic...
We consider a semilinear differential-algebraic system of partial differential equations of index (k, 0). We numerically solve this system by applying the spline-collocation method based on splitting the matrix pencil...
暂无评论