Splitting Graceful And Pan-graceful Codes Towards Information Security

摘要

Some of graphical passwords are in fashion in today's world, such an example is two-dimension code. Text-based passwords (TB-paws hereafter) have occupied an important position in Cryptography. Topsnut-gpws are a branch of graphical passwords and have many advantages in network encryption, for example, it is easy to derive TB-paws from Topsnut-gpws, but these TB-paws do not track the original Topsnut-gpws. We propose a new coloring, called splitting graceful coloring, to design a group of tree-like Topsnut-gpws that can be coincided a common Topsnut-gpw, and get a technique for building more complex Topsnut-gpws. A relationship between graceful graphs and trees labelled with splitting graceful colorings is presented. At the end of this article, we list several problems for deep investigation on Topsnut-gpws.