Next Article in Journal
Dynamical Field Inference and Supersymmetry
Next Article in Special Issue
Function Computation under Privacy, Secrecy, Distortion, and Communication Constraints
Previous Article in Journal
Multilevel Deep Feature Generation Framework for Automated Detection of Retinal Abnormalities Using OCT Images
Previous Article in Special Issue
Full-Duplex Relay with Delayed CSI Elevates the SDoF of the MIMO X Channel
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Key Generation Method Based on Multi-Satellite Cooperation and Random Perturbation

1
Wireless Communication Technology Office, Information Engineering University, Zhengzhou 450002, China
2
School of Information and Communications Engineering, Xi’an Jiaotong University, Xi’an 710049, China
*
Author to whom correspondence should be addressed.
Entropy 2021, 23(12), 1653; https://doi.org/10.3390/e23121653
Submission received: 13 October 2021 / Revised: 30 November 2021 / Accepted: 3 December 2021 / Published: 8 December 2021
(This article belongs to the Special Issue Information-Theoretic Approach to Privacy and Security)

Abstract

:
In low-earth-orbit (LEO) satellite-to-ground communication, the size of satellite antennae is limited and the satellite motion trajectory is predictable, which makes the channel state information (CSI) of the satellite-to-ground channel easy to leak and impossible to use to generate a physical layer key. To solve these problems, we propose a key generation method based on multi-satellite cooperation and random perturbation. On the one hand, we use multi-satellite cooperation to form a constellation that services users, in order to increase the equivalent aperture of satellite antennae and reduce the correlation between the legal channel and the wiretap channel. On the other hand, according to the endogenous characteristics of satellite motion, a random perturbation factor is proposed, which reflects the randomness of the actual channel and ensures that the CSI of the legal channel is not leaked due to the predictability of satellite motion trajectory. Simulation results show that the proposed method can effectively reduce the leakage of the legal channel’s CSI, which makes the method of physical layer key generation safe and feasible in the LEO satellite-to-ground communication scene.

1. Introduction

With the development of wireless communication technology, LEO satellite communication technology has become an important part of global wireless communication [1,2]. Compared with ground communication, LEO satellite communication has wider coverage and larger communication capacity. Compared with geostationary earth orbit (GEO) satellite communication, LEO satellite communication has lower delay and transmission loss [3,4]. Therefore, the study of LEO satellite communication is of far-reaching significance for building 6G Space-Air-Ground Integrated Networks (SAGINs) and meeting the seamless global coverage of future communication networks [5,6,7,8].
However, due to the wide coverage and broadcasting characteristics of wireless LEO satellite communications, the satellite-to-ground signals can be freely transmitted within hundreds of kilometers on the ground, which allows eavesdroppers, ultra-long distances away, to wiretap the CSI of the legal channel.
At present, there are two main methods to solve the security problems in LEO satellite communications:
  • Traditional Cryptography: Traditional cryptography generates secret keys through a cryptographic algorithm, and then distributes them to legitimate users to encrypt the plaintext. This method uses the computational complexity of cryptographic algorithms to ensure the security of cipher text. Actually, encryption and decryption calculations in this method require a lot of computing resources. Additionally, key management and distribution rely on complex protocol architecture. So, it is not suitable for LEO satellite communication systems with limited computing resources, rapid changes in network topology, and massive access to users. Further, with the rapid development of advanced computing technology, this method based on computational complexity faces challenges in terms of reliability and robustness [9].
  • Physical Layer Security (PLS): Physical layer security uses the endogenous characteristics of the wireless channel, such as time varying, randomness and uniqueness, to directly extract the secret key. This method has the advantages of simple cryptographic calculations and no additional overhead on key management and distribution [10,11], which is suitable for LEO satellite communication systems. Therefore, the use of PLS technology to solve the security problems in LEO satellite communication has attracted great attention from many scholars.
At present, research on physical layer security technology for satellite-to-ground communication is concentrated on physical layer security transmission, mainly including the following three aspects [9]:
  • Security Performance Analysis: For example, ref. [12] analyzed the security performance of a satellite-to-ground communication network with a legitimate user and eavesdropper. This paper also proposed the closed expressions of confidential capacity probability, confidential interruption probability and average confidentiality probability.
  • Transmission Power Optimization: For example, ref. [13] proposed a transmission power optimization method for multi-antenna satellite communication based on PLS, which can effectively prevent eavesdroppers from wiretapping communication signals.
  • Security Rate Maximum: For example, ref. [14] used the PLS method to optimize the beamforming vector by combining the uplink and downlink time allocation according to the requirements of different target receivers for different speeds and data transmission rates, which can maximize the system security rate.
According to existing research, the physical layer key generation technology for LEO satellite communication scenarios has not been extensively studied. This is mainly due to the following two reasons:
  • The Insecurity of Satellite Trajectory: Different from the electromagnetic wave propagation conditions of the ground scenario, satellite-to-ground communication includes two parts: the space segment and the telephone segment. The CSI of the satellite-to-earth channel is directly related to the position of satellites and ground receivers [3,15]. Due to the openness of satellite motion parameters, satellite orbits are predictable, which means eavesdroppers can directly obtain the position of satellites and ground receivers. This leads to the revelation of the legal channel’s CSI and insecurity of physical layer key sources.
  • The Insecurity of Satellite Signals: Due to the limited size, satellite antennae always have a small equivalent aperture and a wide signal beam in long-distance satellite-to-ground communication. When satellite signals reach the ground, they can be regarded as far-field parallel lights [16]. Therefore, each satellite signal can cover numerous ground receivers within a range of hundreds of kilometers, and each satellite-to-ground channel is highly correlated with another. This means eavesdroppers can easily obtain the CSI of the legal channel by estimating relevant channels. In this case, the physical layer key generation method is impractical.
To solve the above problems, we proposed a model of multi-satellite cooperation and random perturbation in a satellite-to-ground communication system, and put forward a key generation method based on it. The main contributions are as follows:
  • We proposed a multi-satellite coordination model to solve the problem that the channels between a single satellite and multiple ground receivers have strong correlations.
  • We introduced a satellite perturbation factor into the channel model to restore the endogenous randomness of the satellite-to-ground channel, which can improve the randomness of the channel and prevent eavesdroppers from predicting the satellite position precisely.
  • Based on the above model, we proposed a key generation method to generate secret keys from the satellite-to-ground channel, which includes four parts: channel estimation, quantify, information negotiation and privacy magnification.
  • To verify the feasibility of the proposed method, we simulated and analyzed the randomness and safety of the generated key. The simulation results show that the proposed model has endogenous randomness and the proposed key generation method is feasible.

2. System Model

