Model for Steganographic Data Embedding into Program Memory

The article suggests a method for embedding hidden data into the program dynamic memory. The method is based on connecting a dynamic authentication library. The library works directly with a heap of programs. The algorithm breaks the security label into blocks of the same size. The blocks are evenly distributed across the heap. The memory scheduler is not involved in the generation of this data. The method deletes embedded data after a certain time period. Heap address calculation parameters and time period are parameters of the algorithm. The authentication library that embeds the information is universal. The probabilistic model of the program with a heap is proposed in the article. This model is necessary to investigate the possibility of collisions between embedded data and dynamic program variables. The model treats the creation and deletion of dynamic variables as random events. Computer simulation of program behavior for different probability ratios was carried out. А computer experiment showed the basic patterns of heap use by the program. The simulation results demonstrate the linear dependence of heap filling on the probability ratio of creating and deleting variables. The criteria for selecting steganographic embedding parameters are determined based on modeling. The period for placement of embedded data blocks and the time of presence the steganographic insert in the program memory are determined by the statistical characteristics of the executable code.