QQ客服 官方微博 反馈留言

	Exploring New Cryptographical Construction Of Complex Network Data
	Wang, Hongyu ; Xu, Jin ; Yao, Bing
	2016
关键词	tree-space labelling scale-free network data security
英文摘要	There are famous scale-free network models and small-world network models that bare huge amounts of mass data. We have designed several password tree-spaces by small trees having the total graceful labellings such that every tree T in the password tree-space has a total graceful labelling. For exploring topological passwords consisted of graphic constructions pulsing number theory, we show edge-symmetric graphs G = < T; H, m >, edge-asymmetric graphs G = < T; H-1, H-2,..., H-m > and uniformly edge-symmetric graph G = < T; H, p >(uni) defined in this article differ from each other, these graphs can product various password tree-spaces. Since there are many labellings of graph theory related with number theory, so we can make more complicated password tree-spaces for the security of information and mass data networks.; National Natural Science Foundation of China [61309015, 61163054, 61363060]; CPCI-S(ISTP); 155-160
语种	英语
出处	1st IEEE International Conference on Data Science in Cyberspace (DSC)
DOI标识	10.1109/DSC.2016.76
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/470081]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Wang, Hongyu,Xu, Jin,Yao, Bing. Exploring New Cryptographical Construction Of Complex Network Data. 2016-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。