基于团问题难解性的密钥分级管理协议  

Hierarchical Key Creation Based on Difficulty of Finding the Large Clique in a Random Graph

作　　者：赵一鸣[1] 鲍振东[1] 

机构地区：[1]复旦大学计算机科学系,上海200433

出　　处：《电子学报》2000年第11期143-144,F003,共3页Acta Electronica Sinica

摘　　要：在随机图中找大团是难的假设下 ,可以证明当团K的大小足够大时 ,随机插入到随机图G产生G′,在G′中找任何大团仍是难的 .利用这一结果可以构造一个单向函数 。Assuming the difficulty of finding large cliques in random graphs,we can state that when a clique of sufficiently large size is randomly inserted into a random graph G ,yielding graph G′ ,finding any large clique in G′ is still hard.The result can be used to construct a new one way function,and a hierarchical key creation.

关 键 词：密钥分级管理 最大团问题 单向函数 密码学 

分 类 号：TN918[电子电信—通信与信息系统]