Geodesic
A compact translator of algorithms into Boolean formulas for use in cryptanalysis
Prikladnaya Diskretnaya Matematika. Supplement, no. 13 (2020), pp. 135-136 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The program for converting the description of the cryptographic task to CNF is presented. A SAT solver establishes the truth of the formula and finds the values of the variables after that. Features of this development are universality, a small code size (300 lines of C++), easily modifiable and extensible implementation.
Mots-clés : cryptanalysis
Keywords: SAT-solver, guess-and-determine attack. 
@article{PDMA_2020_13_a39,
     author = {D. A. Sofronova and K. V. Kalgin},
     title = {A compact translator of algorithms into {Boolean} formulas for use in cryptanalysis},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {135--136},
     year = {2020},
     number = {13},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2020_13_a39/}
}
TY  - JOUR
AU  - D. A. Sofronova
AU  - K. V. Kalgin
TI  - A compact translator of algorithms into Boolean formulas for use in cryptanalysis
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2020
SP  - 135
EP  - 136
IS  - 13
UR  - http://geodesic.mathdoc.fr/item/PDMA_2020_13_a39/
LA  - ru
ID  - PDMA_2020_13_a39
ER  - 
%0 Journal Article
%A D. A. Sofronova
%A K. V. Kalgin
%T A compact translator of algorithms into Boolean formulas for use in cryptanalysis
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2020
%P 135-136
%N 13
%U http://geodesic.mathdoc.fr/item/PDMA_2020_13_a39/
%G ru
%F PDMA_2020_13_a39
D. A. Sofronova; K. V. Kalgin. A compact translator of algorithms into Boolean formulas for use in cryptanalysis. Prikladnaya Diskretnaya Matematika. Supplement, no. 13 (2020), pp. 135-136. http://geodesic.mathdoc.fr/item/PDMA_2020_13_a39/

[1] Otpuschennikov I., Semenov A., Gribanova I., et al., “Encoding cryptographic functions to SAT using TRANSALG system”, Proc. ECAI'16, IOS Press, 2016, 1594–1595

[2] Biere A., Heule M., Maaren H., Walsh T., Handbook of Satisfiability, IOS Press, 2009, 966 pp. | Zbl

[3] Semenov A., Otpuschennikov I., Gribanova I., et al., “Translation of algorithmic descriptions of discrete functions to SAT with application to cryptanalysis problems”, Log. Methods Comput. Sci., 16:1 (2020), 29:1–29:42 | MR | Zbl

[4] Soos M., Nohl K., Castelluccia C., “Extending SAT solvers to cryptographic problems”, LNCS, 5584, 2009, 244–257 | MR

[5] Soos M., “Grain of salt — an automated way to test stream ciphers through SAT solvers”, Tools, 10 (2010), 131–144