As shown in Figure 1, we consider a LEO satellite-to-ground communication network model, including N LEO satellites, a legitimate user Bob and an eavesdropper Eve. Each node is equipped with a single antenna. Bob hopes to extract secret keys from satellite-to-ground channels, and Eve passively eavesdrops on the process without interfering with the key generation process.
When the satellites move along the orbits, define two complex random variables h k and g k as the channel from the k th satellite to Bob and Eve, respectively. Define the mean of h k and g k is 0, and the variance of them is σ h k 2 = σ h 2 and σ g k 2 = σ g 2 , k 1 , 2 , , N . Define the position shifts of satellites on ideal orbits caused by the gravitational force of stars, sunlight pressure and other factors as the perturbation factor. Considering the impact of satellite perturbation in the actual satellite communication scenario, we introduce the perturbation offset phase Δ φ = Δ φ 1 , , Δ φ k and Δ θ = Δ θ 1 , , Δ θ k . The actual channel from the k th satellite to Bob and Eve can be defined as h k e j π sin Δ φ k and g k e j π sin Δ θ k , respectively, where Δ φ U π 2 , π 2 and Δ θ U π 2 , π 2 . The channel from N satellites to Bob and Eve can be defined, respectively, as h = h 1 e j π sin Δ φ 1 , h 2 e j π sin Δ φ 2 , , h N e j π sin Δ φ N and g = g 1 e j π sin Δ θ 1 , g 2 e j π sin Δ θ 2 , , g N e j π sin Δ θ N . Obviously, the perturbation factor is a random and unpredictable factor, which indicates the unique endogenous attributes of satellites that differ from other communication entities.
In the LEO satellite-to-ground communication system, the electromagnetic wave signals sent by satellites need to penetrate outer space and the atmosphere to reach the ground, which is affected by many factors during the propagation process, such as the atmospheric effect, large-scale fading, the multi-path effect, shadow fading, and Doppler Le frequency shift. According to [17], the satellite-to-ground channel can be divided into two parts: the space segment and the ground segment, which represents satellite-to-ground propagation and ground-to-environment propagation, respectively.
1.
Space Segment
The transmission of signals in the space segment is mainly affected by the atmospheric effect. The envelope and phase of the signal obey the normal distribution, which can be expressed by
P a ( r a ) = 1 2 π σ a 2 exp ( r a μ a ) 2 2 σ a 2
P a ( φ a ) = 1 2 π η a 2 exp ( φ a u a ) 2 2 η a 2
where r a and φ a represent the envelope and phase of the signal, and μ a and u a represent the mean of the envelope and phase, and σ a 2 and η a 2 represent the variance of the envelope and phase.
2.
Ground Segment
Affected by the multi-path effect, the signal in the ground segment can be expressed as the sum of the LOS component and the multi-path component, which can be expressed as
r exp ( j θ ) = z exp ( j Φ z ) + s exp ( j Φ s )
where r and θ represent the amplitude and phase of received signals, z and Φ z represent the amplitude and phase of the LOS component, s and Φ s represent the amplitude and phase of the multi-path component.
According to the influence of shadow fading on the LOS component, the three states of (3) and their probability distributions are as follows:
When the LOS component is not blocked, the signal obeys the Rice distribution:
P R i c e ( r ) = r w 0 · exp r 2 + A 2 w 0 I 0 A r w 0 ( A 0 , r 0 )
where w 0 = ε [ r 2 ] represents the average power of the multi-path component, A represents the power of the LOS component, and I 0 ( · ) represents the zero-order Bessel function of the first kind.
When the LOS component is partially blocked, the signal obeys the Loo distribution:
P L o o ( r ) = 0 1 z exp ( ln z μ ) 2 2 σ 0 r 2 + z 2 2 σ 0 · I 0 r z w 0 d z
where μ and σ 0 represent the mean and variance of log-normal distribution.
When the LOS component is completely blocked, the signal obeys the Rayleigh distribution:
P R a y 1 ( r ) = r w 0 · exp r 2 2 w 0 ( r 0 )
In order to describe the long-term dynamic characteristic of the channel, the above three states can be described by a Markov process, which can be given by
P ( r ) = ω 1 P R a y 1 ( r ) + ω 2 P L o o ( r ) + ω 3 P R i c n ( r )
where ω i represents the probability that the system is in state i . Considering the channel characteristics of the space segment and the ground segment, the phase and envelope of the LEO satellite-to-ground channel can be expressed as
P a l l ( r ) = P a ( r a ) · P ( r )
P a l l ( φ ) = P a ( φ a ) · P ( φ )
It can be seen from (3) that the existence of the LOS path means the satellite-to-ground communication scenario cannot meet the channel uniqueness principle. Even if the distance between Eve and Bob is much longer than half of the wavelength, there is still a strong correlation between the legal channel and the wiretap channel.

3. Secret Key Generation Method

Based on the above system model and typical point-to-point physical layer key generation method, we proposed a key generation method for LEO satellite-to-ground communication scenarios, which includes four parts: channel estimation, quantify, information negotiation and privacy magnification [18,19,20].

3.1. Channel Estimation

3.1.1. Channel Estimation of Bob

Define x as the pilot transmitted from satellites to Bob. The signal received by Bob and Eve can be given by [21,22]
y b = h 1 e j π sin Δ φ 1 h N e j π sin Δ φ N x x + n b = k = 1 N h k e j π sin Δ φ k x + n b
y e = g 1 e j π sin Δ θ 1 g N e j π sin Δ θ N x x + n e = k = 1 N g k e j π sin Δ θ k x + n e
where n b and n e denote the additive white Gaussian noise of Bob and Eve with mean 0 and variance σ n 2 , respectively. According to the reciprocity of the wireless channel, Bob and Eve can use pilot signals sent by satellites to estimate the channel [23]. The channel estimation results of Bob and Eve can be expressed as
h ˜ = x * x 2 y b = k = 1 N h k e j π sin Δ φ k + x * x 2 n b
g ˜ = x * x 2 y e = k = 1 N g k e j π sin Δ θ k + x * x 2 n e
where x * is the conjugation of x and m + n i = m 2 + n 2 m , n R .

3.1.2. Channel Estimation of Satellites

Define a as the pilot transmitted from Bob to satellites. Due to the reciprocity of uplink and downlink channels, the signal of k th satellite received can be given by
y k = h k e j π sin Δ φ k a + n b k
where n b k represents the additive white Gaussian noise from k th satellite to Bob. The channel estimation results of k th satellite can be expressed as
h ˜ k = h k e j π sin Δ φ k + a * a 2 n b k
In order to obtain the same key source for both the sending and receiving ends, each satellite needs to share the channel estimation results obtained by itself to all satellites through the inter-satellite communication link. When information sharing between the satellites is completed, the key source obtained by each satellite can be expressed as
z ˜ = n = 1 k h ˜ k e j π sin Δ φ k + a * a 2 n b k
Since this process transmits signals through the inter-satellite link, Eve cannot eavesdrop on relevant information.
From (12) and (16), it can be seen that both satellites and Bob have obtained the sum of CSI of N satellite-to-ground channels, which has intrinsic security attributes of time varying and randomness. In the proposed method, we used the sum of CSI as key source for physical layer key generation.

