Skip to main content

Introduction to Quantum Cryptography

 

One of the great potential applications of quantum mechanics is quantum cryptography. According to physicists, quantum cryptography is a safer method for transmitting the desired information, as it uses the logic of quantum mechanics, unlike classical cryptography.

What matters in quantum cryptography is quantum keying. For this, basically, two quantum algorithms or protocols have been created.

The first of these is the BB84 protocol, which is still used today. This method was developed by Charles Bennett and Gilles Brassard in 1984.

This protocol takes advantage of the polarization states of photons. Let's start to explain the protocol through familiar names.

Let Alice want to send the requested information, for example, 11010011, to the recipient Bob. Let Eve, our third character, be the person who captures the quantum information Alice sent before it reaches Bob.

Alice will transmit 11010011 information, which is made up of photons, to Bob via fiber optic cables. | Let the and / filters be used to measure the 0 qubit, and the - and \ filters to measure the 1 qubit.

Let Bob measure the disposable quantum information that reaches Bob without being subjected to any espionage situation, using the filters in his hand, and the information he obtained is 11010110. As you can see, the information that Bob reaches is different from half of the information that Alice wants to send. The main reason for this is that Bob and Alice do not inform each other about their filters beforehand. Therefore, if Alice and Bob use the quantum switching filters they have previously agreed upon, the information will be delivered to the receiver correctly.

However, there is a risk here. Eve, which we define as a third character, may be able to hack information. However, Eve must be able to find the correct measuring filter. In this way, he can reach half-true or half-false information. If encryption is done by squaring the key decided by Alice and Bob, the security of the system increases even more. Thus, quantum cryptography is provided.

The second quantum cryptography method is the EPRBE protocol. This method is created by exploiting the quantum uncertainty and entanglement state. This protocol is somewhat complex in nature and therefore difficult to implement up to date.

Generally speaking, quantum cryptography is a subject that has been studied a lot by scientists. Because of the use of classical cryptology electronic circuit devices, they are more robust. However, creating a quantum state between photons and transmitting the generated photons without loss is a disadvantage. Because, due to any external factor such as temperature and interference, quantum states can be disrupted immediately. For all these reasons, quantum cryptographic optimizations are being made for military studies, although it seems difficult to adapt them to daily life for now.

Labels:

Comments

Post a Comment

Popular posts from this blog

Bloch Sphere – Geometric Representation of Quantum State

    It is very difficult to visualize quantum states before our eyes. The Bloch sphere represents quantum state functions quite well. The Bloch sphere is named after physicist Felix Bloch. As you can see in the Bloch sphere figure below, it geometrically shows the pure states of two-level quantum mechanical systems. The poles of the Bloch sphere consist of bits |0⟩ and |1⟩. Classically, the point on the sphere indicates either 0 or 1. However, from a quantum mechanics point of view, quantum bits contain possibilities to be found on the entire surface of the sphere. Traditionally, the z-axis represents the |0⟩ qubit, and the z-axis the |1⟩ qubit. When the wave function in superposition is measured, the state function collapses to one of the two poles no matter where it is on the sphere. The probability of collapsing into either pole depends on which pole the vector representing the qubit is closest to. The angle θ that the vector makes with the z-axis determines this probabilit...
1 comment
Read more

Statement of Bell's Inequality

 One of the most important applications of quantum mechanics is Bell's inequality. In 1965, John Stewart Bell actually thought that Einstein might be right and tried to prove it, but proved that quantum logic violated classical logic. It was a revolutionary discovery. Let's look at its mathematically simple explanation. To create the analogy, let's first write a classical inequality.   This inequality above is a classic expression. The quantum analogy of this expression represents the Bell inequality. With just one difference. Bell's inequality shows that the above equation is violated. Expressing Bell's inequality by skipping some complicated mathematical intermediates; While there is no such situation in the classical world that will violate the inequality we mentioned at the beginning, it is difficult to find a situation that does not violate this inequality in the quantum world. Reference https://www.youtube.com/watch?v=lMyWl6Pq904 https://slideplay...
1 comment
Read more

Bernstein–Vazirani Algorithm

  Quantum computers currently available are not sufficient to solve every existing classical problem due to their own characteristics. This does not mean that they are inferior to classical computers, or that, on the contrary, quantum computers should give all kinds of advantages over classical computers. Popular quantum algorithms solved in quantum computers are algorithms created by taking advantage of the superposition and entanglement properties of particles. So, they are algorithms created to show the prominent features of quantum properties. Today I will talk about an enjoyable algorithm that demonstrates the efficiency and speed of these quantum features. Known as the Bernstein - Vazirani algorithm is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in 1992. The purpose of this algorithm, which is a game, is to find a desired number. To put it more clearly, let's keep in mind a string of binary numbers, for example, 1011001. Next, let's write an algori...
Post a Comment
Read more