摘要
针对算法实现复杂、耗时,域间证书路径构建的效率低,基于图论的理论思想提出了一种邻接矩阵构建算法.该算法通过Am和F,F2,…,Ft构建CA间的证书路径,其最大优势在于时间复杂度比证书路径表算法降低了一个数量级,使域间证书路径的构建效率明显提高.
Since the realization of algorithms is quite complex and time-consuming, the certification path construction of cross domain has low efficiency. To solve the problem, the adjacency matrix construction algorithm is proposed based on the graph theory. The algorithm constructs two CAs certification path by A^m and F, F2, …, F^t. Compared with certification path table, the best merit of the new algorithm is that its time complexity reduces one order of magnitude, which enhances obviously the efficiency of certification path construction of cross domain.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2006年第5期28-30,共3页
Journal of Beijing University of Posts and Telecommunications
关键词
交叉认证
网状信任模型
证书路径构建
cross-certification
mesh trust model
certification path construction