3.2. Quantify

After channel estimation, a continuous signal can be quantized into discrete signals by determining the quantization threshold. In order to maximize the information entropy after quantization, we adopted the method of equal probability quantization, so that the probability of samples falling into each quantization interval is equal.
Moreover, the amplitude and phase information are quantized separately, considering the distribution that they obey. Since Eve cannot obtain key source with the same distribution as Bob, she cannot obtain a quantitative result consistent with Bob.

3.3. Information Negotiation

In order to ensure that legitimate communication parties obtain a consistent key, information negotiation techniques based on protocol are usually used [24]; or an error-correcting code. In order to reduce the time of information exchange, we select a Low-Density Parity Check code (LDPC) with a code length of 2000 for information negotiation, which uses the error correction capability of LDPC to correct the inconsistent bits between the quantization results.

3.4. Privacy Magnification

To enhance the bit mismatch ratio (BMR) between the key generated by legal users and Eve, we use the hash function of the SHA256 algorithm for privacy amplification [25]. Although this procedure cannot increase the randomness of the original key, it avoids the possibility of weak keys causing loopholes in the encryption algorithm.

4. Theoretical Analysis

4.1. Equivalent Near-Field Model Analysis

Due to the limited size of satellite antennae and the long distance from the satellite to the ground, satellite signals are far-field parallel light when they reach Bob and Eve. Taking the k th satellite signal as an example, the far-field parallel light modeling of Bob and Eve is shown in Figure 2, where d denotes the distance between Bob and Eve, and θ k denotes the angle between the direction of the k th satellite signal and the normal. As shown in Figure 2, the channel between the k th satellite and Eve can be given by
g k = h k e j 2 π d sin θ k λ
where λ denotes the wavelength. In the far-field model, define d = λ / 2 , then
g k = h k e j π sin θ k
Theorem 1.
In the far-field model, the larger the number and spacing of satellites, the larger the equivalent aperture of satellite antennae, the narrower the signal beam, and the lower the correlation between the channel from satellite to Bob and Eve. In this case, the far-field model can be equivalent to the near-field model for analysis.
Proof of Theorem 1.
According to the actual communication scenario, we model the N satellites with an overall line model. l is the satellite spacing distance (100–120 km), L is the linear array length, λ is the wavelength, and H is the distance between the line array and Bob (1000–2000 km). The LEO satellite-to-ground communication frequency is in the ka band (29.1–29.3 GHz). The equivalent antenna aperture of the uniform linear array can be expressed by [26]:
ρ 0 = L λ = ( N 1 ) l λ
According to the definition of the electromagnetic near-field model and the far-field model, when H 2 ρ 0 2 / λ min , this system can be considered as a far-field model. Conversely, when H < 2 ρ 0 2 / λ min , this system can be considered as a near-field model [26]. Substituting the relevant parameters above into (19), it can be seen that H < < 2 ρ 0 2 / λ min , in which case the terminal distance can be degenerated from the far-field model to the near-field model. Therefore, a constellation composed of multiple satellites can be equivalent to an antenna with a super-large aperture, and the equivalent aperture increases as the number of satellites and the distance between adjacent satellites increase. In the near-field model, due to the spatial uniqueness of the wireless channel, Eve cannot obtain the relevant information of the legal channel. In this case, Bob can use the sum of N satellite-to-earth channels to generate the physical layer key.

4.2. Security Analysis

In the physical layer key generation method, the security of the key source comes from the legal channel cannot be eavesdropped on. In order to prove that the proposed method can guarantee the security of the legal channel and further study the influence of number of satellites and the perturbation factor on it, we analyzed the security of the legal channel in this section.
According to the definition of the correlation coefficient, define A and B as two complex random variables, and ρ ( A , B ) as the correlation coefficient between A and B [27,28]. When ρ A , B 0.3 , two variables can be considered as uncorrelated. ρ ( A , B ) can be given by
ρ ( A , B ) = C o v A , B V a r A V a r B
where C o v A , B indicates the covariance of A and B , and V a r indicates the variance of a random variable.

4.2.1. Influence of Satellite Number

The correlation coefficient between the legal channel h ˜ and the wiretap channel g ˜ can be given by
ρ ( h ˜ , g ˜ ) = C o v h ˜ , g ˜ V a r h ˜ V a r g ˜ = N σ h 2 μ c 3 + μ c μ s 2 + j μ s 3 + μ c 2 μ s N σ h 2 σ c 2 + μ c 2 + σ s 2 + μ s 2 + 1 x 2 σ n 2 N σ g 2 σ c 2 + μ c 2 + σ s 2 + μ s 2 + 1 x 2 σ n 2
μ c and σ c 2 are the mean and variance of cos ( π sin α k ) and μ s and σ s 2 are the mean and variance of sin ( π sin α k ) , where k 1 , 2 , , N and α k Δ φ k , Δ θ k , θ k . The derivation process of (21) is provided in Appendix A.
When N = 1 , this indicates that in the case of a single satellite, Eve can infer the CSI of the legal channel through the wiretap channel. At this time, since the electrical size of the satellite antennae when it is normalized to the wavelength is very small, the satellite-to-ground communication model is a far-field parallel light model, and Bob cannot use the satellite-to-ground channel between herself and the LEO satellite to generate secret keys.
When N > 1 , ρ ( h ˜ , g ˜ ) decreases as N increases. When the number of satellites N is large enough, the legal channel and the wiretap channel are regarded as uncorrelated, and Eve cannot infer the CSI of the legal channel through the wiretap channel. Bob can use the satellite-to-ground channel between herself and the LEO satellite to generate secret keys.

4.2.2. Influence of the Perturbation Factor

