RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika. Supplement // Archive

Prikl. Diskr. Mat. Suppl., 2020 Issue 13, Pages 129–132 (Mi pdma518)

Computational methods in discrete mathematics

Construction of cryptographic Boolean functions using SAT-solvers

A. E. Doronina, K. V. Kalginbac

a Novosibirsk State University
b Institute of Computational Mathematics and Mathematical Geophysics of Siberian Branch of Russian Academy of Sciences, Novosibirsk
c Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk

Abstract: 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.

UDC: 519.7

DOI: 10.17223/2226308X/13/38



© Steklov Math. Inst. of RAS, 2024