Randomized C/C++ dynamic memory allocator

TL;DR

This paper introduces a new randomized C/C++ dynamic memory allocator that enhances security against certain attacks while maintaining minimal memory overhead, though it does not address fragmentation.

Contribution

It presents a novel randomized memory management algorithm that is simple, secure, and memory-efficient, with potential for further development.

Findings

Provides protection against use-after-free attacks

Uses only one pointer for state, minimizing memory overhead

Requires further testing and development

Abstract

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.