6 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.CR2009★ 6 cited
The SAT solving method as applied to cryptographic analysis of asymmetric ciphers
R. T. Faizullin, I. G. Khnykin, V. I. Dylkeyt
The one of the most interesting problem of discrete mathematics is the SAT (satisfiability) problem. Good way in SAT solver developing is to transform the SAT problem to the proble…
math.CO2005
The direct algorithm for solving of the graph isomorphism problem
Rashit T. Faizullin, Alexander V. Prolubnikov
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially…
math.GM2002★ 1 cited
Heuristic algorithm for solving of the graph isomorphism problem
R. T. Faizullin, A. V. Prolubnikov
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to…