arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.04727cs.ITmath.COmath.IT
收藏

由拓扑图形密码生成的文本密码

Text-based Passwords Generated From Topological Graphic Passwords

Bing Yao, Xiaohui Zhang, Hui Sun, Yarong Mu, Yirong Sun, Xiaomin Wang, Hongyu Wang, Fei Ma, Jing Su, Chao Yang, Sihua Yang, Mingjun Zhang

摘要:

拓扑图形密码(Topsnut-gpws)是图形密码的一种,与现有的图形密码不同,Topsnut-gpws是以代数矩阵的形式存储在计算机中的。本文重点研究了基于文本的密码(TB-paws)和Topsnut-gpws之间的转换。介绍了几种基于拓扑结构和图着色/标记的Topsnut-gpws生成TB-paws的方法,使得认证分为拓扑结构认证和基于文本的认证两个步骤。本文介绍了四种基本的拓扑结构认证,并在此基础上提出了基于文本的认证。我们的方法是基于代数,数论和图论,其中许多可以转化为多项式算法。这里创建了一种用于描述Topsnut-gpws的新型矩阵,并且这种矩阵可以产生复杂形式和更长字节的TB-爪。Topsnut-gpws的TB-paws的空间估计对于应用非常重要。我们提出对动态网络进行加密,并试图面对:(1)动态网络的数千个节点和链接;(2)大量的Topsnut-gpw由机器而不是人手生成。作为一种尝试,我们应用动态网络的生成树和图群(Topsnut-群)来逼近这两个问题的解。文章最后提出了一些有待进一步研究的问题。

英文摘要:

Topological graphic passwords (Topsnut-gpws) are one of graph-type passwords, but differ from the existing graphical passwords, since Topsnut-gpws are saved in computer by algebraic matrices. We focus on the transformation between text-based passwords (TB-paws) and Topsnut-gpws in this article. Several methods for generating TB-paws from Topsnut-gpws are introduced; these methods are based on topological structures and graph coloring/labellings, such that authentications must have two steps: one is topological structure authentication, and another is text-based authentication. Four basic topological structure authentications are introduced and many text-based authentications follow Topsnut-gpws. Our methods are based on algebraic, number theory and graph theory, many of them can be transformed into polynomial algorithms. A new type of matrices for describing Topsnut-gpws is created here, and such matrices can produce TB-paws in complex forms and longer bytes. Estimating the space of TB-paws made by Topsnut-gpws is very important for application. We propose to encrypt dynamic networks and try to face: (1) thousands of nodes and links of dynamic networks; (2) large numbers of Topsnut-gpws generated by machines rather than human's hands. As a try, we apply spanning trees of dynamic networks and graphic groups (Topsnut-groups) to approximate the solutions of these two problems. We present some unknown problems in the end of the article for further research.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