Метод решения задачи «Выполнимость» и его применение для криптографического анализа асимметричных шифров

Дулькейт Владимир Игоревич, Рашит Тагирович Файзуллин, Хныкин Иван Геннадьевич · Omsk Scientific Bulletin · 2008

The one of the most interesting problem of discrete mathematics is the SAT (satisfiability) problem. Promising solution is to transform the SAT problem into the problem of continuous search of global minimums of the functional associated with the CNF. This article proves the special construction of the functional and solves the system of non-linear algebraic equation that determines functional stationary points via modified method of consecutive approximation. The article describes parallel versions of the method. Also gives the scheme of using the method to important problems of cryptographic analysis of asymmetric ciphers, including determining the concrete bits of multipliers (in binary form) in large factorization problems.

Cited by 0 works.

Authors