Geodesic
Construction of cryptographic Boolean functions using SAT-solvers
Prikladnaya Diskretnaya Matematika. Supplement, no. 13 (2020), pp. 129-132 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In this paper, we propose a method for solving some cryptographic problems based on translation them into SAT-problems and application of SAT-solvers. We introduce construction of several formulas defining conditions of one-to-one property and differential uniformity of vectorial Boolean functions.
Keywords: SAT-solvers, cryptography, Boolean functions. 
@article{PDMA_2020_13_a37,
     author = {A. E. Doronin and K. V. Kalgin},
     title = {Construction of cryptographic {Boolean} functions using {SAT-solvers}},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {129--132},
     year = {2020},
     number = {13},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2020_13_a37/}
}
TY  - JOUR
AU  - A. E. Doronin
AU  - K. V. Kalgin
TI  - Construction of cryptographic Boolean functions using SAT-solvers
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2020
SP  - 129
EP  - 132
IS  - 13
UR  - http://geodesic.mathdoc.fr/item/PDMA_2020_13_a37/
LA  - ru
ID  - PDMA_2020_13_a37
ER  - 
%0 Journal Article
%A A. E. Doronin
%A K. V. Kalgin
%T Construction of cryptographic Boolean functions using SAT-solvers
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2020
%P 129-132
%N 13
%U http://geodesic.mathdoc.fr/item/PDMA_2020_13_a37/
%G ru
%F PDMA_2020_13_a37
A. E. Doronin; K. V. Kalgin. Construction of cryptographic Boolean functions using SAT-solvers. Prikladnaya Diskretnaya Matematika. Supplement, no. 13 (2020), pp. 129-132. http://geodesic.mathdoc.fr/item/PDMA_2020_13_a37/

[1] Ogorodnikov Yu. Yu., “Kombinirovannaya ataka na algoritm RSA s ispolzovaniem SAT-podkhoda”, Dinamika sistem, mekhanizmov i mashin, OmGTU, Omsk, 2016, 276–284

[2] Zaikin O. S., Otpuschennikov I. V., Semenov A. A., “Otsenki stoikosti shifrov semeistva Trivium k kriptoanalizu na osnove algoritmov resheniya problemy bulevoi vypolnimosti”, Prikladnaya diskretnaya matematika. Prilozhenie, 2016, no. 9, 46–48

[3] Schmittner S. E., A SAT-based Public Key Cryptography Scheme, IACR Cryptol. ePrint Arch., , 2015 https://eprint.iacr.org/2015/771.pdf | MR | Zbl

[4] Wille R., Lye A., Niemann P., “Checking reversibility of Boolean functions”, LNCS, 9720, 2016, 322–337 | MR | Zbl