Verification of Cryptographic Algorithms Based on the Use of Method Simulation Binary Random Sequences with Specified Statistical Properties

Abstract

The problem of obtaining a set of samples to evaluate the quality of cryptographic algorithms through the use of statistical tests. Describes new features of binary Markov chains, taking into account the dependence of the probability of binary vectors of different lengths. The analytical expressions for the limits calculated according to ranges of values of binary probabilities of multidimensional random variables on the probability of binary random variables smaller dimension. The reasons of the need for additional “reject” procedure in the simulation implementations binary Markov processes. The method of directed enumeration values of probability distributions Markov ranks binary sequences, allowing to generate ergodic random binary sequence that allows you to completely abandon the “rejection” procedure. Presented algorithm implementing said method having reduced computational complexity compared to known algorithms Computing experiment to study the statistical properties of random binary sequences.