What is B92 Protocol in Quantum Cryptocraphy?

The B92 protocol is a quantum key distribution (QKD) protocol developed by Charles Bennett in 1992 as a simpler alternative to the earlier BB84 protocol. The aim of B92 was to make quantum key exchange less complex than BB84. It is considered a “minimal protocol” for quantum key generation because it uses only two non-orthogonal states for encoding.

Principles of B92

Unlike BB84, which uses four quantum states (two conjugate bases), the B92 protocol employs only two non-orthogonal quantum states to encode bits. These two states are typically chosen to be two non-orthogonal polarizations of a single photon. For instance, Alice might use a horizontally polarized photon (→) to represent the value 0 and a diagonally polarized photon with +45° (↗) to represent the value 1. Alternatively, the protocol can use polarizations of 90 degrees and 135 degrees. In a more general form, Alice uses states from the set |0⟩, |1⟩, where |0⟩ and |1⟩ are the two non-orthogonal states. For example, |0⟩ and cos θ|0⟩-sin θ|1⟩can be used. A specific example uses phase angles in a Mach-Zehnder interferometer: (φA, φB) = (0, 3π/2) for 0-bits and (φA, φB) = (π/2, π) for 1-bits.

The security of the B92 protocol depends on the principle that non-orthogonal quantum states cannot be perfectly distinguished by any measurement. This means that any eavesdropper (Eve) trying to differentiate between Alice’s two encoding states will certainly introduce errors that can be detected by Alice and Bob.

How Does B92 Protocol Work?

The B92 protocol, for generating a key of length n, generally involves the following steps:

Preparation and Quantum Transmission Phase:

  • Alice and Bob both make two private random binary sequences of length m, where m is greater than or equal to n.
  • Alice turns her first set of random bits into a set of photons. There are two types of non-orthogonal polarizations that she can use to send a bit 0. These are |0⟩ and horizontally polarized photons. She uses the other non-orthogonal polarization (like |1⟩ or a +45° diagonally polarized photon) to send a bit 1. Her second random bit sequence tells her which polarization to use for each bit.
  • Alice sends these photons to Bob one at a time through a quantum link. Bob knows when the photons were sent and can tell if there were any losses.

Measurement Phase:

  • Bob has a second set of random bits as well. He picks one of two measurement bases for each photon that comes in based on this pattern. He picked two measurement bases so that one doesn’t align with any of Alice’s encoding states and the other doesn’t align with either of Alice’s encoding states. For instance, Bob might measure in the range of |0⟩ to |1⟩ if Alice sends them.
  • If Alice sent |0⟩ and Bob measures in the |0⟩ base, he will never find it, which means his test was a “no.” If he measures in the |1⟩ base, he might find it with a chance, which would result in a random result. In the same way, if Alice sent |1⟩ and Bob measures in the |0⟩ basis, he might get a random result.
  • If he measures in the |1⟩ basis, he will never find it.The measures Bob takes for each photon he receives are written down and kept hidden.

Basic Key Extraction Phase:

  • Bob announces publicly, over a classical channel, the sequence of measurement bases he used for each received photon, but not the measurement outcomes.
  • Alice then tells Bob, through the classical channel, in which case his chosen measurement basis would have yielded a definite outcome (a ‘no’ detection) if there were no noise or eavesdropping. Specifically, if Alice sent |0⟩ and Bob measured in the basis orthogonal to it (|0⟩ ), or if Alice sent |1⟩ and Bob measured in the basis orthogonal to it (|1⟩ ), a detection should ideally not occur.
  • Bob takes the bits corresponding to the cases where his test (measurement in the basis orthogonal to one of Alice’s states) passed without a detection as part of the raw key. He reports the positions of these bits to Alice via the public channel.
  • For example, if Alice sent |1⟩ and Bob measured in the |0⟩ basis and got no detection, this event indicates that Alice likely sent a ‘1’ (represented by |1⟩), and this bit is added to the raw key.

Error Estimation and Reconciliation:

  • Alice and Bob have a raw key after the basic key extraction. They need to figure out how often this key is wrong, which could be because of noise in the quantum channel or someone listening in.
  • They can do this by comparing a small group of their raw key bits with everyone. They move on to the next step if the mistake rate is less than a certain level. A lot of errors means that someone is probably trying to listen in, so they might decide to throw away the key and start the process over.

Privacy Amplification:

Even I might have learned some things about the key, even if the mistake rate is reasonable. Privacy amplification uses a hash function on the resolved key to make the final key shorter and safer. This reduces Eve’s information to a very small level.

Advantages of B92 Protocol

  • Ease of use: BB92 only uses two quantum states for encoding, which could make the tools needed easier to build than for BB84, which uses four states.
  • It is sometimes called the “minimal protocol” for QKD because it uses the fewest non-orthogonal states possible.

Disadvantages of B92 Protocol

  • Lower Efficiency: The basic B92 protocol’s efficiency is one of its main flaws. There are many photons that were sent, but they don’t add up to the end key because Bob’s measurement choice wasn’t in line with Alice’s sent state. The basic B92 procedure has been shown to have an effective transfer rate of 25%. This means that 75% of the measurements are thrown away, which results in a very low key rate.
  • Security Considerations in Noisy Channels: The B92 protocol is completely safe in a perfect lossy channel, but its safety in noisy channels needs to be carefully looked at. For example, if the original qubit error rate in the channel is higher than 0.5, it’s hard to tell if someone is listening in by just looking at the error rate. If the original qubit error is less than 0.5, however, any spying that raises the noise rate above this level can be found.

Changes and improvements

Several changes have been suggested to the basic B92 protocol to make it work better. One way to do this is to use Pulse Position Modulation (PPM). Each optical pulse in PPM can stand for more than one bit by recording the polarization (horizontal or +45° diagonal) in a certain time slot within a frame of several slots. Then Bob uses the + or ò base to measure, and a finding in a certain polarization and time slot is equal to a multi-bit value. This makes it possible for a higher key rate than with the basic approach.

Security of B92

Fundamental ideas of quantum physics, like how we can’t exactly tell the difference between non-orthogonal quantum states and how trying to measure an unknown quantum state causes chaos, are what make the B92 protocol safe. If someone tries to listen in on the conversation by detecting and measuring the photons, they will always mess up the connections between Alice’s sent bits and Bob’s received bits. If Alice and Bob notice that their shared key is making a lot of mistakes, they can tell that someone is listening in.
There are formal security proofs for the B92 protocol that show it is completely safe from all quantum mechanical threats, as long as certain conditions are met, like having a source that sends out single photons. Photon sources that aren’t perfect could make the security less safe, but self-checking sources and other ideas have been put forward to reduce these risks.

Implementation of B92

Different physical methods can be used to execute the B92 protocol, but polarised photons are often used. A Mach-Zehnder interferometer is another useful tool. In this one, Alice and Bob manage phase modulators to store and measure the quantum states. The chance of finding a photon at Bob’s detector relies on the phase differences that Alice and Bob set. This lets them make a secret key using the phase differences that match their random bits.

B92 Compared to the BB84 protocol

Although B92 is simpler in terms of the amount of quantum states it uses, it is not as efficient in its basic form as BB84, which is a big problem. Even though BB84’s use of two conjugate bases makes it a little more difficult to understand, it has a higher potential maximum efficiency. In order to close this productivity gap, changes and improvements are being made to B92, such as the use of PPM. Both methods are important to quantum cryptography and have been shown to work in the real world.

To sum up, the B92 algorithm uses the properties of non-orthogonal quantum states to make quantum key distribution more theoretically elegant and easier. Even though its basic form isn’t very efficient, improvements and changes are still making it an important protocol for the ongoing development of safe quantum communication technologies.

What are non-orthogonal quantum states ?

Quantum states that aren’t orthogonal are like vectors that aren’t exactly straight across from each other. As shown in quantum physics, vectors can be used to show states of a system, such as the spin of an electron or the polarisation of a photon.

Two quantum states are orthogonal if they can be fully told apart by a measurement. Measuring one will tell you for sure that it’s not the other. But there is some “overlap” between non-orthogonal states. You might get the answer for the other state if you try to measure a quantum system that is in one of the two non-orthogonal states. This is because the states overlap, even if the system was in the first one.

Quantum cryptography methods like B92 depend on this basic feature being present. These methods are safe because someone listening in can’t exactly tell the difference between the non-orthogonal states used to encode the key without making mistakes that can be seen. Any attempt to measure and tell these overlapped states apart will always cause a disturbance, which will let the real people talking know that someone is listening in.

What is Quantum Computing in Brief Explanation