Due to the openness of satellite motion parameters, eavesdroppers can predict the current theoretical position of the satellite when it moves along the orbit, thereby obtaining the CSI of the legal channel. To ensure that Eve cannot obtain the CSI of the legal channel in this way, we consider the channel phase shift caused by the random perturbation of the satellite, and introduce a random perturbation factor to express the endogenous randomness of the satellite-to-ground channel, which can also ensure the security of the key source. We analyze the impact of the perturbation factor on the security of the key source in this section.
Define h as the legal channel information obtained by Eve by calculating the satellite trajectory, which can be expressed as
h = k = 1 N h k
The correlation coefficient between the legal channel h ˜ and the channel calculated by Eve h can be expressed as
ρ ( h ˜ , h ) = C o v h ˜ , h V a r h ˜ V a r h = N σ h 2 μ c j μ s N σ h 2 σ c 2 + μ c 2 + σ s 2 + μ s 2 + 1 x 2 σ n 2 N σ h 2
The derivation process of (23) is provided in Appendix B. When N = 1 , since the satellite-to-ground channel is not affected by the multi-path effect when there is only a single satellite, the random perturbation of the satellite only changes the phase of one main path. At this time, the predicted channel and the actual channel only differ by one phase, and the security of the key source cannot be guaranteed.
When N > 1 , ρ h ˜ , h decreases as N increases. If ρ h ˜ , h 0.3 , Eve cannot obtain the CSI of the legal channel by calculating satellite trajectory. The above analysis indicates that one phase shift caused by a single perturbation factor is meaningless, and only the superposition of different phase shifts caused by multiple perturbation factors is reliable. Therefore, by introducing the perturbation factor method, the security of the key source in the multi-satellite cooperative communication system can be guaranteed. In this case, the superposition of multiple perturbation factors causes drastic changes in the channel phase, which greatly increases the randomness and time-varying nature of the satellite-to-ground channel.

5. Simulation Analysis

In order to verify the effectiveness and feasibility of the proposed method, we conducted a series of simulation experiments in MATLAB R2016a environment to analysis the randomness and security of the generated key. We use the Monte Carlo method to conduct 10,000 experiments, and each experiment randomly generates channel and noise data to ensure the accuracy of the experiment. The simulation conditions are as follows:
  • The number of LEO satellites is N = 4 .
  • Signal-to-noise ratio is S N R = 20   d B .
  • σ h 2 = 1 , σ n 2 = 0.01 .
  • The satellites are evenly distributed on a circular arc centered on Bob with a radius of 2000 km, the distance between adjacent satellites is 110 km.
  • The satellite-to-ground communication frequency is 29.3 GHz (ka band).

5.1. Randomness Analysis

We use the NIST [29] suite of statistical tests to test the randomness of the key. There are 15 items in NIST test totally, and all items return a p-value to summarize the strength of the evidence against the null hypothesis. When the p-value is larger than the chosen significance level ( α 0.001 , 0.01 ), the sequence is accepted as random.
In this paper, due to the extremely long sequence (larger than 106) required in some test items which are not available in the current simulation, we run 8 items (over half of all the 15 test) to evaluate the randomness of the key sequence, which still satisfies NIST’s requirements [29,30]. Moreover, we choose α as 0.01 and perform 8 NIST tests for 100,000 trials, where each key has a length of 256 bits. The test results are shown in Table 1. It can be seen that the key generated by the proposed method has passed the NIST test, which indicates that the key has high randomness.

5.2. Security Analysis

Figure 3 simulates the relationship between the distance from Bob to Eve and ρ h ˜ , g ˜ in the case of different satellite numbers. It can be seen from Figure 3 that in the case of a single satellite communication scene, when Eve is within 97 km from Bob, the correlation coefficient of the two channel estimation results is close to 1, and the correlation information of the legal channel can be obtained at any position within 110 km.
Define d min as the minimum distance between Eve and Bob when ρ h ˜ , g ˜ 0.3 is satisfied. d min keeps decreasing with the number of satellites. When N = 1 , d min = 110   km . When N = 4 , d min .decreases to 83 m. The results show that Bob’s safety distance can be effectively reduced by increasing the number of satellites, making it feasible for Bob to use satellite-to-ground channels to generate physical layer keys.
In order to prove that the proposed model in this paper can guarantee the security of the legal channel, we analyze the amplitude and phase of the ground receiving signal in the satellite-to-ground communication models with a single satellite or four satellites when Bob and Eve are 83 m away. Figure 4 and Figure 5 show the change curve of the received signal’s amplitude/phase in the time domain and the frequency domain, respectively. It can be seen from Figure 4a,b and Figure 5a,b that when N = 1 and d = 83 , the amplitude and phase of the signals received by Bob and Eve have a strong correlation in time and frequency. Figure 4c,d and Figure 5c,d indicate that when the distance between Bob and Eve is constant, while the number of satellites increases, the amplitude and phase of the received signals of Bob and Eve are both uncorrelated in time and frequency.
The simulation results show that the proposed method can effectively reduce the correlation between the signals received by Bob and Eve, and ensure that the CSI of the legal channel cannot be eavesdropped on. At the same time, due to the random perturbation factor introduced, the changes in channel amplitude and phase caused by satellite perturbation can be expressed precisely, which ensures that the proposed method has practical feasibility.

6. Conclusions

This paper mainly studies the physical layer key generation method in LEO satellite-to-ground scenarios. Aiming at the problem that the legal channel information is easy to leak in LEO satellite-to-ground communication scenarios, a physical layer key generation method based on multi-satellite cooperation random perturbation is proposed. In this method, the method of multi-satellite cooperation is used to increase the equivalent aperture of satellite antennae and reduce the safety distance of legal users. At the same time, the perturbation factor is introduced in channel modeling to increase the randomness of the actual channel and prevent eavesdroppers from obtaining legal channel information by predicting the position of satellite movement. The simulation results show that the method proposed in this paper can realize physical layer key generation in LEO satellite-to-ground communication scenarios, and as the number of satellites increases, the security distance of legal users can be reduced from hundreds of kilometers to tens of meters. The proposed method provides a good solution to generation of a physical layer key in the LEO satellite-to-ground communication scenario, and provides a new idea for the application of PLS in 6G SAGINs.

Author Contributions

Conceptualization, L.J.; data curation, H.W.; formal analysis, Y.H.; investigation, P.M.; methodology, P.M., H.W. and L.J.; project administration, L.J.; resources, L.J.; software, Y.H., P.M. and H.W.; validation, Y.H.; writing—original draft, Y.H.; writing—review and editing, P.M., H.W. and L.J. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by NSFC (61521003), the Key Universities and Academic Disciplines Construction Project, and the National Defense Science and Technology Innovation Special Zone (18-163-00-TS-004-082-01).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data is contained within the article.

Acknowledgments

