# PHY-Aided Secure Communication via Weighted Fractional Fourier Transform

Authors: Lei Ni; Xinyu Da; Hang Hu; Yuan Liang; Ruiyang Xu
Journal: Wireless Communications and Mobile Computing
 (2018)

---

## Abstract

A weighted fractional Fourier transform (WFRFT) based on channel state information (CSI), aiming to safeguard the physical (PHY) layer security of wireless communication system, is proposed. With the proposed scheme, WFRFT is first applied to satellite communications such that the transmitted signal is distorted and can only be neutralized by inverse-WFRFT with the same parameter. Moreover, by exploiting the physical properties of wireless channels, the CSI matrix is transformed as a secret key. In addition, by adding phase rotation (PR) factors to each branch of the WFRFT system, a new unitary matrix with the encryption properties is constructed, and hence, the satellite communications secrecy is reliably guaranteed due to the variation in signal characteristics. Finally, the efficacy of the security enhancement is evaluated in terms of the average bit error rate (BER) and the secrecy capacity. Simulation results show that the proposed encryption method can make the detection and demodulation more difficult for the eavesdropper.


---

## Body

## 1. Introduction

The satellite communications network plays an indispensable role in both civil and military applications. However, due to the openness of wireless communications, malicious receivers within the cover range can illegitimately access the spectrum bands and analyze the transmission without being detected, which makes the confidential message transferred through a satellite communications network vulnerable to eavesdropping attacks [1]. To handle this issue, conventional approaches for data privacy implemented at upper layer protocol stack [2], which mainly focus on the computational complexity of cryptographic algorithms, have been widely used for guaranteeing communication security [3]. However, most of the existing cryptography-based strategies are computationally secure and thus could be compromised when the eavesdropper has powerful computing capability; for example, quantum computing is available [4, 5]. In addition, it is difficult for legitimate user to design an applicable secret key distribution and management protocol to satisfy the great diversity of wireless scenarios.Without using any encryption, an emerging technique termed as physical (PHY) layer security has attracted considerable interest in recent years [6, 7]. By exploiting the coding techniques as well as physical properties of wireless channels, PHY layer security has a great potential to achieve “perfect secrecy” and is identified as a significant complement to traditional cryptographic techniques [8]. As introduced in [9, 10], the weighted fractional Fourier transform (WFRFT) is performed as a new paradigm for PHY layer security enhancement. WFRFT, known as a novel time-frequency mathematical tool, is proposed by Shih in 1995 for the first time [11]. The WFRFT-based communication system developed in [12, 13], which can be understood as a fusion of single-carrier (SC) and multicarrier (MC) communication system, not only possesses hybrid carrier characteristics with an optimal fractional order over selective fading channels, but also has a good performance of anti-interception [14]. Moreover, WFRFT signal is encrypted with rotation characteristics, which is widely applied to secret communication system in recent years [15, 16].According to Wyner’s wiretap channel model, there exist three participants: the sender Alice, the purpose receiver Bob, and the eavesdropper Eve, the same as the traditional cryptology. Under this wiretapping model, we assume that the baseband signal modulation scheme is preknown to Eve, and once Eve has unlimited computational capabilities, a potential issue might arise that Eve is likely to get the correct WFRFT parameterα through scanning the parameter of the whole period [17]. Therefore, it is necessary to take more effective measures to protect the WFRFT signal from being cracked. Motivated by the aforementioned aspects, this paper proposes an encryption scheme based on channel state information (CSI) and WFRFT. In general, the WFRFT-based communication system is reconstructed with a new encrypted unitary matrix, which is determined and dynamically encrypted by the CSI, whereby the proposed scheme renders itself with the following advantages: on the one hand, the unique communication nodes of legitimate channel between Bob and Alice can reduce the possibility of secret leakage in the upper layer. On the other hand, the channel needed for transferring the secret key is saved; thus the channel’s efficiency is able to be improved.Numerical simulation results show that the proposed WFRFT-based PHY layer security scheme is able to overcome the shortcomings of the traditional WFRFT system, and the BER of the eavesdropper is kept above 50%. The remainder of this paper is organized as follows. Section2 reviews the mathematical concepts of WFRFT. Physical implementation process of αth order WFRFT as well as the proposed system model is described in Section 3. Simulation results are revealed and discussed in Section 4. Finally, conclusions are addressed in Section 5.Notations. Vectors and matrices are denoted by lower and upper case boldface letters, respectively. I represents an identity matrix with appropriate size. (·)-1 and (·)H stand for the inverse and Hermitian transpose operations, respectively. Additionally, Q(·) is the complementary distribution function of the standard Gaussian and Q(x)=1/2π∫x∞e-u2/2du.


