中文摘要：

现有的混淆算法都无法适应高速网络的匿名需求,为此提出了一种随机数混淆（RM）算法。RM算法在网络低流量下采用时延转发方式,在高流量时采用随机数转发方式。这样既保证了匿名系统的匿名性,同时又解决了SGM算法中的溢出问题。对RM算法的安全性和效率进行了分析,仿真结果与理论分析相一致,表明RM算法在开放式高速网络下有较好的自适应性和实用价值。

英文摘要：

Existed mixed algorithms do not apply to the high speed networks in open environments. This paper presented a random mix（RM） based anonymity algorithm for the high-speed networks. The algorithm delayed a message by time stamps when the networks traffic flow was low, and forwarded message randomly when the networks traffic flow was high. The RM algorithm not only guaranteed the anonymity of an anonymous communication system, but also solved the overflow problem in SGM algorithm. The analysis shows that the RM algorithm has desirable security property and it can evidently improve the efficiency of an anonymous system. The simulation make known that the RM algorithm is better than those known algorithms in adaptability and applicability, it can fit to the high speed networks in open environments.