Classification of mathematical models of distributed computations in the context of key search algorithms

Classification of mathematical models of distributed computational nets are performed for implementation of search algorithms. Distributed computational nets are calssified by such basic characteristics as number of nodes, productivity of computational nodes, priority distribution on the set of tested variants. The complexity estimations are given for implementation of possible atacks on information protection systems using distributed computations. Basic charateristics of probation alogorithms are estimated in terms of diffirent mathematical models, as well as algorithms of hash function analysis. It is shown that considerable advantage in implementation time can be achieved comparing to monoprocessor computational systems.