# Randomized C/C++ dynamic memory allocator

arXiv: https://arxiv.org/abs/2108.10779 · HTML: https://mlsanity.com/paper/2108.10779/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Aug 2021.

## Built on by (most cited first, 1 of 1)

- [Process signature-driven high spatio-temporal resolution alignment of multimodal data](https://mlsanity.com/paper/2403.06888/) (2024)

## Abstract (arXiv)

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.