## 2. Preliminary

### 2.1. Weighted Fractional Fourier Transform

Known as a generalized Fourier transform, the discrete Fourier transform (DFT) ofαth order WFRFT is expressed as [18](1)F4WαX0=ω0αX0+ω1αX1+ω2αX2+ω3αX3,where {X0,X1,X2,X3} are the 1~3 times DFT of complex vector X0, respectively. Furthermore, the DFT can be defined as a form of a matrix(2)X=DFTx=1N11⋯11w⋯wN-11w2⋯w2N-1⋮⋮⋮1wN-1⋯wN-1N-1x0x1x2⋮xN-1=Fx,where F denotes the DFT matrix, and the elements can be written as F(j,k)=w(j-1)(k-1)/N. Here, w is equal to e-2πi/N; besides, the weighting coefficients ωl(α) in (1) are generated as(3)ωlα=14∑k=03expj2πα-lk4,where l=1,2,3, and parameter α is with a cycle of 4, commonly selected in the real interval [0,4]. Note that there is only one WFRFT parameter α in (1), which can be called single parameter WFRFT [19].In addition, (1) can be represented as the following form:(4)Y=F4WαX0=ω0X0+ω1FX0+ω2F2X0+ω3F3X0=ω0I+ω1F+ω2F2+ω3F3X0=F4WαX0,where Fk(k=1,2,3) denotes k times of FFT operation. According to the symmetry of discrete Fourier transform, we can obtain F2=M and F3=FH, where M represents a permutation matrix and can be denoted by(5)M=10⋯00000⋯00100⋯010⋮⋯0⋰00001000010000N×N.It can be readily verified thatF4W(α) in WFRFT-based communication system is a unitary matrix; besides, the DFT matrix utilized in the orthogonal frequency division multiplexing (OFDM) system is also a unitary matrix. Motivated by this property, in this paper, we consider constructing a new encrypted unitary matrix in WFRFT system to improve the secrecy performance.


### 2.2. Encrypted Unitary Matrix

According to the operational properties of unitary matrix, a new unitary matrix can be derived by multiplying a unitary matrix and a permutation matrix. The construction method of our scheme is described as follows.First of all, we denoteP as the unitary matrix that needs to be extended.Definition 1 (permutation matrix).
The necessary and sufficient condition for a permutation matrixT is that each row or column of T has only one element equal to one, and the other elements are all zeros.Theorem 2.
LetU be the upper (lower) triangular unitary matrix, then U must be a diagonal matrix satisfying det(U)=1.Definition 3 (PR matrix).
The necessary and sufficient condition for a PR matrixE with N×N size is that the (n,n) element equals ej2πθ(n,n)(n=1,2,…,N), where θ(n,n) can be chosen in [0,1], and the other elements of E are all zeros. It can be observed that the total number of rotation matrices is NN [20].Secondly, creating a new unitary matrixZ=P×E×T, the original unitary matrix P can be either a square or a nonsquare matrix theoretically. Since the matrix F4W(α) in WFRFT system is a unitary matrix, we consider reconstructing F4W(α) to form a new unitary matrix to enhance the secrecy performance.In (4), F4W(α) can be obtained by multiplying a block matrix IFMFHH with a coefficients matrix ω0(α)ω1(α)ω2(α)ω3(α); since both the block matrix and F4W(α) are unitary matrices, we can derive that ω0(α)ω1(α)ω2(α)ω3(α) is also a unitary matrix. To make it easier for practical implementation, a PR matrix E with 4×4 size and a permutation matrix T with 4×4 size are designed, respectively.Finally, the new unitary matrix can be calculated as(6)Z4Wα=ω0αω1αω2αω3α×E×T×IFMFHH;moreover, the inverse matrix is expressed by(7)Z4Wα-1=IFMFH×TH×EH×ω0αω1αω2αω3αH,where the PR matrix E is composed of four diagonal elements ej2πθ(k,k)(k=1,2,3,4).Considering that Bob needs to calculate the transpose ofT, without loss of generality, we adopt the unit matrix I as this permutation matrix for simplicity. Therefore, the generation of the PR matrix becomes the key to the construction of this new encrypted unitary matrix.


## 2.1. Weighted Fractional Fourier Transform

