An efficient quantum cryptography's algorithm for data security
Ajit Singh · Indian Journal of Engineering and Materials Sciences · 2007
Present paper provides a conceptual framework on the proposed C-QUBITS Key exchange algorithm, which is used as a base for the data security through quantum computing. In the first phase a detailed description of the BB84 Cryptographic protocol is given, from which the first algorithm based on the quantum cryptography has been derived. In this the emphasis is on the loopholes present in this algorithm which makes it less effective. In the next phase the focus is made on the CQUBITS algorithm, which can be used for the exchange of key between the sender and the receiver. Thereafter, the key is used for the encryption of the data to be transferred between the two entities. This algorithm makes use of the concepts of quantum physics like polarization and more importantly C-NOT gate which is mainly used in case of qubits (quantum bits). Complete experimental set-up of the whole process involved in the algorithm has been presented and all possible cases have been discussed. Mathematical solution is derived which proves that data security through C-QUBITS algorithm is more effective and secure than other algorithms based on quantum approach. Quantum Cryptography was born in the early seventies when Stephen Wiesner wrote Conjugate Coding, which unfortunately took more than ten years to see the light of print 1 . In the mean time, Charles H Bennett (who knew of Wiesner's idea) and Gilles Brassard picked up the subject and brought it to fruition in a series of papers that culminated with the demonstration of an experimental prototype that established the technological feasibility of the concept 2 . Quantum cryptographic systems take advantage of Heisenberg's uncertainty principle, according to which measuring a quantum system in general disturbs it and yields incomplete information about its state before the measurement. Eavesdropping on a quantum communication channel therefore causes an unavoidable disturbance, alerting the legitimate users. This yields a cryptographic system for the distribution of a secret random cryptographic key between two parties initially sharing no secret information that is secure against an eavesdropper having at her disposal unlimited computing power. Once this secret key is established, it can be used together with classical cryptographic techniques such as the one-time-pad to allow the parties to communicate meaningful information in absolute secrecy.