Search arXivSearch

arXiv · 2509.07408

MIMO FSO Systems in Hybrid Quantum Noise Environments: SKR Analysis with One- and Two-way CV-QKD Protocols

Abstract

This paper studies a multiple-input multiple-output (MIMO) free-space optical (FSO) communication system employing continuous-variable quantum key distribution (CV-QKD), with the goal to support secret key transmission between two legitimate users, Alice and Bob. All involved wireless channels are subjected to atmospheric turbulence leading to beam spreading, pointing error, and turbulence-induced fading, which along with the presence of hybrid quantum noise negatively impact secret key exchange. Furthermore, the legitimate MIMO FSO system faces the threat of compromise from an eavesdropper, Eve, employing a collective Gaussian attack to intercept the secret key exchange. Novel one- and two-way protocols for enhancing the security of the transmitted keys are proposed. To this end, the transmissivity of the FSO channels is mathematically formulated and bounds on the mutual information between the transmitted and received coherent states are obtained, which are then used for deriving novel expressions for the secret key rates (SKRs) for both one- and two-way protocols. The presented numerical results corroborate the proposed analytical secrecy framework, quantifying the SKR gains obtained by employing MIMO and the two-way protocol for FSO CV-QKD systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sushil Kumar, Soumya P. Dash, George C. Alexandropoulos. 2026-02-20. MIMO FSO Systems in Hybrid Quantum Noise Environments: SKR Analysis with One- and Two-way CV-QKD Protocols. https://arxiv.org/abs/2509.07408

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT