Exploring Topsnut-Graphical Passwords by Twin Odd-elegant Trees

Hong-Yu Wang,Bing Yao,Jin Xu,Bing Xu,Yinong Chen

doi:10.1051/matecconf/201713900205

Abstract

Graphical passwords are facing a good opportunity as 2-dimension codes are accepted by many people, since it has been applied in mobile devices, electronic equipments with touch screen, and so on. QR codes can be considered as a type of graphical passwords. Topsnut-graphical password differs from the existing graphical passwords, and has been investigated and developed. In this article, a new type of Topsnut-graphical passwords has been designed by technique of graph theory, called twin odd-elegant labelling. We make the twin odd-elegant graphs for one-key vs two or more locks (conversely, one-lock vs two or more keys). These Topsnut-GPWs show perfect matching characteristics of locks (TOE-lock-models) and keys (TOE-key-models). We show examples for testing our methods which can be easily transformed into effective algorithms.

Highlights

Question 1: Are graphical passwords a viable alternative to alphanumeric passwords in terms of security, as well as password creation, learning, performance, and retention?Question 2: Are users’ perceptions of graphical passwords different from those of alphanumeric passwords?An idea of “graphical structure plus number theory” (Topsnut) for creating new type of graphical passwords was proposed firstly by Wang et al in [9, 10]
QR codes can be considered as a type of graphical passwords that are used widely, since it has been applied in mobile devices, electronic equipments with touch screen, and so on
In making new Topsnut graphical passwords (Topsnut-GPWs), Wang et al [11] have designed some TopsnutGPWs by knowledge of graph theory for answering the following problem of number theory: Problem of odd-graceful KL-matching pairs: Let [0, 2q] = {0, 1, 2, . . . , 2q} and [1, 2q − 1]o = {1, 3, 5, . . . , 2q − 1} with q ≥ 2

Summary

Introduction

Question 2: Are users’ perceptions of graphical passwords different from those of alphanumeric passwords?. An idea of “graphical structure plus number theory” (Topsnut) for creating new type of graphical passwords was proposed firstly by Wang et al in [9, 10]. In making new Topsnut graphical passwords (Topsnut-GPWs), Wang et al [11] have designed some TopsnutGPWs by knowledge of graph theory for answering the following problem of number theory: Problem of odd-graceful KL-matching pairs: Let [0, 2q] = {0, 1, 2, . One can use odd-graceful KLmatching pairs to design more complex Topsnut-GPWs. We, in Section 2, will introduce several techniques by knowledge of graph theory. Our main works are to show new TopsnutGPWs made by the techniques, which are the part solutions of the problem of odd-elegant KL-matching pairs proposed in the last section. Our methods for dealing with the new Topsnut-GPWs can be transformed into algorithms

Definitions for techniques

Theoretical analysis and guarantee

Test and simultaneous

Conclusion and researching problems