Using Chinese Characters To Generate Text-Based Passwords For Information Security

Abstract

Graphical passwords (GPWs) are in many areas of the current world, in which the two-dimensional code has been applied successfully nowadays. Topological graphic passwords (Topsnut-gpws) are a new type of cryptography, and they differ from the existing GPWs. A Topsnut-gpw consists of two parts: one is a topological structure (graph), and one is a set of discrete elements (a graph labelling, or coloring), the topological structure connects these discrete elements together to form an interesting "story". It is not easy to remember passwords made up of longer bytes for many Chinese people. Chinese characters are naturally topological structures and have very high information density, especially, Chinese couplets form natively public keys and private keys in authentication. Our idea is to transform Chinese characters into computer and electronic equipments with touch screen by speaking, writing and keyboard for forming Hanzi-gpws (one type of Topsnut-gpws). We will translate Chinese characters into graphs (Hanzi-graphs), and apply mathematical techniques (graph labellings) to construct Hanzi-gpws, and next using Hanzigpws produces text-based passwords (TB-paws) with longer bytes as desired. We will explore a new topic of encrypting networks by means of algebraic groups, called graphic groups (Ablian additive finite group), and construct several kinds of self-similar Hanzi-networks, as well as some approaches for the encryption of networks, an important topic of researching information security. The stroke order of writing Chinese characters motivates us to study directed Hanzi-gpws based on directed graphs. We will introduce flawed graph labellings on disconnected Hanzi-graphs such that each Hanzi-gpw with a flawed graph labelling can form a set of connected Topsnut-gpws, like a group. Moreover, we introduce connections between different graphic groups that can be used to encrypt networks based on community partition.

Graph Set-colorings And Hypergraphs In Topological Coding

“…Theorem 8. [30] Every connected graph admits a v-set e-proper graceful labeling defined in Definition 11. Theorem 9.…”

Graph Homomorphisms Based On Particular Total Colorings of Graphs and Graphic Lattices

“…If the matrix in problem has been found, it is difficult to guess the desired graphs, since it will meet NP-hard problems, such as, Graph Isomorphic Problem, and Hanzi-graph Decomposition Problem (Ref. [14]).…”