01698nas a2200253   4500000000100000000000100001008004100002260000900043653002200052653002900074653002100103100002500124700002000149700001900169700001700188700001800205700002300223700001800246700002000264245013600284300001200420490000700432520100500439       2020                            d  c202010acellular automata10aDiffie-Hellman algorithm10aone-way function1 aVolodymyr Shevchenko1 aGeorgi Dimitrov1 aDenys Berestov1 aPepa Petrova1 aIgor Sinitcyn1 aEugenia Kovatcheva1 aIvan Garvanov1 aIva Kostadinova00aOne-way Function Based on Modified Cellular Automata in the Diffie-Hellman Algorithm for Big Data Exchange Tasks through Open Space  a233-2460 v473 a<p>The article deals with ways to quickly change passwords in information ex-change through open space. It suggests an improvement of the Diffie-Hellman algorithm by creating a one-way function on the basis of cellular automata with an extended set of rules. The authors have expanded the rules of the game of life towards definition of the rules of birth rate and life extension, control of the radius of intra-population interaction, rules of death from the age of cells, multi-component (multi-population) system of cells. The created algorithm on the basis of a cellular automaton is used to create keys for safe information transfer. Depending on the needs of encryption, the algorithm can be enhanced by using variable parameters of the cell field and cell behaviour, which will allow to regulate the speed and reliability of encryption. The implementation is in Python and MatLab, which allows to compare results and change the modelling environment when changing the features of the task.</p>