Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
