QQ客服 官方微博 反馈留言

	Twin Odd-Graceful Trees Towards Information Security
	Wang, Hongyu ; Xu, Jin ; Yao, Bing
	2017
关键词	Graph labelling odd-graceful labelling information network tree algorithm security NETWORKS GRAPHS COLORINGS
英文摘要	We design cryptographical graphs for information security by the following principles: (1) be used conveniently in usually; (2) with strong security, that is, it is difficult to be broken; (3) there are enough graphs and labellings for making desired keys and locks. For answering the above problems, we prove the series cryptographical graphs have good properties, and show the guarantee for constructing large scale of cryptographical trees from smaller cryptographical trees. The methods used for constructing the desired cryptographical graphs can be transformed into efficient algorithms.; National Natural Science Foundation of China [61572046, 61163054, 61363060, 61662066]; CPCI-S(ISTP); 15-20; 107
语种	英语
出处	7th International Congress of Information and Communication Technology (ICICT)
DOI标识	10.1016/j.procs.2017.03.050
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/469832]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Wang, Hongyu,Xu, Jin,Yao, Bing. Twin Odd-Graceful Trees Towards Information Security. 2017-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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