Known as a generalized Fourier transform, the discrete Fourier transform (DFT) ofαth order WFRFT is expressed as [18](1)F4WαX0=ω0αX0+ω1αX1+ω2αX2+ω3αX3,where {X0,X1,X2,X3} are the 1~3 times DFT of complex vector X0, respectively. Furthermore, the DFT can be defined as a form of a matrix(2)X=DFTx=1N11⋯11w⋯wN-11w2⋯w2N-1⋮⋮⋮1wN-1⋯wN-1N-1x0x1x2⋮xN-1=Fx,where F denotes the DFT matrix, and the elements can be written as F(j,k)=w(j-1)(k-1)/N. Here, w is equal to e-2πi/N; besides, the weighting coefficients ωl(α) in (1) are generated as(3)ωlα=14∑k=03expj2πα-lk4,where l=1,2,3, and parameter α is with a cycle of 4, commonly selected in the real interval [0,4]. Note that there is only one WFRFT parameter α in (1), which can be called single parameter WFRFT [19].In addition, (1) can be represented as the following form:(4)Y=F4WαX0=ω0X0+ω1FX0+ω2F2X0+ω3F3X0=ω0I+ω1F+ω2F2+ω3F3X0=F4WαX0,where Fk(k=1,2,3) denotes k times of FFT operation. According to the symmetry of discrete Fourier transform, we can obtain F2=M and F3=FH, where M represents a permutation matrix and can be denoted by(5)M=10⋯00000⋯00100⋯010⋮⋯0⋰00001000010000N×N.It can be readily verified thatF4W(α) in WFRFT-based communication system is a unitary matrix; besides, the DFT matrix utilized in the orthogonal frequency division multiplexing (OFDM) system is also a unitary matrix. Motivated by this property, in this paper, we consider constructing a new encrypted unitary matrix in WFRFT system to improve the secrecy performance.


## 2.2. Encrypted Unitary Matrix

According to the operational properties of unitary matrix, a new unitary matrix can be derived by multiplying a unitary matrix and a permutation matrix. The construction method of our scheme is described as follows.First of all, we denoteP as the unitary matrix that needs to be extended.Definition 1 (permutation matrix).
The necessary and sufficient condition for a permutation matrixT is that each row or column of T has only one element equal to one, and the other elements are all zeros.Theorem 2.
LetU be the upper (lower) triangular unitary matrix, then U must be a diagonal matrix satisfying det(U)=1.Definition 3 (PR matrix).
The necessary and sufficient condition for a PR matrixE with N×N size is that the (n,n) element equals ej2πθ(n,n)(n=1,2,…,N), where θ(n,n) can be chosen in [0,1], and the other elements of E are all zeros. It can be observed that the total number of rotation matrices is NN [20].Secondly, creating a new unitary matrixZ=P×E×T, the original unitary matrix P can be either a square or a nonsquare matrix theoretically. Since the matrix F4W(α) in WFRFT system is a unitary matrix, we consider reconstructing F4W(α) to form a new unitary matrix to enhance the secrecy performance.In (4), F4W(α) can be obtained by multiplying a block matrix IFMFHH with a coefficients matrix ω0(α)ω1(α)ω2(α)ω3(α); since both the block matrix and F4W(α) are unitary matrices, we can derive that ω0(α)ω1(α)ω2(α)ω3(α) is also a unitary matrix. To make it easier for practical implementation, a PR matrix E with 4×4 size and a permutation matrix T with 4×4 size are designed, respectively.Finally, the new unitary matrix can be calculated as(6)Z4Wα=ω0αω1αω2αω3α×E×T×IFMFHH;moreover, the inverse matrix is expressed by(7)Z4Wα-1=IFMFH×TH×EH×ω0αω1αω2αω3αH,where the PR matrix E is composed of four diagonal elements ej2πθ(k,k)(k=1,2,3,4).Considering that Bob needs to calculate the transpose ofT, without loss of generality, we adopt the unit matrix I as this permutation matrix for simplicity. Therefore, the generation of the PR matrix becomes the key to the construction of this new encrypted unitary matrix.


## 3. Encrypted Unitary Matrix Based on CSI

### 3.1. Channel State Information Encryption

