On Multiple Topological Authentications In The Encryption of Tree-like Networks

Abstract

Blockchain uses a large number of cryptographic algorithms to ensure security. We will construct multiple topological authentications by topological graphic passwords and Topsnut-matchings, since matchings' phenomenon appear in almost branches of mathematics. We present two new techniques for our works, and design three construction algorithms for building up our multiple topological authentications. Our algorithms are based on graph labellings and graph operations. We give detail examples for illustrating each construction algorithm, and distribute a matching of two multiple topological authentication sets for producing text-based passwords with million or billion bytes in order to use them in quantum computer age.