Arseny Viktorovich Mitin

Irina Aleksandrovna Astrakhantseva, Roman Gennadevich Astrakhantsev, Arseny Viktorovich Mitin

Dynamic memory management requires special attention in programming. It should be fast and secure at the same time. This paper proposes a new randomized dynamic memory management algorithm designed to meet these requirements. Randomization is a key feature intended to protect applications from "use-after-free" or similar attacks. At the same time, the state in the algorithm consists only of one pointer, so it does not consume extra memory for itself. However, our algorithm is not a universal solution. It does not solve the memory fragmentation problem and it needs further development and testing.