Cryptographic Strength Study of the Pseudorandom Sequences Generator Based on the Blender Algorithm

The paper deals with the cryptographic strength characteristics of Boolean functions used in the blender algorithm. This algorithm is used as a part of a pseudorandom sequences generator. The general features of the blender Boolean functions are formulated. To assess their cryptographic strength, a computational study of compliance with characteristics such as balance, algebraic degree, the absence of fictitious variables, high nonlinearity etc. was performed. A comparison is made with similar results for some known cryptographic algorithms. The ability to adjust the blender dimension for obtaining blocks of the desired size that form the output sequence, allows increasing the values of some characteristics of Boolean functions cryptographic strength. It is discovered that some cryptographic strength characteristics have asymptotic regularities of behavior. The results of the study make it possible to consider the level of cryptographic strength of the blender Boolean functions to be acceptable for use in cryptographic protection systems.