Due to the inherent nature of wireless communications, the uniqueness and short-time reciprocity of the channel make it possible for legitimate user to distribute secret key reliably. In addition, the secure transmission between legitimate users can be guaranteed by exploiting the spatial difference between Bob and Eve. Therefore, we can employ these properties to protect the confidential messages that need to be transmitted, and the specific conversion methods are described in the following subsections.Firstly, Bob sends a training array to Alice, and Alice takes advantage of it to estimate the CSI of legitimate channel. Meanwhile, Bob estimates the CSI through the pilot sequence sent by Alice. It is assumed that the CSI is perfect at the legitimate transmitter; thus the CSI matrices estimated by Alice and Bob are completely identical. Under this assumption, it is necessary to convert the estimated legitimate CSI into a secret key by certain means. In this paper, the single Hash function [21], as a frequently used method in the encryption algorithms, is introduced. The single Hash function can be generalized as(8)h=HL,where h is the fixed-length Hash value, H(·) is a one-way Hash function, and L denotes the input sequence of arbitrary length.The mapping of the compression function can help us to convert any variable length input string into a fixed-length output string. Moreover, the Hash function has a good performance in collision-resistance and the uniformity of mapping distribution. According to the previous analyses, we can utilize the Hash function to map the estimated CSI matrix into a bit string with fixed length, and due to the one-way property of the Hash function, even if the key sequence is known by Eve, the correct CSI matrix cannot be obtained.In this paper, two main Hash algorithms are proposed: MD5 and SHA-1 algorithm [22], then we can convert the CSI matrix into a binary sequence of 128 bits or 160 bits. Moreover, the four diagonal elements of the PR matrix E can be derived by transforming the binary key sequence into the decimal numbers; these four decimal numbers n1, n2, n3, n4 are of paramount importance for the PR matrix E and the corresponding phase factors can be calculated by the following equation:(9)θk=nk232×2πk=0,1,2,3.However, there are many ways to convert binary bits into four decimal numbers, considering that the receiver needs to obtain encrypted unitary matrix with the same size; the 128 bits are divided into four groups in our work, then the binary bits of each group are converted to four decimal numbers. Figure1 demonstrates the generation method for the secret key.Figure 1
Flow chart of key generation method.For anyE=ejθ0ejθ1ejθ2ejθ3, θ=[θ0,θ1,θ2,θ3], the new unitary matrix Z4W(α,θ) can be calculated according to(10)Z4Wα,θ=ω0αω1αω2αω3α×E×T×IFMFHT=ω0αejθ0I+ω1αejθ1F+ω2αejθ2M+ω3αejθ3FH,where T=I, and the corresponding decryption matrix is expressed as(11)Z4Wα,θ-1=ω0-αe-jθ0I+ω1-αe-jθ3F+ω2-αe-jθ2M+ω3-αe-jθ1FH.It is readily known that the inverse matrixF4W(α)-1 can be obtained by changing the input parameter α; that is, F4W(α)-1=F4W(-α). However, the deduction process of (10) and (11) shows that the new unitary matrix does not have such property; that is, Z4W(-α,θ)≠Z4W(α,θ)-1. Therefore, even if the WFRFT parameter α is known to Eve, the original X0 cannot be directly neutralized at the nonpurpose receiver.Figure2 depicts the generation of the constellation scrambling sequence. The input data symbols are divided into four subchannels by using a serial to parallel (S/P) converter, and the WFRFT operation is implemented through one FFT module and two reverse modules. It should be noticed that the WFRFT still holds its properties after phase rotation and the PR factors are added to each branch of WFRFT system for further changing the paradigm of transmitted signal, thus making the detection and demodulation more difficult for the Eve.Figure 2
Generation of the constellation scrambling sequence.


### 3.2. Signal Model BasedEncrypted Unitary Matrix

The block diagram of the WFRFT-based communication system based on a new encrypted unitary matrix is depicted in Figure3. After modulation of the input sequence X0, the baseband symbol can be represented as(12)S0=Z4Wα,θX0=ω1αejθ1X0+ω3αejθ3X1+ω2αejθ2X2+ω0αejθ0X3,where the transmitting signal St=S0+n and n is the additive white Gaussian noise (AWGN).Figure 3
Architecture of the WFRFT-based PHY layer security system.Similarly, from the legitimate receiver’s side, we can retrieve the original transmitting sequence by using the parameter-α and θ. The original input data then can be obtained after the demodulation. In general, our proposed scheme is determined and dynamically encrypted by the CSI, which can lead to a better PHY layer security performance.(13)Y0=Z4Wα,θ-1St=Z4Wα,θ-1S0+n=ω0-αe-jθ0IS0+ω1-αe-jθ3FS0+ω2-αe-jθ2MS0+ω3-αe-jθ1FHS0+n′=ω0-αe-jθ0S0+ω1-αe-jθ3S1+ω2-αe-jθ2S2+ω3-αe-jθ1S3+n′.


### 3.3. Security Performance of Proposed Model

