The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Graphical passwords have been proposed as a possible alternative to text-based schemes, but graphical passwords, in storage and communication, require much more storage space than text based passwords, and network transfer delay is also a concern for them. An idea of "graphical structure plus number theory" (GSPNT) for designing new type of passwords is an alternative to typical graphical...
Cryptography has been around for thousands of years. We propose a new cryptographic model, lock trees and key trees, and our idea differs from current graphical passwords in this paper. Graphs and their labellings are applied to establish the concepts of key-trees and lock-trees based on abundant of graphs having smaller orders and their corresponding double odd-edge labellings. We propose two methods,...
We design cryptographical graphs for information security by the following principles: (1) be used conveniently in usually; (2) with strong security, that is, it is difficult to be broken; (3) there are enough graphs and labellings for making desired keys and locks. For answering the above problems, we prove the series cryptographical graphs have good properties, and show the guarantee for constructing...
The security of real networks is facing serious challenges and is harder than ever. We propose an idea of “topological structure + number theory” for designing new passwords. By means of graph theory we define a twin odd-graceful tree T = T1 ○ T2 obtained by identifying a certain vertex of T1 with a certain vertex of T2 together. We prove that some particular trees (key-models) can have their associated...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.