We thank Honghao Zheng and Jianlei Zhao for Writing—review & editing.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Define X = X R + j X I as a complex random variable, where X h k , g k , n b , n e . X R and X I represent the real and imaginary parts of X , respectively. In the same way as [31,32,33], define X R and X I as independent and identically distributed. The mean and variance of X R and X I can be given by
E X = E X R + j E X I = 0
V a r X = 2 V a r X I = 2 V a r X R
where E indicates the mean of a random variable.
From (12) and (13), h ˜ and g ˜ can be given by
h ˜ = k = 1 N h k e j π sin Δ φ k + x * x 2 n b = k = 1 N h k R + j h k I cos ( π sin Δ φ k ) j sin ( π sin Δ φ k ) + x * x 2 n b = k = 1 N h k R cos ( π sin Δ φ k ) + h k I sin ( π sin Δ φ k ) + j k = 1 N h k R sin ( π sin Δ φ k ) + h k I cos ( π sin Δ φ k ) + x * x 2 n b
g ˜ = k = 1 N g k e j π sin Δ θ k + x * x 2 n e = k = 1 N g k R + j g k I cos ( π sin Δ θ k ) j sin ( π sin Δ θ k ) + x * x 2 n e = k = 1 N g k R cos ( π sin Δ θ k ) + g k I sin ( π sin Δ θ k ) + j k = 1 N g k R sin ( π sin Δ θ k ) + g k I cos ( π sin Δ θ k ) + x * x 2 n e
Define h R , h I , g R and g I as
h R = k = 1 N h k R cos ( π sin Δ φ k ) + h k I sin ( π sin Δ φ k ) h I = k = 1 N h k R sin ( π sin Δ φ k ) + h k I cos ( π sin Δ φ k )
g R = k = 1 N g k R cos ( π sin Δ θ k ) + g k I sin ( π sin Δ θ k ) g I = k = 1 N g k R sin ( π sin Δ θ k ) + g k I cos ( π sin Δ θ k )
From (A3) and (A4), (A5) and (A6) can be derived as
h ˜ = h R + j h I + x * x 2 n b
g ˜ = g R + j g I + x * x 2 n e
Since h R and h I are independent of n b , from (A7), the variance of h ˜ can be given by
V a r h ˜ = V a r h R + j h I + V a r x * x 2 n b = V a r h R + V a r h I + x * x 2 x * x 2 * V a r n b = V a r h R + V a r h I + 1 x 2 V a r n b
In a similar way to (A9), the variance of g ˜ can be given by
V a r g ˜ = = V a r g R + V a r g I + 1 x 2 V a r n e
From (A5), the variance of h R in (A9) can be given by
V a r h R = k = 1 N V a r h k R cos ( π sin Δ φ k ) + h k I sin ( π sin Δ φ k ) = k = 1 N V a r h k R cos ( π sin Δ φ k ) + V a r h k I sin ( π sin Δ φ k ) + 2 C o v h k R cos ( π sin Δ φ k ) , h k I sin ( π sin Δ φ k )
Since h k R , h k I and Δ φ k are independent of each other,
C o v h k R cos ( π sin Δ φ k ) , h k I sin ( π sin Δ φ k ) = E h k R cos ( π sin Δ φ k ) h k I sin ( π sin Δ φ k ) E h k R cos ( π sin Δ φ k ) E h k I sin ( π sin Δ φ k ) = E h k R E h k I E cos ( π sin Δ φ k ) sin ( π sin Δ φ k ) E h k R E h k I E sin ( π sin Δ φ k ) E cos ( π sin Δ φ k ) = 0
So, (A11) can be derived as
V a r h R = k = 1 N V a r h k R cos ( π sin Δ φ k ) + V a r h k I sin ( π sin Δ φ k )
In a similar way to (A13), the variance of h k I can be given by
V a r h I = k = 1 N V a r h k R sin ( π sin Δ φ k ) + h k I cos ( π sin Δ φ k ) = k = 1 N V a r h k R sin ( π sin Δ φ k ) + V a r h k I cos ( π sin Δ φ k )
Since that Δ φ k , Δ θ k and θ k are independent and identically distributed, define the mean and variance of cos ( π sin α k ) as μ c and σ c 2 , and the mean and variance of sin ( π sin α k ) as μ s and σ s 2 , where k 1 , 2 , , N and α k Δ φ k , Δ θ k , θ k .
V a r h k R cos ( π sin Δ φ k ) = E h k R cos ( π sin Δ φ k ) 2 E h k R cos ( π sin Δ φ k ) 2 = E h k R 2 E cos ( π sin Δ φ k ) 2 E h k R E cos ( π sin Δ φ k ) 2 = V a r h k R + E h k R 2 V a r cos ( π sin Δ φ k ) + E cos ( π sin Δ φ k ) 2 = 1 2 σ h 2 σ c 2 + μ c 2
In a similar way to (A15), it can be obtained that
V a r h k I sin ( π sin Δ φ k ) = V a r h k R sin ( π sin Δ φ k ) = 1 2 σ h 2 σ s 2 + μ s 2
V a r h k I cos ( π sin Δ φ k ) = V a r h k R cos ( π sin Δ φ k ) = 1 2 σ h 2 σ c 2 + μ c 2
From (A13), (A14), (A16) and (A17), it can be obtained that
V a r h R = N 1 2 σ h 2 σ c 2 + μ c 2 + 1 2 σ h 2 σ s 2 + μ s 2 = N 1 2 σ h 2 σ c 2 + μ c 2 + σ s 2 + μ s 2
V a r h I = N 1 2 σ h 2 σ s 2 + μ s 2 + 1 2 σ h 2 σ c 2 + μ c 2 = N 1 2 σ h 2 σ c 2 + μ c 2 + σ s 2 + μ s 2
From (A9), (A18) and (A19), the variance of h ˜ can be given by
V a r h ˜ = N 1 2 σ h 2 σ c 2 + μ c 2 + σ s 2 + μ s 2 + N 1 2 σ h 2 σ c 2 + μ c 2 + σ s 2 + μ s 2 + 1 x 2 σ n 2 = N σ h 2 σ c 2 + μ c 2 + σ s 2 + μ s 2 + 1 x 2 σ n 2
In a similar way to (A20), from (A10), the variance of g ˜ can be given by
V a r g ˜ = N σ g 2 σ c 2 + μ c 2 + σ s 2 + μ s 2 + 1 x 2 σ n 2
From (A7), the mean of h ˜ can be given by
E h ˜ = E h R + j h I + E x * x 2 n b = E h R + j E h I + x * x 2 E n b
In a similar way to (A22), the mean of g ˜ can be given by
E g ˜ = = E g R + j E g I + x * x 2 E n e
From (A5), the mean of h R in (A22) is
E h R = k = 1 N E h k R cos ( π sin Δ φ k ) + h k I sin ( π sin Δ φ k ) = k = 1 N E h k R cos ( π sin Δ φ k ) + E h k I sin ( π sin Δ φ k ) = k = 1 N E h k R E cos ( π sin Δ φ k ) + E h k I E sin ( π sin Δ φ k ) = 0
In a similar way to (A24), from (A5), the mean of h I in (A22) is
E h I = k = 1 N E h k R E sin ( π sin Δ φ k ) + E h k I E cos ( π sin Δ φ k ) = 0
From (A22), (A24) and (A25),
E h ˜ = E h R + j E h I + x * x 2 E n b = 0
In a similar way to (A26),
E g ˜ = E g R + j E g I + x * x 2 E n e = 0
From (A7), (A8), (A26) and (A27), the covariance of h ˜ and g ˜ can be given by
Cov h ˜ , g ˜ = E h ˜ E h ˜ ( g ˜ E g ˜ ) * = E h ˜ g ˜ * = h R + j h I + x * | | x | | 2 n b g R j g I + x | | x | | 2 n e * = E h R + j h I g R j g I + h R + j h I x | | x | | 2 n e * + g R j g I x * | | x | | 2 n b + 1 | | x | | 2 n b n e * = E h R g R + h I g I + j h R g I + h g R + x | | x | | 2 E h R + j h I E n e *         + x * | | x | | 2 E g R j g I E n b + 1 | | x | | 2 E n e * E n b = E h R g R + h I g I + j E h R g I + h I g R = E h R g R + E h I g I + j E h R g I + E h I g R
From (A5) and (A6), the mean of h R g R can be given by
E h R g R = E k = 1 N h k R cos ( π sin Δ φ k ) + h k I sin ( π sin Δ φ k ) k = 1 N g k R cos ( π sin Δ θ k ) + g k I sin ( π sin Δ θ k )
Since h ˜ i and g ˜ j are independent of each other when i , j 1 , 2 , , N and i j , so it can be obtained that
E h i R cos ( π sin Δ φ i ) g j R cos ( π sin Δ θ j ) = E h i R E cos ( π sin Δ φ i ) g j R cos ( π sin Δ θ j ) = 0
where i , j 1 , 2 , , N and i j .
Obviously, remove the terms which equal to 0 in (A29), it can be obtained that
E h R g R = E k = 1 N h k R cos ( π sin Δ φ k ) g k R cos ( π sin Δ θ k ) + h k R cos ( π sin Δ φ k ) g k I sin ( π sin Δ θ k ) + h k I sin ( π sin Δ φ k ) g k R cos ( π sin Δ θ k ) + h k I sin ( π sin Δ φ k ) g k I sin ( π sin Δ θ k ) = k = 1 N E h k R g k R E cos ( π sin Δ φ k ) E cos ( π sin Δ θ k ) + E h k R g k I E cos ( π sin Δ φ k ) E sin ( π sin Δ θ k ) + E h k I g k R E sin ( π sin Δ φ k ) E cos ( π sin Δ θ k ) + E h k I g k I E sin ( π sin Δ φ k ) E sin ( π sin Δ θ k ) = k = 1 N E h k R g k R μ c 2 + E h k R g k I μ c μ s + E h k I g k R μ s μ c + E h k I g k I μ s 2
From (18),
g k = h k R + j h k I cos π sin θ k j sin π sin θ k = h k R cos π sin θ k + h k I sin π sin θ k + j h k I cos π sin θ k h k R sin π sin θ k = g k R + j g k I
So,
E h k R g k R = E h k R h k R cos π sin θ k + h k I sin π sin θ k = E h k R 2 cos π sin θ k + h k R h k I sin π sin θ k = E h k R 2 E cos π sin θ k + E h k R E h k I E sin π sin θ k = V a r h k R + E h k R 2 E cos π sin θ k = 1 2 σ h 2 μ c
Form (A33), it can be obtained that
E h k R g k R μ c 2 = 1 2 σ h 2 μ c 3
In a similar way to (A34),
E h k R g k I μ c μ s = 1 2 σ h 2 μ c μ s 2
E h k I g k R μ s μ c = 1 2 σ h 2 μ c μ s 2
E h k I g k I μ s 2 = 1 2 σ h 2 μ c μ s 2
From (A31), (A34)–(A37), it can be obtained that
E h R g R = N 1 2 σ h 2 μ c 3 1 2 σ h 2 μ c μ s 2 + 1 2 σ h 2 μ c μ s 2 + 1 2 σ h 2 μ c μ s 2 = N 2 σ h 2 μ c 3 + μ c μ s 2
In a similar way to (A38),
E h I g I = N 2 σ h 2 μ c 3 + μ c μ s 2
E h R g I = N 2 σ h 2 μ c 2 μ s μ s 3
E h I g R = N 2 σ h 2 μ s 3 + μ c 2 μ s
So, from (A28), (A38)–(A40), it can be obtained that
C o v h ˜ , g ˜ = E h R g R + E h I g I + j E h R g I + E h I g R = N 2 σ h 2 μ c 3 + μ c μ s 2 + μ c 3 + μ c μ s 2 + j N 2 σ h 2 μ c 2 μ s μ s 3 + μ s 3 + μ c 2 μ s = N σ h 2 μ c 3 + μ c μ s 2 + j μ s 3 + μ c 2 μ s
From (A20), (A21) and (A42), the correlation coefficient between h ˜ and g ˜ can be given by
ρ ( h ˜ , g ˜ ) = C o v h ˜ , g ˜ V a r h ˜ V a r g ˜ = N σ h 2 μ c 3 + μ c μ s 2 + j μ s 3 + μ c 2 μ s N σ h 2 σ c 2 + μ c 2 + σ s 2 + μ s 2 + 1 x 2 σ n 2 N σ g 2 σ c 2 + μ c 2 + σ s 2 + μ s 2 + 1 x 2 σ n 2

