Solution of the problem of distribution of resources allocated to ensure the information security of the enterprise by methods of iterative aggregation

The article deals with the problems of high dimension in the theory of information security management. Along with the study of mathematical Methods of cryptography (algebraic, number-theoretic, combinatorial, etc.), a new direction that can be called mathematical cryptography. Basic concepts of mathematical cryptography are a one-way function, a pseudo-random generator, and a zero knowledge proof. They allow build new mathematical models that are more adequate reflect the objectives of cryptography. In this case, purely mathematical formulations of problems work, and mathematical cryptography gets its own apparatus and its internal stimuli for development. The main tasks of mathematical cryptography are initially difficult, and some of them are essentially long-known unsolved mathematical problems. Bottom problem computational complexity estimates - serious progress in its solution will allow to substantiate the stability of mathematical models of most ciphers. Mathematical cryptography represents the science mainly of computational complexity of tasks from some special classes.