Strongly (k, d)-Graphical Labellings For Designing Graphical Passwords In Communication

Abstract

The safety of the traditional text passwords is questioned by many users in the present information research. Graphical passwords become new research object of many researchers, who hope they can replace the existing text passwords and improve user account security. We are studying Topsnut-graphical passwords, which can be traced back to an idea of “topological structure plus number theory” proposed first by Hongyu Wang with her colleagues, and we found the equivalence between with Topsnut-graphics passwords of the trees having perfect matching. Through designing new parametric graphical labellings, we hope to enrich the variety of Topsnut-graphical passwords, and study the relationship between new parametric graphic labellings and existing labellings on trees having perfect matching. In addition, we also found, by two kinds of special operations, trees having perfect matching can be converted into paths perfect matching, and the nature of the original passwords remains unchanged. Our results can be provided to two or more banking users, and our method can easily be converted into polynomial time algorithms.