Appendix B

From (22), it can be obtained that
h = k = 1 N h k R + j h k I = k = 1 N h k R + j k = 1 N h k I = h R + j h I
The mean and variance of h can be given by
E h = E k = 1 N h k R + j E k = 1 N h k I = 0
V a r h = V a r k = 1 N h k R + V a r k = 1 N h k I = N 2 σ h 2 + N 2 σ h 2 = N σ h 2
In a similar way to (A28), from (A7), (A26), (A43) and (A45), the covariance of h ˜ and h can be given by
C o v h ˜ , h = E h ˜ E h ˜ h E h * = E h ˜ h * = E h R + j h I + x * x 2 n b h R j h I = E h R h R + E h I h I + j E h R h I + E h I h R
In a similar way to (A29) and (A33), from (A5) and (A44), it can be obtained that
E h R h R = E k = 1 N h k R cos ( π sin Δ φ k ) + h k I sin ( π sin Δ φ k ) k = 1 N h k R = E k = 1 N h k R 2 cos ( π sin Δ φ k ) + h k R h k I sin ( π sin Δ φ k ) = k = 1 N E h k R 2 E cos ( π sin Δ φ k ) = N 2 σ h 2 μ c
In a similar way to (A48),
E h I h I = k = 1 N E h k I 2 E cos ( π sin Δ φ k ) = N 2 σ h 2 μ c
E h R h I = k = 1 N E h k I 2 E sin ( π sin Δ φ k ) = N 2 σ h 2 μ s
E h I h R = k = 1 N E h k R 2 E sin ( π sin Δ φ k ) = N 2 σ h 2 μ s
From (A47)–(A51),
C o v h ˜ , h = E h R h R + E h I h I + j E h R h I + E h I h R = N 2 σ h 2 μ c + N 2 σ h 2 μ c + j N 2 σ h 2 μ s N 2 σ h 2 μ s = N σ h 2 μ c j N σ h 2 μ s
From (A20), (A46) and (A52),
ρ ( h ˜ , h ) = C o v h ˜ , h V a r h ˜ V a r h = N σ h 2 μ c j μ s N σ h 2 σ c 2 + μ c 2 + σ s 2 + μ s 2 + 1 x 2 σ n 2 N σ h 2

