【摘要】 在随机图中找大团是难的假设下 ,可以证明当团K的大小足够大时 ,随机插入到随机图G产生G′,在G′中找任何大团仍是难的 .利用这一结果可以构造一个单向函数 ,设计密钥分级管理方案更多还原

【Abstract】 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.更多还原