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.
In this paper, we proposed the Implementation of Perfect Time Eavesdropping in Position Based Quantum Cryptography. The Security of Quantum Key Distribution lies in the Laws of Quantum Mechanics and is recognized to be one of the most secure cryptography ever known. The major advantage of Position-Based Key Distribution is that an authenticated server or device will be able to use its InterSpace Positions...
The relation between Brain or Mind and Consciousness is unknown for quite a while. Several Theories and Compositions have been made by Neurologists all over the Globe; still, the relation is still not finite. We face the perception of Time every moment. This perception what Psychologists define as time is nothing but interference combined with interactions of one state of matter with the other which...
Machine Learning or Artificial Intelligence basically involves tasks of modifying and supervising problems taken as vectors in multi-dimensional space. The Primitive algorithms which are used take Polynomial Time for computing such vector problems which are not fruitful for us, on the other hand, Quantum algorithms have the capability to solve such vector problems in a considerable amount of time...
In the paper we interpret the Church Turing thesis of Computation Algorithm and how it differs from the strong Church Turing thesis in the field of computation. Church Turing thesis can be classified as Strong Church Turing thesis and Normal Church Turing thesis. Church Turing hypothesis says “that a computing problem can be solved in any computer if and only if it can be solved on a very simple ‘machine’,...
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.