References

  1. Qu, Z.; Zhang, G.; Cao, H.; Xie, J. LEO Satellite Constellation for Internet of Things. IEEE Access 2017, 5, 18391–18401. [Google Scholar] [CrossRef]
  2. Liu, C.; Kirchengast, G.; Sun, Y.; Du, Q.; Bai, W.; Proschek, V.; Wang, X.; Xia, J.; Meng, X.; Wang, D.; et al. Study on LEO-LEO microwave occultation. In Proceedings of the 2017 IEEE International Geoscience and Remote Sensing Symposium (IGARSS), Fort Worth, TX, USA, 23–28 July 2017; pp. 538–541. [Google Scholar] [CrossRef]
  3. Deng, R.; Di, B.; Zhang, H.; Song, L. Ultra-Dense LEO Satellite Constellation Design for Global Coverage in Terrestrial-Satellite Networks. In Proceedings of the GLOBECOM 2020—2020 IEEE Global Communications Conference, Taipei, China, 7–11 December 2020; pp. 1–6. [Google Scholar] [CrossRef]
  4. Wu, C.; Sun, Y.; Wang, X.; Liu, C.; Du, Q.; Bai, W.; Wang, D.; Meng, X.; Cai, Y.; Liu, C.; et al. A Leo-Leo Occultation System Using Microwave Signals. In Proceedings of the IGARSS 2018—2018 IEEE International Geoscience and Remote Sensing Symposium, Valencia, Spain, 22–27 July 2018; pp. 3147–3148. [Google Scholar] [CrossRef]
  5. Liang, H.; Chen, F.; Ji, X.; Lu, P.; Gao, Y. The development of world-earth integrated information network and the application of mimicry technology. Sci. China Inf. Sci. 2019, 49, 799–818. [Google Scholar]
  6. Ji, X.; Tao, X.; Huang, K.; Wu, H. Introduction to the topic of B5G network security. Sci. China Inf. Sci. 2021, 51, 171–172. [Google Scholar]
  7. Wang, Y.; Gu, L.; Liu, H. Status and future development of low-orbit satellite mobile communications. Commun. Technol. 2020, 53, 103–109. [Google Scholar]
  8. Ji, X.; Liang, H.; Hu, H. Thoughts on the Security Protection Technology of World-Ground Integration Information Network. Tele-Commun. Sci. 2017, 33, 24–35. [Google Scholar]
  9. Li, B.; Fei, Z.; Zhou, C.; Zhang, Y. Physical-Layer Security in Space Information Networks: A Survey. IEEE Internet Things J. 2019, 7, 33–52. [Google Scholar] [CrossRef]
  10. Jin, L.; Hu, X.; Sun, X.; Lou, Y.; Huang, K.; Zhong, Z.; Xu, X. Native Security Scheme Based on Physical Layer Chain Key for Encryption and Authentication. In Proceedings of the 2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), Nanjing, China, 29 March 2021; pp. 1–7. [Google Scholar] [CrossRef]
  11. Jin, L.; Wang, X.; Lou, Y.; Xu, X. Achieving one-time pad via endogenous secret keys in wireless communication. In Proceedings of the 2020 IEEE/CIC International Conference on Communications in China (ICCC), Chongqing, China, 9–11 August 2020; pp. 1092–1097. [Google Scholar] [CrossRef]
  12. Guo, K.; Zhang, B.; Huang, Y.; Guo, D. Secure performance analysis of satellite communication networks in Shadowed Rician Channel. In Proceedings of the 2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), Limassol, Cyprus, 12–14 December 2016; pp. 156–159. [Google Scholar] [CrossRef]
  13. Gao, Y.; Ao, H.; Zhou, Q.; Feng, Z.; Zhou, W.; Li, Y.; Li, X. Modeling of satellite communication systems design with physical layer security. In Proceedings of the 2017 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET), Chennai, India, 22–24 March 2017; pp. 1680–1683. [Google Scholar] [CrossRef]
  14. Kalantari, A.; Zheng, G.; Gao, Z.; Han, Z.; Ottersten, B. Secrecy Analysis on Network Coding in Bidirectional Multibeam Satellite Communications. IEEE Trans. Inf. Forensics Secur. 2015, 10, 1862–1874. [Google Scholar] [CrossRef] [Green Version]
  15. Fu, Q.-Y.; Feng, Y.-H.; Wang, H.-M.; Liu, P. Initial Satellite Access Authentication Based on Doppler Frequency Shift. IEEE Wirel. Commun. Lett. 2020, 10, 498–502. [Google Scholar] [CrossRef]
  16. Jin, L.; Lou, Y.; Xu, X.; Zhong, Z.; Wang, H. Separating Multi-Stream Signals Based on Space-Time Isomerism. In Proceedings of the 2020 International Conference on Wireless Communications and Signal Processing (WCSP), Nanjing, China, 21–23 October 2020; pp. 418–423. [Google Scholar] [CrossRef]
  17. Nie, X.; Mi, H.; Wu, X. Research on satellite-to-ground channel performance based on integrated channel model. Spacecr. Eng. 2012, 21, 48–52. [Google Scholar] [CrossRef]
  18. Huang, K.; Jin, L.; Chen, Y.; Lou, Y.; Zhou, Y.; Ma, K.; Xu, X.; Zhong, Z.; Zhang, S. Development and new challenges of wireless physical layer key generation technology. J. Electron. Inf. 2020, 42, 2330–2341. [Google Scholar]
  19. Li, X.; Jin, L.; Zhong, Z.; Lou, Y. A Physical-Layer Message Encryption and Authentication Scheme. In Proceedings of the 2018 IEEE 4th International Conference on Computer and Communications (ICCC), Chengdu, China, 7–10 December 2018; pp. 1893–1898. [Google Scholar] [CrossRef]
  20. Jin, L.; Cai, A.; Huang, K.; Zhong, Z.; Lou, Y. Key generation scheme based on multiple random signal streams. J. Electron. Inf. Technol. 2019, 41, 1405–1412. [Google Scholar]
  21. Wang, H.-M.; Bai, J.; Dong, L. Intelligent Reflecting Surfaces Assisted Secure Transmission without Eavesdropper’s CSI. IEEE Signal Process. Lett. 2020, 27, 1300–1304. [Google Scholar] [CrossRef]
  22. Li, Z.; Wang, S.; Mu, P.; Wu, Y.-C. Sum Rate Maximization of Secure NOMA Transmission with Imperfect CSI. In Proceedings of the ICC 2020—2020 IEEE International Conference on Communications (ICC), Dublin, Ireland, 7–11 June 2020; pp. 1–6. [Google Scholar] [CrossRef]
  23. Wanga, H.-M.; Jiang, J.-C.; Wang, Y.-N. Model Refinement Learning and an Example on Channel Estimation with Universal Noise Model. IEEE J. Sel. Areas Commun. 2020, 39, 31–46. [Google Scholar] [CrossRef]
  24. Zhan, F.; Yao, N.; Gao, Z.; Yu, H. Efficient key generation leveraging wireless channel reciprocity for MANETs. J. Netw. Comput. Appl. 2018, 104, 18–28. [Google Scholar] [CrossRef]
  25. Bennett, C.H.; Brassard, G.; Crepeau, C.; Maurer, U.M. Generalized privacy amplification. IEEE Trans. Inf. Theory 1995, 41, 1915–1923. [Google Scholar] [CrossRef] [Green Version]
  26. Yan, S.; Li, Q. Optimizing Array Signal Processing (Volumes 1 and 2). Acta Acoust. 2018, 43, 728. [Google Scholar]
  27. Hu, X. Research on Physical Layer Key Generation Technology under the Conditions of Eavesdropping Channel. Master’s Thesis, Information Engineering University, Zhengzhou, China, 2018. [Google Scholar]
  28. Jin, H.; Huang, K.; Jin, L.; Zhong, Z.; Chen, Y. Physical-Layer Secret Key Generation with Correlated Eavesdropping Channel. In Proceedings of the 2018 IEEE 4th International Conference on Computer and Communications (ICCC), Chengdu, China, 7–10 December 2018; pp. 226–231. [Google Scholar] [CrossRef]
  29. Zhang, J.; Marshall, A.; Woods, R.; Duong, T.Q. Secure key generation from OFDM subcarriers’ channel responses. In Proceedings of the 2014 IEEE Globecom Workshops (GC Wkshps), Austin, TX, USA, 8–12 December 2014; pp. 1302–1307. [Google Scholar] [CrossRef]
  30. Bassham, L.; Rukhin, A.; Soto, J.; Nechvatal, J.; Smid, M.; Leigh, S.; Levenson, M.; Vangel, M.; Heckert, N.; Banks, D. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications; Special Publication (NIST SP); National Institute of Standards and Technology; Gaithersburg, MD, USA. 2010. Available online: https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=906762 (accessed on 4 December 2021).
  31. Xiao, S.; Guo, Y.; Huang, K.; Jin, L. Cooperative Group Secret Key Generation Based on Secure Network Coding. IEEE Commun. Lett. 2018, 22, 1466–1469. [Google Scholar] [CrossRef]
  32. Xu, Q.; Ren, P. Channel-Aware Key Generation under Wireless Fading Environment. IEEE Commun. Lett. 2020, 24, 1636–1640. [Google Scholar] [CrossRef]
  33. Hu, X.; Jin, L.; Huang, K.; Sun, X.; Zhou, Y. Secret Key Generation Assisted by Intelligent Reflecting Surface with Discrete Phase Shift in Static Environment. IEEE Wirel. Commun. Lett. 2021, 10, 1867–1870. [Google Scholar] [CrossRef]
