Geodesic
Transformation of CNF via resolution
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 91-93 
I. G. Khnykin. Transformation of CNF via resolution. Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 91-93. http://geodesic.mathdoc.fr/item/PDM_2009_10_a46/
@article{PDM_2009_10_a46,
     author = {I. G. Khnykin},
     title = {Transformation of {CNF} via resolution},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {91--93},
     year = {2009},
     number = {10},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2009_10_a46/}
}
TY  - JOUR
AU  - I. G. Khnykin
TI  - Transformation of CNF via resolution
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 91
EP  - 93
IS  - 10
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_10_a46/
LA  - ru
ID  - PDM_2009_10_a46
ER  - 
%0 Journal Article
%A I. G. Khnykin
%T Transformation of CNF via resolution
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 91-93
%N 10
%U http://geodesic.mathdoc.fr/item/PDM_2009_10_a46/
%G ru
%F PDM_2009_10_a46

Voir la notice de l'article provenant de la source Math-Net.Ru

This paper describes a method for equivalent transformation of CNF associated with important problems of cryptographic analysis of asymmetric ciphers. The method can reduce amount of disjuncts and resolve some variables. It can be used as a CNF preprocessor to increase the efficiency of SAT solvers.

[1] Dulkeit V. I., Faizullin R. T., Khnykin I. G., “Algoritm minimizatsii funktsionala, assotsiirovannogo s zadachei 3-SAT, i ego prakticheskie primeneniya”, Kompyuternaya optika, 32:1 (2008), 68–73

[2] Dulkeit V. I., “KNF-predstavleniya dlya zadach faktorizatsii i diskretnogo logarifmirovaniya”, Problemy teoreticheskoi i prikladnoi matematiki, Trudy 38-i Regionalnoi molodezhnoi konferentsii, UrO RAN, Ekaterinburg, 2007, 350–355

[3] RSA, The Security Division of EMC – Security Solutions for Business Acceleration, http://www.rsasecurity.com