The Application of Logical Operations and Tabular Transformations in the Base Accents of Hash-Function Algorithms

In the article the stages of transformation of the hashing processes on the structure of the general functional model of the algorithm without the key hash function are defined. The foundations of the application of logical operations and table replacements with the construction of models of basic transformations of the algorithm are revealed. The basics of methods and methods for modeling basic transformations have been developed. Their fundamental applications for creation with new transformations without key hash function algorithms are substantiated.

Перевод пока недоступен