On Multiple Topological Authentications In The Encryption of Tree-like Networks

Hongyu Wang, B. Yao
{"title":"On Multiple Topological Authentications In The Encryption of Tree-like Networks","authors":"Hongyu Wang, B. Yao","doi":"10.1109/ITNEC48623.2020.9084707","DOIUrl":null,"url":null,"abstract":"Blockchain uses a large number of cryptographic algorithms to ensure security. We will construct multiple topological authentications by topological graphic passwords and Topsnut-matchings, since matchings' phenomenon appear in almost branches of mathematics. We present two new techniques for our works, and design three construction algorithms for building up our multiple topological authentications. Our algorithms are based on graph labellings and graph operations. We give detail examples for illustrating each construction algorithm, and distribute a matching of two multiple topological authentication sets for producing text-based passwords with million or billion bytes in order to use them in quantum computer age.","PeriodicalId":235524,"journal":{"name":"2020 IEEE 4th Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 4th Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNEC48623.2020.9084707","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Blockchain uses a large number of cryptographic algorithms to ensure security. We will construct multiple topological authentications by topological graphic passwords and Topsnut-matchings, since matchings' phenomenon appear in almost branches of mathematics. We present two new techniques for our works, and design three construction algorithms for building up our multiple topological authentications. Our algorithms are based on graph labellings and graph operations. We give detail examples for illustrating each construction algorithm, and distribute a matching of two multiple topological authentication sets for producing text-based passwords with million or billion bytes in order to use them in quantum computer age.
树状网络加密中的多重拓扑认证
区块链使用了大量的加密算法来保证安全性。由于匹配现象几乎出现在数学的各个分支中,我们将利用拓扑密码和topsnut匹配构造多个拓扑认证。我们提出了两种新技术,并设计了三种构造算法来构建我们的多拓扑认证。我们的算法是基于图标注和图操作。我们给出了详细的示例来说明每种构造算法,并分发了两个多拓扑认证集的匹配,用于生成百万或十亿字节的基于文本的密码,以便在量子计算机时代使用它们。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信