Connection Between Text-based Passwords and Topological Graphic Passwords

Abstract

Graphical passwords have been applied in information networks, such as QR code and those passwords for opening mobile phones. Topological graphic passwords (Topsnut-GPWs) differ from the existing graphical passwords, since they can be saved in computer by matrices and run quickly than the existing graphical passwords. We show that Topsnut-GPWs can be easily connected with text-based passwords, but no inverse process rewrite a Topsnut-GPW by the text-based passwords produced from this Topsnut-GPW. Our techniques can be associated with some well-known traditional encryptions. We point that Topsnut-GPWs have provable security and computational security since some graph labellings, which make Topsnut-GPWs, are related with mathematical conjectures, and many spaces of Topsnut-GPWs have huge cardinalities. The individuation of Topsnut-GPWs is an important working direction for withstanding breaks and attacks, and approximating unconditional security.