一种改进的R-LKH算法  

Improved R-LKH Algorithm

作　　者：刘利芬[1] 邓亚平[1] 

机构地区：[1]重庆邮电大学计算机学院,重庆400065

出　　处：《计算机工程》2008年第18期176-178,共3页Computer Engineering

摘　　要：组播密钥更新中的R-LKH方案密钥更新效率低、组控制器和组成员的计算开销高。该文提出一种改进算法,采用结合单向函数和随机数的高效更新算法提高密钥更新效率,降低组播组的通信量。分析并比较成员加入/离开组过程的组播和单播通信量,结果表明改进后算法的通信开销和计算开销都低于R-LKH。Because some disadvantage of the R-LKH scheme which is one algorithm of the mulficast rekeying, such as the inefficient rekeying and high computing spending of group controller and member, this paper proposes an improved R-LKH algorithm which increases the rekeying efficiency and reduces the group traffic by adopting the efficient rekeying algorithm which combinies one-way function and random number. It analyses and compares the traffic of multicast and unicast when the members join or leave the group. The results show that the improved algorithm needs less traffic and computing spending than the R-LKH.

关 键 词：密钥管理 LKH树 单向函数 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]