Fast and Secure Dynamic Memory Allocator for Multi-Thread Applications

Today, most modern programming languages, including C and C++, allow the user to request memory blocks from the system memory at run-time and release these blocks back to the system memory when the program no longer needs them. This is known as dynamic memory allocation. This invention enables to have secure and fast dynamic memory allocators. One of the most critical parts of the dynamic memory algorithms is how to find the critical metadata necessary to handle released blocks. Currently, there are two approaches to this problem: 1.- Using complex data structures which consume memory and have a non constant search time 2.- Locate the metadata aligned to a large value, which permits to use a simple mathematical function to find the effective randomization of the addresses is greatly reduced. The invention solves this problem using a new mathematical function which operates in constant time (using fast boolean operations) and does not impose any restriction on the location alignment, which results in a higher level of security.