Figure 1. System model.
Figure 1. System model.
Entropy 23 01653 g001
Figure 2. Far-field parallel light model.
Figure 2. Far-field parallel light model.
Entropy 23 01653 g002
Figure 3. Correlation coefficient distance.
Figure 3. Correlation coefficient distance.
Entropy 23 01653 g003
Figure 4. Amplitude/phase time. (a) N = 1, d = 83; (b) N = 1, d = 83; (c) N = 4, d = 83; (d) N = 4, d = 83.
Figure 4. Amplitude/phase time. (a) N = 1, d = 83; (b) N = 1, d = 83; (c) N = 4, d = 83; (d) N = 4, d = 83.
Entropy 23 01653 g004
Figure 5. Amplitude/phase frequency. (a) N = 1, d = 83; (b) N = 1, d = 83; (c) N = 4, d = 83; (d) N = 4, d = 83.
Figure 5. Amplitude/phase frequency. (a) N = 1, d = 83; (b) N = 1, d = 83; (c) N = 4, d = 83; (d) N = 4, d = 83.
Entropy 23 01653 g005
Table 1. p-values of the NIST statistical test.
Table 1. p-values of the NIST statistical test.
EnvironmentPass Ratiop-Value
Frequency1.000000.911413
Block Frequency0.969720.719747
Cumulative Sums(Fwd)1.000000.419021
Cumulative Sums(Rev)1.000000.595549
Runs0.977310.289667
Longest Run0.996510.798139
FFT0.998920.213309
Serial1.000000.616305, 0.41902
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Hao, Y.; Mu, P.; Wang, H.; Jin, L. Key Generation Method Based on Multi-Satellite Cooperation and Random Perturbation. Entropy 2021, 23, 1653. https://doi.org/10.3390/e23121653

AMA Style

Hao Y, Mu P, Wang H, Jin L. Key Generation Method Based on Multi-Satellite Cooperation and Random Perturbation. Entropy. 2021; 23(12):1653. https://doi.org/10.3390/e23121653

Chicago/Turabian Style

Hao, Yinuo, Pengcheng Mu, Huiming Wang, and Liang Jin. 2021. "Key Generation Method Based on Multi-Satellite Cooperation and Random Perturbation" Entropy 23, no. 12: 1653. https://doi.org/10.3390/e23121653

APA Style

Hao, Y., Mu, P., Wang, H., & Jin, L. (2021). Key Generation Method Based on Multi-Satellite Cooperation and Random Perturbation. Entropy, 23(12), 1653. https://doi.org/10.3390/e23121653

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop