| 基于团问题难解性的密钥分级管理协议 |
| |
| 引用本文： | 赵一鸣,鲍振东.基于团问题难解性的密钥分级管理协议[J].电子学报,2000,28(11):143-145. |
| |
| 作者姓名： | 赵一鸣 鲍振东 |
| |
| 作者单位： | 复旦大学计算机科学系,上海 200433 |
| |
| 摘 要： | 在随机图中找大团是难的假设下,可以证明当团K的大小足够大时,随机插入到随机图G产生G',在G'中找任何大团仍是难的.利用这一结果可以构造一个单向函数,设计密钥分级管理方案.
|
| 关 键 词： | 密钥分级管理 最大团问题 单向函数 |
| 文章编号： | 0372-2112(2000)11-0143-03 |
| 收稿时间： | 1999-09-03 |
Hierarchical Key Creation Based on Difficulty of Finding the Large Clique in a Random Graph |
| |
| ZHAO Yi-ming,BAO Zhen-dong.Hierarchical Key Creation Based on Difficulty of Finding the Large Clique in a Random Graph[J].Acta Electronica Sinica,2000,28(11):143-145. |
| |
| Authors: | ZHAO Yi-ming BAO Zhen-dong |
| |
| Affiliation: | Dept of Computer Science,FuDan University,Shanghai 200433,China |
| |
| 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. |
| |
| Keywords: | hierarchical key creation the largest cliques problem one way function |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载全文 |
