Maximal Planar Graphs As Topological Authentications For Asymmetric Encryption

We, for asymmetric encryption, introduce colored topological authentication, Topcode-matrix authentication, cycle-coinciding operation, planar rhombus operation, $P$3-subdivision operation, algorithms for some operations, uncolored/colored planar graph homomorphisms, uncolored/colored planar graph anti-homomorphisms, planar graphic lattices based on planar operation base, ß-colored planar graphic lattices based on ß-colored planar operation base, maximal planar graphic lattice, ß-colored maximal planar graphic lattice. We present the advantages of using maximal planar graphs in topological authentication.