DEVELOPMENT OF REQUIREMENTS TO AUTOMATIZATION TOOLS OF message analysis procedure
In the paper we consider the procedure, which we developed for message analysis and which provides detection of messages with some meaning. The procedure is based on a generalized statistical method of analysis (GSMA), which with the help of statistical fitting criteria with equiprobable distribution provides selection of messages from the messages flow that have distribution of frequencies of their symbols occurrence close to equiprobable distribution. In our opinion, effectiveness of the GSMA application is the minimum number of messages with equiprobable distribution of symbols, which are taken for messages with non-equiprobable distribution of symbols. In total, the base of effective application of the GSMA and the procedure of message analysis is the use of statistics probability distribution corresponding to the parameters of the analyzed message in the used statistical fitting criterion. To keep the highest effectiveness of the message analysis procedure, various kinds of statistics probability distribution, such as exact, D-exact and limit distributions which provide matching between the parameters of statistics probability distribution and the parameters of the analyzed message, are used in the GSMA. Besides, we present methods for calculation of the corresponding kinds of statistics probability distribution, and analyze computational complexity of these methods and boundary parameter values these methods can be used for. On the base of analysis of algorithmic properties of a generalized statistical method of message analysis we have developed requirements to a programming language for software implementation of the message analysis procedure, and requirements to computer facilities for message practical analysis using the developed software implementation of the procedure. Analysis of the developed requirements proved that it is possible to use the set description language SET@L as a programming language for software implementation of the message analysis procedure. Also, we have compared the characteristics of the programming language SET@L with the characteristics of the programming languages Cryptol and COLAMO to check their correspondence to the requirements of the algorithmic features of the GSMA. We have analyzed definitions and program structures of the language SET@L, owing to which the declared requirements can be fulfilled. According to the study of algorithmic features and computational complexity of the message analysis procedure we can conclude that it is necessary to use high-performance FPGA-based hybrid computer systems for practical message analysis.