Adjacent vertex sum reducible edge coloring algorithm based on graph cryptography
Autor: | Qinghou Yuan, Shuai Sun, Jingwen Li, Yumei Kang |
---|---|
Rok vydání: | 2020 |
Předmět: |
Password
Authentication business.industry Computer science Cryptography Usability Identity (music) ComputingMilieux_MANAGEMENTOFCOMPUTINGANDINFORMATIONSYSTEMS Edge coloring Graph (abstract data type) Graphics business Algorithm ComputingMethodologies_COMPUTERGRAPHICS MathematicsofComputing_DISCRETEMATHEMATICS |
Zdroj: | 2020 IEEE 9th Joint International Information Technology and Artificial Intelligence Conference (ITAIC). |
DOI: | 10.1109/itaic49862.2020.9339087 |
Popis: | In this paper, an adjacent vertex sum reducible edge coloring algorithm (AVSREC) is designed, which can be applied to graphic cryptography. Through the user testing experiment of the identity authentication prototype system, it is verified that the graph password based on the adjacent vertex sum reducible edge coloring algorithm can better prevent shoulder peeping attack and improve the security effectively, and its usability is better than text password and general graphic password. |
Databáze: | OpenAIRE |
Externí odkaz: |