The paper is devoted to the search for new approaches to the formation of key arrays for encryption of color images. Emphasis is placed on using the initial key sequence of the smallest length. In this case, the key is the initial state of an elementary cellular automaton for implementing evolution based on a given rule. The use of an evolutionary approach on cellular automata to the formation of large key arrays made it possible to achieve unpredictable image encryption based on a single rule of an elementary cellular automata. The task of the research is to search for the rules of elementary cellular automata, which, based on a small initial key bit sequence, allow one to form a reliable key array of large dimensions for encrypting the bit layers that make up the image. To solve this problem, an experiment was carried out, on the basis of which the search for the necessary rules and options for choosing the elements of each bit array was carried out to encrypt the bit layers of the image. To form each bit key array, different initial conditions were used for elementary cellular automata. It is shown that for different initial conditions and for the chosen rules, the encryption quality is preserved. The most reliable encryption is the use of two key arrays formed on the basis of the evolution of one rule for different initial conditions. As a result of the experiments, the rules were determined (rules 90, 105, 150 and XOR function based on the two previous steps of evolution), which can be used without additional rules. Each bit layer of the image is encrypted using different subarrays of each generated one key array of the same dimension. It has been established that the most effective for encryption is the rule 105 and the XOR function based on the two previous steps of evolution. The resulting histograms of the distribution of brightness for each color of the encrypted image confirm the high quality of encryption based on the proposed method.

Grid computing is the form of distributed computing where the resources of various computers are shared to solve a particular problem. Grid can be used for a variety of purposes. Job scheduling is used to schedule the user jobs to appropriate resources in grid environment. The resources in the Grid are heterogeneous and geographically distributed with varying availability, and a variety of usage and cost policies for diverse users at different times vary with time. The management of resources and application scheduling in such a large and distributed environment is a complex task. In this paper, a survey of various job scheduling algorithms is made. The job scheduling algorithms are compared and contrasted based on the makes pan, flow time, resource utilization and completion time. They contribute to developing more efficient scheduling algorithms. This will help interested researchers carry out further work in this thrust area of research.

The paper is devoted to the search for new approaches to encrypting selected objects in an image. Videos were analyzed, which were divided into frames, and in each video frame, the necessary objects were detected for further encryption. Images of objects with a designated geometric shape and color characteristics of pixels were considered. To select objects, a method was used based on the calculation of average values, the analysis of which made it possible to determine the convergence with the established image. Dividing the selected field into subregions with different shapes solves the problem of finding objects of the same type with different scales. In addition, the paper considers the detection of moving objects. The detection of moving objects is carried out based on determining the frame difference in pixel codes in the form of a rectangular shape. Cellular automata technology was used for encryption. The best results were shown by the transition rules of elementary cellular automata, such as: 90, 105, 150, and XOR function. The use of cellular automata technologies made it possible to use one key sequence to encrypt objects on all video frames of the video. Encryption results are different for the same objects located in different places of the same video frame and different video frames of the video sequence. The video frame image is divided into bit layers, the number of which is determined by the length of the code of each pixel. Each bit layer is encrypted with the same evolution, which is formed by one initial key bit sequence. For each video frame, a different part of the evolution is used, as well as for each detected object in the image. This approach gives different results for any objects that have a different location both on the video frame image and in different video frames. The described methods allow you to automate the process of detecting objects on video and encrypting them.