公开(公告)号：KR100828125B1

公开(公告)日：2008-05-08

申请号：KR1020070015762

申请日：2007-02-15

Applicant: 재단법인서울대학교산학협력재단

Inventor： 이준식 ,  서승우

IPC: H04L9/08

Abstract: A method for deciding an efficient tree structure for a logical key hierarchy and a method for analyzing performance of a tree structure are provided to compare performance of an entire tree by comparing only the number of average key updating messages for a partial tree. A method for deciding an efficient tree structure for a logical key hierarchy comprises the following steps of: performing a prime factorization for the number of all members, arranging each prime number according to the result of the prime factorization, and expressing the arrangement of the prime numbers in a tree structure(S101,S102); arranging each prime number of the tree structure in ascending order(S103); interchanging sequential two prime numbers of 2 with 4 and arranging the resultant prime numbers in ascending order if the prime number whose value is 2 is sequentially arranged among the prime numbers of the tree structure(S104,S105); and outputting the result as the effective tree structure(S106).

Abstract translation: 提供了一种用于确定逻辑密钥层次的有效树结构的方法和用于分析树结构的性能的方法，以通过仅比较部分树的平均密钥更新消息的数量来比较整个树的性能。 用于确定逻辑密钥层次的有效树结构的方法包括以下步骤：对所有成员的数量执行素素因子分解，根据素因子分解的结果排列每个素数，并且表示素数的排列 树结构中的数字（S101，S102）; 以升序排列树结构的每个素数（S103）; 如果序号为2的素数顺序排列在树结构的质数（S104，S105）中，则将2的连续两个素数与4进行交换，并按顺序排列所得素数。 并输出结果作为有效树结构（S106）。