In this paper, it is assumed that the new unitary matrix encrypted WFRFT is preshared by legitimate users but traditional WFRFT is performed by illegitimate user. In (1), the first item is the objective signal, and the other three can be regarded as the noise for Eve. Note that X0 and its 0~3 times DFT Xl(l=1,2,3) have the same power P. Due to the diffusion and confusion property of the constellation, which is affected by the coefficients of WFRFT and the superposition of four basic signals in (1), symbols at Eve deviate from the original constellation points by a certain phase θrotation. Then, the rotation phase can be rewritten as(14)θrotation′=θrotation+θrandom,where θrandom is determined by the channel state information. Typically, the impact factor is cos2θrotation′=cos2(3πα/4+θrandom) for the illegal receiver [17].Moreover, the equivalent signal after performing WFRFT is given by(15)Pe=ω02cos23πα4+θrandomPb,then, the equivalent power Pe satisfies(16)Pe=ω02cos23πα4+θ0P=cos2πα4cos2πα2cos23πα4+θrandomPb.The BER at the illegal receiver with M-APSK modulation can be expressed as(17)Pe=M-1Qdmin22·cos2πα/4cos2πα/2cos23πα/4+θrandom1-cos2πα/4cos2πα/2cos23πα/4+θrandom+1/SNRb,where M indicates the order of modulation, SNRb is the signal-to-noise ratio of the legitimate receiver, and dmin denotes the minimum Euclidean distance of M-APSK signal.In addition to the BER, the secrecy capacity is also an important evaluation index considered in the proposed system. It stands for the limits on the amount of messages that can be reliably transferred in a way that an illegitimate receiver cannot decode the information. According to [23, 24], it is defined as(18)C=Cb-Ce,where Cb=log2(1+Pb/Nb) and Ce=log2(1+Pb/Nb) are the channel capacity of the legitimate receiver and the illegitimate receiver, separately. Pb/Nb and Pe/Ne are signal-to-noise ratio at the legitimate and the illegitimate receiver correspondingly.For our proposed system, the secrecy capacity is given out(19)C=log21+PbNb-log21+ω02cos23πα/4+θrandomPb1-ω02cos23πα/4+θrandomPb+Ne.From the perspective of the illegitimate receiver, the signal-to-noise ratio will become constantly low; thusC will become larger. The larger C is, the more secure the transmission will be.


## 3.1. Channel State Information Encryption

Due to the inherent nature of wireless communications, the uniqueness and short-time reciprocity of the channel make it possible for legitimate user to distribute secret key reliably. In addition, the secure transmission between legitimate users can be guaranteed by exploiting the spatial difference between Bob and Eve. Therefore, we can employ these properties to protect the confidential messages that need to be transmitted, and the specific conversion methods are described in the following subsections.Firstly, Bob sends a training array to Alice, and Alice takes advantage of it to estimate the CSI of legitimate channel. Meanwhile, Bob estimates the CSI through the pilot sequence sent by Alice. It is assumed that the CSI is perfect at the legitimate transmitter; thus the CSI matrices estimated by Alice and Bob are completely identical. Under this assumption, it is necessary to convert the estimated legitimate CSI into a secret key by certain means. In this paper, the single Hash function [21], as a frequently used method in the encryption algorithms, is introduced. The single Hash function can be generalized as(8)h=HL,where h is the fixed-length Hash value, H(·) is a one-way Hash function, and L denotes the input sequence of arbitrary length.The mapping of the compression function can help us to convert any variable length input string into a fixed-length output string. Moreover, the Hash function has a good performance in collision-resistance and the uniformity of mapping distribution. According to the previous analyses, we can utilize the Hash function to map the estimated CSI matrix into a bit string with fixed length, and due to the one-way property of the Hash function, even if the key sequence is known by Eve, the correct CSI matrix cannot be obtained.In this paper, two main Hash algorithms are proposed: MD5 and SHA-1 algorithm [22], then we can convert the CSI matrix into a binary sequence of 128 bits or 160 bits. Moreover, the four diagonal elements of the PR matrix E can be derived by transforming the binary key sequence into the decimal numbers; these four decimal numbers n1, n2, n3, n4 are of paramount importance for the PR matrix E and the corresponding phase factors can be calculated by the following equation:(9)θk=nk232×2πk=0,1,2,3.However, there are many ways to convert binary bits into four decimal numbers, considering that the receiver needs to obtain encrypted unitary matrix with the same size; the 128 bits are divided into four groups in our work, then the binary bits of each group are converted to four decimal numbers. Figure1 demonstrates the generation method for the secret key.Figure 1
Flow chart of key generation method.For anyE=ejθ0ejθ1ejθ2ejθ3, θ=[θ0,θ1,θ2,θ3], the new unitary matrix Z4W(α,θ) can be calculated according to(10)Z4Wα,θ=ω0αω1αω2αω3α×E×T×IFMFHT=ω0αejθ0I+ω1αejθ1F+ω2αejθ2M+ω3αejθ3FH,where T=I, and the corresponding decryption matrix is expressed as(11)Z4Wα,θ-1=ω0-αe-jθ0I+ω1-αe-jθ3F+ω2-αe-jθ2M+ω3-αe-jθ1FH.It is readily known that the inverse matrixF4W(α)-1 can be obtained by changing the input parameter α; that is, F4W(α)-1=F4W(-α). However, the deduction process of (10) and (11) shows that the new unitary matrix does not have such property; that is, Z4W(-α,θ)≠Z4W(α,θ)-1. Therefore, even if the WFRFT parameter α is known to Eve, the original X0 cannot be directly neutralized at the nonpurpose receiver.Figure2 depicts the generation of the constellation scrambling sequence. The input data symbols are divided into four subchannels by using a serial to parallel (S/P) converter, and the WFRFT operation is implemented through one FFT module and two reverse modules. It should be noticed that the WFRFT still holds its properties after phase rotation and the PR factors are added to each branch of WFRFT system for further changing the paradigm of transmitted signal, thus making the detection and demodulation more difficult for the Eve.Figure 2
Generation of the constellation scrambling sequence.


