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 algorithm designed to meet these requirements. Randomization is key feature intended protect applications from "use-after-free" or similar attacks. At time, state consists only of one pointer, so it does not consume extra for itself. Ho...
