Identification of Bernoulli’s Sequences by Cryptographic Special Computers

Identification of Bernoulli’s Sequences by Cryptographic Special Computers

For real applications at the stage of preparing the information for piping an algorithm, having small probability of mistake admission for concrete realization of the formed message, has been chosen. In the paper the method of synthesis for assessment of the probability of registration of the binary (1)-transitions in solving the problems of coding and identification of messages has been considered. The ratio for the probability of a mistake admission, corresponding to the specified method at supervision a priori of uncertain asymptotic selection has been obtained. The fashion of distribution has been defined and the comparative analysis of the probabilities of a mistake admission, characterizing the offered method and the known algorithms of convolution at the given point has been defined. The proposed method of supervision in the probability processes is a more precise algorithm of identification, than the signature analysis.
Igor P. Kobyak
Belarusian State University of Informatics and Radioelectronics, Minsk, Belarusia
Share