Especial Total Colorings Towards Multiple Authentications In Network Encryption

Topological graphic coding (Topsnut-gpws) is a new type of graphical passwords, however it differs from the existing graphical passwords. Topsnut-gpws were contained by the topological coding, a mixture subbranch of graph theory and cryptography. For enriching technique of making Topsnut-gpws, we will design especial proper vertex colorings and proper total colorings by means of the traditional graph proper vertex/total colorings and graph labellings, and estimate the bounds of extremum values for some topological structures based on these colorings, finally, discuss especial sets obtained by these colorings and use these especial sets to generate multiple authentications for serving encrypting networks wholly. Some problems are distributed for further researching the topological coding.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  Bing Yao,et al.  Exploring Topological Graph Passwords of Information Security by Chinese Culture , 2018, 2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC).

[3]  Bing Yao,et al.  Matrices From Topological Graphic Coding of Network Security , 2019, 2019 IEEE 4th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC).

[4]  Bing Yao,et al.  Exploring New Cryptographical Construction of Complex Network Data , 2016, 2016 IEEE First International Conference on Data Science in Cyberspace (DSC).

[5]  Mingjun Zhang,et al.  Using Chinese Characters To Generate Text-Based Passwords For Information Security , 2019, ArXiv.

[6]  Chao Yang,et al.  Topological Graphic Passwords And Their Matchings Towards Cryptography , 2018, ArXiv.

[7]  Jin Xu,et al.  New-Type Graphical Passwords Made by Chinese Characters with Their Topological Structures , 2018, 2018 2nd IEEE Advanced Information Management,Communicates,Electronic and Automation Control Conference (IMCEC).

[8]  Bing Yao,et al.  Hanzi-TB-paws For Helping Chinese People To Memorize Their Passwords With Longer Bytes , 2019, 2019 IEEE 3rd Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC).

[9]  Joseph A. Gallian,et al.  A Dynamic Survey of Graph Labeling , 2009, The Electronic Journal of Combinatorics.

[10]  Jin Xu,et al.  The key-models and their lock-models for designing new labellings of networks , 2016, 2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC).

[11]  Razvan Pascanu,et al.  Relational inductive biases, deep learning, and graph networks , 2018, ArXiv.