Quantum Computing: Quantum computing is an innovative computing model that...

Quantum Computing History in Brief

The search of the limits of classical computing and...

What is a Qubit in Quantum Computing

A quantum bit, also known as a qubit, serves...

What is Quantum Mechanics in simple words?

Quantum mechanics is a fundamental theory in physics that...

What is Reversible Computing in Quantum Computing

In quantum computing, there is a famous "law," which...

Classical vs. Quantum Computation Models

Classical vs. Quantum Computing 1. Information Representation and Processing Classical Computing:...

Physical Implementations of Qubits in Quantum Computing

Physical implementations of qubits: There are 5 Types of Qubit...

What is Quantum Register in Quantum Computing?

A quantum register is a collection of qubits, analogous...

Quantum Entanglement: A Detailed Explanation

What is Quantum Entanglement? When two or more quantum particles...

What Is Cloud Computing? Benefits Of Cloud Computing

Applications can be accessed online as utilities with cloud...

Cloud Computing Planning Phases And Architecture

Cloud Computing Planning Phase You must think about your company...

Advantages Of Platform as a Service And Types of PaaS

What is Platform as a Service? A cloud computing architecture...

Advantages Of Infrastructure as a Service In Cloud Computing

What Is IaaS? Infrastructures as a Service is sometimes referred...

What Are The Advantages Of Software as a Service SaaS

What is Software as a Service? SaaS is cloud-hosted application...

What Is Identity as a Service(IDaaS)? Examples, How It Works

What Is Identity as a Service? Like SaaS, IDaaS is...

Define What Is Network as a Service In Cloud Computing?

What is Network as a Service? A cloud-based concept called...

Desktop as a Service in Cloud Computing: Benefits, Use Cases

What is Desktop as a Service? Desktop as a Service...

Advantages Of IDaaS Identity as a Service In Cloud Computing

Advantages of IDaaS Reduced costs Identity as a Service(IDaaS) eliminates the...

NaaS Network as a Service Architecture, Benefits And Pricing

Network as a Service architecture NaaS Network as a Service...

What is Human Learning and Its Types

Human Learning Introduction The process by which people pick up,...

What is Machine Learning? And It’s Basic Introduction

What is Machine Learning? AI's Machine Learning (ML) specialization lets...

A Comprehensive Guide to Machine Learning Types

Machine Learning Systems are able to learn from experience and...

What is Supervised Learning?And it’s types

What is Supervised Learning in Machine Learning? Machine Learning relies...

What is Unsupervised Learning?And it’s Application

Unsupervised Learning is a machine learning technique that uses...

What is Reinforcement Learning?And it’s Applications

What is Reinforcement Learning? A feedback-based machine learning technique called Reinforcement...

The Complete Life Cycle of Machine Learning

How does a machine learning system work? The...

A Beginner’s Guide to Semi-Supervised Learning Techniques

Introduction to Semi-Supervised Learning Semi-supervised learning is a machine learning...

Key Mathematics Concepts for Machine Learning Success

What is the magic formula for machine learning? Currently, machine...

Understanding Overfitting in Machine Learning

Overfitting in Machine Learning In the actual world, there will...

What is Data Science and It’s Components

What is Data Science Data science solves difficult issues and...

Basic Data Science and It’s Overview, Fundamentals, Ideas

Basic Data Science Fundamental Data Science: Data science's opportunities and...

A Comprehensive Guide to Data Science Types

Data science Data science's rise to prominence, decision-making processes are...

“Unlocking the Power of Data Science Algorithms”

Understanding Core Data Science Algorithms: Data science uses statistical methodologies,...

Data Visualization: Tools, Techniques,&Best Practices

Data Science Data Visualization Data scientists, analysts, and decision-makers need...

Univariate Visualization: A Guide to Analyzing Data

Data Science Univariate Visualization Data analysis is crucial to data...

Multivariate Visualization: A Crucial Data Science Tool

Multivariate Visualization in Data Science: Analyzing Complex Data Data science...

Machine Learning Algorithms for Data Science Problems

Data Science Problem Solving with Machine Learning Algorithms Data science...

Improving Data Science Models with k-Nearest Neighbors

Knowing How to Interpret k-Nearest Neighbors in Data Science Machine...

The Role of Univariate Exploration in Data Science

Data Science Univariate Exploration Univariate exploration begins dataset analysis and...

Popular Categories