Secret-key extraction from atmospheric optical channels can generate common keys used by two communicating parties to encrypt their transmitted confidential information. The correlation time of turbulence-induced optical fluctuations imposes a restriction on the number of extracted uncorrelated key bits per second. To break this restriction, we propose a novel randomness sharing scheme between two communicating parties using an atmospheric optical channel equipped with random modulation and develop mathematical models for the common randomness source created by such a randomness-sharing scheme. Our randomness-sharing scheme provides the legitimate parties with the ability to decrease the temporal autocorrelation of the said common randomness source, which is called controllable common randomness source with memory (CCRSM), thereby enabling an enhanced secret-key extraction that can break the aforementioned restriction. Both the autocorrelation of the legitimate parties' observations of the CCRSM and the cross-correlation of the two legitimate parties' observations of the CCRSM are formulated and examined theoretically. It is found that the performing random modulation can decorrelate consecutive observations of the CCRSM obtained by the legitimate parties using a sampling interval smaller than the correlation time of turbulence-induced optical fluctuations. The cross-correlation coefficient of the eavesdropper's and legitimate parties' observations of the CCRSM is dealt with theoretically and the eavesdropping risk in the CCRSM-based key extraction is inspected for the fully-disclosed-single-modulation worst eavesdropping (FDSM-WE) scenario, partially-disclosed-single-modulation worst eavesdropping (PDSM-WE) scenario and double-modulation worst eavesdropping (DM-WE) scenario. It is shown that the FDSM-WE scenario has the highest degree of eavesdropping risk. Finally, the lowest limit of the secret-key capacity in consideration of using the CCRSM is theoretically formulated. The effects of random modulation on such the lowest limit are quantitatively analyzed from an information-theoretic perspective. It is manifested that random modulation does not harm the potential of extracting secret keys from the CCRSM's randomness component stemming from turbulence-induced optical fluctuations.
Secret-key extraction from atmospheric optical channels can generate common keys used by two communicating parties to encrypt their transmitted confidential information. The correlation time of turbulence-induced optical fluctuations imposes a restriction on the number of extracted uncorrelated key bits per second. To break this restriction, we propose a novel randomness sharing scheme between two communicating parties using an atmospheric optical channel equipped with random modulation and develop mathematical models for the common randomness source created by such a randomness-sharing scheme. Our randomness-sharing scheme provides the legitimate parties with the ability to decrease the temporal autocorrelation of the said common randomness source, which is called controllable common randomness source with memory (CCRSM), thereby enabling an enhanced secret-key extraction that can break the aforementioned restriction. Both the autocorrelation of the legitimate parties' observations of the CCRSM and the cross-correlation of the two legitimate parties' observations of the CCRSM are formulated and examined theoretically. It is found that the performing random modulation can decorrelate consecutive observations of the CCRSM obtained by the legitimate parties using a sampling interval smaller than the correlation time of turbulence-induced optical fluctuations. The cross-correlation coefficient of the eavesdropper's and legitimate parties' observations of the CCRSM is dealt with theoretically and the eavesdropping risk in the CCRSM-based key extraction is inspected for the fully-disclosed-single-modulation worst eavesdropping (FDSM-WE) scenario, partially-disclosed-single-modulation worst eavesdropping (PDSM-WE) scenario and double-modulation worst eavesdropping (DM-WE) scenario. It is shown that the FDSM-WE scenario has the highest degree of eavesdropping risk. Finally, the lowest limit of the secret-key capacity in consideration of using the CCRSM is theoretically formulated. The effects of random modulation on such the lowest limit are quantitatively analyzed from an information-theoretic perspective. It is manifested that random modulation does not harm the potential of extracting secret keys from the CCRSM's randomness component stemming from turbulence-induced optical fluctuations.
Extracting characteristic information from atmospheric optical channels can be utilized to generate shared keys for communication parties. However, the autocorrelation of channel feature information within the correlation time caused by atmospheric turbulence limits the number of unrelated key bits that can be extracted per second. To address this issue, a shared key extraction scheme for random modulation channels is proposed. The scheme employs a controllable shared random source model with memory (CCRSM) to quantify the observed values of CCRSM to obtain keys. During the quantization phase, an interleave block quantization algorithm is employed. Initially, legitimate parties interleave and group the obtained CCRSM observations to eliminate the impact of temporal autocorrelation; subsequently, the processed CCRSM observations are quantified using a single-threshold method per group to obtain an initial bit sequence; finally, an encoding mapping operation is applied to generate the key sequence. This algorithm ensures that the keys extracted between legitimate communication parties have a low inconsistency rate and good randomness, and the key generation rate is significantly improved. Experimental results indicate that this scheme effectively reduces the key disagreement rate and enhances the key generation rate. Under a signal-to-noise ratio (SNR) of 30dB, the scheme achieves a key disagreement rate of 4.39×10−4and a key generation rate of 2.99×106bits per second, and the generated shared random keys pass the randomness tests of the National Institute of Standards and Technology (NIST).
Common randomness arising from turbulence-induced signal fading in reciprocal optical wireless channels is a beneficial resource that can be used to generate secret keys shared by two legitimate parties. The concept of optical wireless channels using common-transverse-spatial-mode coupling (CTSMC) that can maintain perfect fading reciprocity in atmospheric turbulence is first developed in a general manner. Subsequently, by performing Monte Carlo simulations, the Johnson SB probability distribution is demonstrated to be appropriate for statistical description of turbulence-induced signal fading in an optical wireless channel constructed by use of two identical CTSMC transceivers, and the nature of correlation between signal fadings detected by two contiguous reception spatial modes is further quantitatively characterized, revealing that rapid spatial decorrelation between signal fadings observed by a legitimate party and an eavesdropper holds for scenarios of practical interest. Finally, the information theoretic capacity for generating secret keys from CTSMC-based optical wireless channels is theoretically formulated and quantitatively examined under different conditions, manifesting that the turbulence strength and average electrical signal-to-noise ratio have a noticeable combined impact on the secret key capacity, especially in the far-field case.
Secret-key distribution leveraging the fading characteristics of wireless optical channels has attracted significant attention. To address the challenges of high-frequency sampling over slowly varying channels, a turbulence-induced fading scrambling-assisted key distribution scheme is proposed to enhance the randomness of shared keys. Combined with random modulation, the scheme enables legitimate parties to obtain more decorrelated wireless signal sequences. Additionally, a specialized interleave quantization (IQ) method is introduced to improve the statistical properties of the generated keys. The entire observation sequence is processed using IQ to mitigate the impact of large-scale slow channel variations. Simulation and experimental results demonstrate that the proposed scheme generates highly random original key sequences at high sampling frequencies without increasing the key disagreement rate (KDR). The final key sequence, incorporating random modulation and interleaving, is evaluated using the NIST test suite, yielding p-values greater than 0.01. These results confirm the effectiveness of the proposed scheme in generating statistically random shared secret keys under slowly varying wireless optical channels.
To overcome the limitations of QKD, post-quantum cryptography, and computational security-based cryptography protocols in this paper, an atmospheric turbulence-controlled cryptosystem is proposed. The proposed encryption scheme employs the traditional scheme to utilize the atmospheric turbulence as the common source of randomness only in the initialization stage to determine the common parameters to be used in the proposed encryption scheme. To overcome low secret-key rates of traditional scheme, dictated by the long coherence time Tc of turbulence channel, the proposed encryption scheme updates the parameters of gamma-gamma distribution, used to generate irradiance samples for cumulative distribution function-based determination of the key, every Tc seconds and as such the final key is shaped by the atmospheric turbulence channel. We also describe a scheme that randomly selects one of several available paths in which the simultaneously measured irradiance samples, after interleaving, are used to generate the raw key. The secret-key rates of the proposed schemes are orders of magnitude higher compared to corresponding traditional QKD and source type physical-layer security schemes and are comparable with the state-of-the-art optical communication data rates.
In our recent paper, we proposed using the atmospheric turbulent channel as a source of randomness to simultaneously address various challenges in physical-layer security (PLS), quantum key distribution (QKD), and post-quantum cryptography (PQC). However, the long coherence time of atmospheric turbulence channels limits the achievable secret-key rates (SKRs). To address this issue, we initially leveraged the turbulence effects only during the system’s initialization phase. In this paper, we present a source-based secret key generation scheme that overcomes the limitations imposed by the long coherence time of the turbulent channel, without requiring initialization. The scheme utilizes both atmospheric turbulence and background radiation as sources of randomness. It offers security superior to PQC and is comparable to QKD, while enabling significantly higher SKRs, making it fully compatible with state-of-the-art optical communications.
Two legitimate parties, referred to as Alice and Bob, wish to generate secret keys from the wireless channel in the presence of an eavesdropper, referred to as Eve, in order to use such keys for encryption and decryption. In general, the secret key rate highly depends on the coherence time of the channel. In particular, a straightforward method of generating secret keys in static environments results in ultra-low rates. In order to resolve this problem, we introduce a low-complexity method called induced randomness. In this method, Alice and Bob independently generate local randomness to be used together with the uniqueness of the wireless channel coefficients in order to enable high-rate secret key generation. In this work, two scenarios are considered: first, when Alice and Bob share a direct communication channel, and second, when Alice and Bob do not have a direct link and communicate through an untrusted relay. After exchanging the induced randomness, post-processing is done by Alice and Bob to generate highly-correlated samples that are used for the key generation. Such samples are then converted into bits, disparities between the sequences generated by Alice and Bob are mitigated, and the resulting sequences are then hashed to compensate for the information leakage to the eavesdropper and to allow consistency checking of the generated key bit sequences. We utilize semantic security measures and information-theoretic inequalities to upper bound the probability of successful eavesdropping attack in terms of the mutual information measures that can be numerically computed. Given certain reasonable system parameters this bound is numerically evaluated to be 2-31and 2-10.57in the first and the second scenario, respectively.