Probabilistic methods for constructing the nonlinear substitution boxes (S-boxes)are considered. The greedy algorithm and branch and bound search for S-boxes over the set of constructed functions are analyzed, experimental research of their effectiveness taking into account different criteria of strength (nonlinearity, autocorrelation and algebraic degree) is carried out. Theoretical evaluation of the effectiveness of probabilistic methods is presented, which is compared with obtained experimental results of research.
nonlinear substitution box, bit-by-bit method of S-box construction, bijectivity, nonlinearity, autocorrelation, algebraic degree
"Yssledovanye veroiatnostnыkh metodov formyrovanyia nelyneinыkh uzlov zamen" ,
Information Processing Systems,