## 3.2. Signal Model BasedEncrypted Unitary Matrix

The block diagram of the WFRFT-based communication system based on a new encrypted unitary matrix is depicted in Figure3. After modulation of the input sequence X0, the baseband symbol can be represented as(12)S0=Z4Wα,θX0=ω1αejθ1X0+ω3αejθ3X1+ω2αejθ2X2+ω0αejθ0X3,where the transmitting signal St=S0+n and n is the additive white Gaussian noise (AWGN).Figure 3
Architecture of the WFRFT-based PHY layer security system.Similarly, from the legitimate receiver’s side, we can retrieve the original transmitting sequence by using the parameter-α and θ. The original input data then can be obtained after the demodulation. In general, our proposed scheme is determined and dynamically encrypted by the CSI, which can lead to a better PHY layer security performance.(13)Y0=Z4Wα,θ-1St=Z4Wα,θ-1S0+n=ω0-αe-jθ0IS0+ω1-αe-jθ3FS0+ω2-αe-jθ2MS0+ω3-αe-jθ1FHS0+n′=ω0-αe-jθ0S0+ω1-αe-jθ3S1+ω2-αe-jθ2S2+ω3-αe-jθ1S3+n′.


## 3.3. Security Performance of Proposed Model

In this paper, it is assumed that the new unitary matrix encrypted WFRFT is preshared by legitimate users but traditional WFRFT is performed by illegitimate user. In (1), the first item is the objective signal, and the other three can be regarded as the noise for Eve. Note that X0 and its 0~3 times DFT Xl(l=1,2,3) have the same power P. Due to the diffusion and confusion property of the constellation, which is affected by the coefficients of WFRFT and the superposition of four basic signals in (1), symbols at Eve deviate from the original constellation points by a certain phase θrotation. Then, the rotation phase can be rewritten as(14)θrotation′=θrotation+θrandom,where θrandom is determined by the channel state information. Typically, the impact factor is cos2θrotation′=cos2(3πα/4+θrandom) for the illegal receiver [17].Moreover, the equivalent signal after performing WFRFT is given by(15)Pe=ω02cos23πα4+θrandomPb,then, the equivalent power Pe satisfies(16)Pe=ω02cos23πα4+θ0P=cos2πα4cos2πα2cos23πα4+θrandomPb.The BER at the illegal receiver with M-APSK modulation can be expressed as(17)Pe=M-1Qdmin22·cos2πα/4cos2πα/2cos23πα/4+θrandom1-cos2πα/4cos2πα/2cos23πα/4+θrandom+1/SNRb,where M indicates the order of modulation, SNRb is the signal-to-noise ratio of the legitimate receiver, and dmin denotes the minimum Euclidean distance of M-APSK signal.In addition to the BER, the secrecy capacity is also an important evaluation index considered in the proposed system. It stands for the limits on the amount of messages that can be reliably transferred in a way that an illegitimate receiver cannot decode the information. According to [23, 24], it is defined as(18)C=Cb-Ce,where Cb=log2(1+Pb/Nb) and Ce=log2(1+Pb/Nb) are the channel capacity of the legitimate receiver and the illegitimate receiver, separately. Pb/Nb and Pe/Ne are signal-to-noise ratio at the legitimate and the illegitimate receiver correspondingly.For our proposed system, the secrecy capacity is given out(19)C=log21+PbNb-log21+ω02cos23πα/4+θrandomPb1-ω02cos23πα/4+θrandomPb+Ne.From the perspective of the illegitimate receiver, the signal-to-noise ratio will become constantly low; thusC will become larger. The larger C is, the more secure the transmission will be.


