Topological Public-Key Cryptography Based On Graph Image-Labellings For Information Security

In the field of information security, there are many public-key cryptographies, such as the RSA algorithm, EIGamal cryptography, Rabin algorithm and so on, these encryption algorithms are based on difficult algebraic problems. We propose a new encryption algorithm from the perspective of topology, which combine topological structures of graphs with matching-type image-labellings to generate public and private keys, and the new algorithm is based on the difficulty of judging the graph isomorphism problem. We construct two types of leaf self-similar trees, and our large-scale passwords can be generated on this basis, in addition, leaf self-similar tree increases the length and difficulty of the passwords for resisting the attack of supercomputers and quantum computers.