Analysis of Workability of One-Way Functions Based on Cellular Automata in Diffie–Hellman Algorithm for Big Data Tasks

The article deals with the peculiarities of using cellular automata as one-way functions in the Diffie-Hellman algorithm, which allows generating encryption keys for transmitting Big Data in conditions of information exchange via open communication channels. The authors improve the Diffie-Hellman algorithm by using a new type of one-way functions - cellular automats. The used automats have extended rules in the direction of determining the laws of birth rate, life continuation and death conditions, and control of the radius of intra-population interaction. The use of a multi-population cellular system is also considered as a separate extension of the cellular automata. Depending on user needs, the complexity of encryption can be adjusted (this will affect the time of algorithm execution and the reliability of a one-way function). A method has also been developed to test the performance of specific automats with configurable initial parameters, which allows testing the cellular automata before use. The new type of one-way functions allows using the Diffie-Hellman algorithm for frequent generation of encryption keys. The software was implemented in three programming languages: Python, MatLab and C#. This allows to compare results and implement the software required for the study in the languages most suitable for the tasks under consideration.