## 4. Simulation Results

In this section, numerical simulation results are provided to evaluate the secrecy performance of our proposed WFRFT-based PHY layer security scheme. Since high-order modulation is widely applied to the satellite communications, the uncoded APSK modulation is adopted in the following examples, and we evaluate the BER of proposed system with block length ofN=1024. θ is a random generated PR vector. In addition, we set the premises that the mechanism of WFRFT method is known by the illegal Eve, including WFRFT parameter α, and Eve attempts to neutralize the transmitted satellite signal in wireless media.


### 4.1. Constellation Scrambling of the Signal

In the first experiment, we analyze the constellation scrambling of WFRFT signal withα=0,0.1,1,1.85. Figure 4 shows the constellation diagram of single parameter WFRFT, and Figure 5 depicts the constellation diagram of APSK signal after the implementation of encrypted WFRFT.Figure 4
The constellation diagram of WFRFT signal.Figure 5
The constellation diagram of encrypted WFRFT-APSK signal.Comparing to the single parameter WFRFT, the constellation distribution of the encrypted WFRFT-APSK signal has a larger range of diffusion with the same orderα. Furthermore, it can be observed that the aliasing effect of the constellation is better; that is to say, the signal constellation spreads faster after the implementation of encrypted WFRFT. This change would be beneficial for security promotion. In particular, when α=1, the constellation of the original signal is fully confused, and the constellation diagram of the signal is closer to the Gaussian distribution on the complex plane.


### 4.2. Statistical Properties of the Signal

The modulation identification based on high-order cumulant is being treated as an auspicious technique for blind signal detection. However, the high-order cumulant is insensitive to add-Gaussian noise, and the high-order cumulant for Gaussian signal is always zero, which makes this signal detection method invalid. Therefore, if the characteristics of modulation signal are similar to those of Gaussian noise, it could be considered that the signal has better antidetection ability and security performance.Figures6(a)–6(c) show the statistical results of our encrypted WFRFT signal and the degree of approximation to Gaussian signal. In the simulations, the input mapped 16APSK signals are adopted and the WFRFT parameter α is set to 1. Figure 6(a) depicts the statistical result of the complex envelope amplitude of the signal, Figure 6(b) exhibits the phase statistical property of the signal, and Figure 6(c) reveals the distribution of the in-phase component of the signal.Figure 6
WFRFT-APSK signal statistical properties.
(a)
Complex envelope amplitude (b)
Signal phase (c)
In-phase componentIn Figure6(a), the black dotted line represents the probability density curve of Rayleigh distribution with the same mean and variance as the signal envelope. In Figure 6(b), the black dotted line indicates a uniform distribution with a probability density of 1/2π. In Figure 6(c), the black dotted line denotes the probability density curve of Gaussian distribution with the same mean and variance as the statistical in-phase component of the signal.It is visible from the simulation results that the statistical complex envelope of the encrypted WFRFT-APSK signal is fitted to the Rayleigh distribution, and the phase distribution of the signal is uniform. Moreover, the distribution of the in-phase component of the signal is very close to the Gaussian distribution, which indicates that the modulation signal can achieve “covert communication” by resisting the detection and interception of the eavesdropper.


### 4.3. Security Performance of the System

Figure7 depicts the BER performances at the illegal receiver and the legitimate receiver with α=0.3 and α=0.8. The uncoded 16PSK, 16QAM, and 16APSK modulation signals are considered. It can be observed that no matter which modulation mode is adopted, the BER at Eve is maintained between 0.4 and 0.5, which indicates that the illegal receiver can hardly get any reliable messages intended for the legitimate receiver. For Bob, the proposed scheme is suitable for common scenarios without deteriorating the BER performance. In general, the proposed encryption method can guarantee the satellite communications system with additional security, which is crucial for military and dedicated communications.Figure 7
BER performance of the proposed scheme over AWGN channel.Figure8 shows the secrecy capacity of proposed system with SNRb=-10,0,10dB. In this paper, it is assumed that there is only one legitimate user and one illegal user in the wiretap channel model, and each user is equipped with a single antenna. It can be seen that the secrecy capacity is constantly a positive value when SNRb>0dB with any α selected in the real range [0,4], which means that the proposed scheme can guarantee the security of the communication effectually. Besides, let SNRb=10dB, the proper selection range of α becomes smaller, and secure communication can be obtained in [0.2,3.8].Figure 8
The secrecy capacity of proposed system.


