论文部分内容阅读
针对以前的保持前缀地址随机化算法或是性能不高,或是不能进行一致的随机化的问题,该文提出了一种基于随机字符串的保持前缀地址随机化算法。该算法使用预先得到的随机字符串,避免了计算的开销,加快了地址随机化的速度。使用基于随机字符串算法和C rypto-pan的混合算法,可以进一步避免大的内存开销。实验结果表明,对相同的需要随机化的地址数,基于随机字符串的算法使用的时间只相当于C rypto-pan的1/10。采用二者的混合算法,一般使用的时间相当于C rypto-pan的1/4,而所使用的内存要比基于随机字符串所使用内存少得多,因此能够实现更好的时间、空间折衷。
Aiming at the problem that the prefix randomization algorithm preserves the prefix or the performance is not high or can not be uniformly randomized, a novel random prefix preserving algorithm based on random strings is proposed. The algorithm uses a pre-obtained random string, avoiding the computational overhead and speeding up the address randomization. Using a hybrid algorithm based on a random string algorithm and Ctrypto-pan, large memory overhead can be further avoided. The experimental results show that the algorithm based on random string is only 1/10 of C rypto-pan for the same number of addresses to be randomized. Using a mix of the two, the typical time spent is equal to a quarter of Ciralpto-pan, and the memory used is much less than the memory used based on the random string, so much better time and space are compromised .