Abstract
Aim. The purpose of the article is to study the cryptographic strength characteristics of Boolean functions used in the blender algorithm. This algorithm is designed for information security tasks as part of a pseudorandom sequence generator. Methods. The methods of cryptographic Boolean functions theory, the methods of analysis and comparison were used in the work. Results. The general features of the blender Boolean functions are formulated. To assess their cryptographic strength, a computational study of compliance with criteria such as balancedness, algebraic degree, the presence of fictitious variables, the absence of linear structures, correlation immunity, high nonlinearity, avalanche criterion, etc. was performed. A comparison is made with similar results for Boolean functions that are part of nonlinear s-blocks of known cryptographic algorithms. Conclusions. The ability to adjust the blender dimension to obtain blocks of the desired size, forming the output sequence, allows increasing the values of some characteristics of Boolean functions cryptographic strength. It is detected that some cryptographic strength indicators of the Boolean blender functions (balancedness, nonlinearity and global avalanche characteristic) have asymptotic regularities of behavior. The results of the study makes it possible to consider the level of cryptographic strength of the blender Boolean functions acceptable for use in cryptographic protection systems.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have