## 4.1. Constellation Scrambling of the Signal

In the first experiment, we analyze the constellation scrambling of WFRFT signal withα=0,0.1,1,1.85. Figure 4 shows the constellation diagram of single parameter WFRFT, and Figure 5 depicts the constellation diagram of APSK signal after the implementation of encrypted WFRFT.Figure 4
The constellation diagram of WFRFT signal.Figure 5
The constellation diagram of encrypted WFRFT-APSK signal.Comparing to the single parameter WFRFT, the constellation distribution of the encrypted WFRFT-APSK signal has a larger range of diffusion with the same orderα. Furthermore, it can be observed that the aliasing effect of the constellation is better; that is to say, the signal constellation spreads faster after the implementation of encrypted WFRFT. This change would be beneficial for security promotion. In particular, when α=1, the constellation of the original signal is fully confused, and the constellation diagram of the signal is closer to the Gaussian distribution on the complex plane.


## 4.2. Statistical Properties of the Signal

The modulation identification based on high-order cumulant is being treated as an auspicious technique for blind signal detection. However, the high-order cumulant is insensitive to add-Gaussian noise, and the high-order cumulant for Gaussian signal is always zero, which makes this signal detection method invalid. Therefore, if the characteristics of modulation signal are similar to those of Gaussian noise, it could be considered that the signal has better antidetection ability and security performance.Figures6(a)–6(c) show the statistical results of our encrypted WFRFT signal and the degree of approximation to Gaussian signal. In the simulations, the input mapped 16APSK signals are adopted and the WFRFT parameter α is set to 1. Figure 6(a) depicts the statistical result of the complex envelope amplitude of the signal, Figure 6(b) exhibits the phase statistical property of the signal, and Figure 6(c) reveals the distribution of the in-phase component of the signal.Figure 6
WFRFT-APSK signal statistical properties.
(a)
Complex envelope amplitude (b)
Signal phase (c)
In-phase componentIn Figure6(a), the black dotted line represents the probability density curve of Rayleigh distribution with the same mean and variance as the signal envelope. In Figure 6(b), the black dotted line indicates a uniform distribution with a probability density of 1/2π. In Figure 6(c), the black dotted line denotes the probability density curve of Gaussian distribution with the same mean and variance as the statistical in-phase component of the signal.It is visible from the simulation results that the statistical complex envelope of the encrypted WFRFT-APSK signal is fitted to the Rayleigh distribution, and the phase distribution of the signal is uniform. Moreover, the distribution of the in-phase component of the signal is very close to the Gaussian distribution, which indicates that the modulation signal can achieve “covert communication” by resisting the detection and interception of the eavesdropper.


## 4.3. Security Performance of the System

Figure7 depicts the BER performances at the illegal receiver and the legitimate receiver with α=0.3 and α=0.8. The uncoded 16PSK, 16QAM, and 16APSK modulation signals are considered. It can be observed that no matter which modulation mode is adopted, the BER at Eve is maintained between 0.4 and 0.5, which indicates that the illegal receiver can hardly get any reliable messages intended for the legitimate receiver. For Bob, the proposed scheme is suitable for common scenarios without deteriorating the BER performance. In general, the proposed encryption method can guarantee the satellite communications system with additional security, which is crucial for military and dedicated communications.Figure 7
BER performance of the proposed scheme over AWGN channel.Figure8 shows the secrecy capacity of proposed system with SNRb=-10,0,10dB. In this paper, it is assumed that there is only one legitimate user and one illegal user in the wiretap channel model, and each user is equipped with a single antenna. It can be seen that the secrecy capacity is constantly a positive value when SNRb>0dB with any α selected in the real range [0,4], which means that the proposed scheme can guarantee the security of the communication effectually. Besides, let SNRb=10dB, the proper selection range of α becomes smaller, and secure communication can be obtained in [0.2,3.8].Figure 8
The secrecy capacity of proposed system.


## 5. Conclusions

The WFRFT signal has a good performance of low probability of interception; however, the antiscanning characteristic also indicates that the WFRFT method is based on a large amount of computation. To avoid the eavesdropper intercepting transmission by using exhaustive search method, this paper proposes an encrypted modulation scheme based on the unique legitimate CSI. The simulation results show that the APSK signal after performing the new unitary matrix has better antiscanning characteristics on the basis of maintaining the constellation characteristics and statistical properties of the original WFRFT signal. In general, the nonpurpose receiver cannot demodulate the useful signal correctly even if the WFRFT parameterα is being decoded.



---

*Source: 7963451-2018-05-15.xml*