Research On New Graphical Password Based On Tree And Cyclic Graph Labeling

With the development of the communications industry and the Internet industry,personal digital information and data information have been in a high-risk state during a long-term.Since the 1960 s,text passwords(passwords formed by alphanumeric characters)have been long used as the main method of identity authentication.After then,security researchers believe that text passwords are weak passwords which will be easily cracked.Many password cracking researches support this statement.Studies have shown that the human brain's memory of graphical information is significantly better than text information.With the rapid development of science and technology,intelligence devices have been updated increasingly,graphical passwords have been emerged as the more applicable to identity authentication solutions and has become a hot topic at present.The most effective way to solve the graphical password problem is to rely on computers and to design reasonable algorithms for specific problems.At present,research on graphic passwords in foreign countries is mainly divided into two categories: recall-based and recognition-based.There are relatively few researches on transform the numbers into labeled figures based on this new type of graphic cryptography domestic and abroad.The concept of“graph structure + number theory” was proposed for the first time by the team of Xu Jin of the Department of Computer Science of Peking University.Most researchers or enthusiasts have conducted long-term and large-scale research on special graphs in graph theory through manual labeling,resulting in many research work still stuck on the manual labeling method with low efficiency and low accuracy.For the development of modern cryptography,this dissertation proposes to design a visual operation interface,which design and implement a new type algorithm based on graceful labeling,and ingeniously convert a group of digital strings to generate a corresponding graphic that satisfies graceful labeling constraints.The further study based on tree and uni-cyclic graphs algorithm for elegant labeling establishes basic data for new graphical passwords based on icon numbers.Through the study of the elegance of tree and uni-cyclic graphs,the non-elegant and elegant conclusions about tree diagrams and uni-cyclic graphs are drawn.Due to the complexity of the graphs and the contingency of specific labels,most domestic and abroad scholars are focus on the special maps research.On the study of its elegance,it is more common to study a class of special graph papers.Such as the study of the odd elegance,the odd elegance of the general sun chart S,other special graphs of odd elegance and so on.However,most of these studies stayed in the study of the labeling of handcrafted elegance,and there have been few studies on the non-elegance of tree and uni-cyclic graphs.The specific work of this article is as follows:(1)Analyze and study traditional password and graphical password evaluation systems,and compare the advantages and disadvantages of traditional and graphical passwords.(2)Designing and implementing a new graph-based password-based graceful label generation algorithm based on a tree diagram,and obtaining a beautiful graph corresponding to a tree-like structure by inputting a set of data strings,satisfying corresponding conditions,such as graceful,odd graceful,and even graceful,The tests were conducted separately and a series of results were obtained.At the same time,the detailed flow and test cases of the algorithm were given,and the correctness and time complexity of the algorithm were analyzed.(3)Designed and implemented a new graphic cipher elegant labeling algorithm based on tree and unicycle graphs.The algorithm can now analyze the elegance of all the corresponding tree and uni-cyclic graphs within 16 vertices and get two non-elegant theorem and a conjecture.(4)Based on the completed algorithm,establish a sample space and analyze the feasibility of the new graphical password GDA.