Abstract

Algorithms of parallel realization of classical "congruent" methods of generation of pseudo-random numbers are discussed. Algebraic (equational) and matrix interpretations of ways of realization of algorithms are presented. In order to achieve high level of performance of modern and perspective technical tools of cryptographic protection of data, as well as to provide contemporary stochastic methods of modeling, it is necessary to realize existing "congruent" methods in parallel. In developing solutions for the problems of high level of complexity, such as cryptographic protection of data, ensuring high levels of security of functioning in real time is of outmost importance. In this article the means of ensuring of functional diagnosis of the tools for pseudo-random numbers generation by means of application of classical methods of superfluous arithmetic coding (module control) are briefly discussed.

Authors and Affiliations