CN109327478B - Chaotic physical layer secret access method - Google Patents
Chaotic physical layer secret access method Download PDFInfo
- Publication number
- CN109327478B CN109327478B CN201811512186.3A CN201811512186A CN109327478B CN 109327478 B CN109327478 B CN 109327478B CN 201811512186 A CN201811512186 A CN 201811512186A CN 109327478 B CN109327478 B CN 109327478B
- Authority
- CN
- China
- Prior art keywords
- matrix
- data
- chaotic
- partition
- column
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/0464—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload using hop-by-hop encryption, i.e. wherein an intermediate entity decrypts the information and re-encrypts it before forwarding it
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/001—Modulated-carrier systems using chaotic signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
- H04L27/2614—Peak power aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/001—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using chaotic signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/002—Countermeasures against attacks on cryptographic mechanisms
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Storage Device Security (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a chaotic physical layer secret access method, which comprises the steps of firstly obtaining a data matrix of an OFDM signal, then carrying out partition division on the matrix to obtain two matrixes, respectively encrypting the two matrixes by adopting different methods, then restoring the two encrypted matrixes into one matrix according to a partition division reverse method, carrying out subsequent processing and sending on the matrix by a sending end, analyzing the matrix after receiving sent data by a receiving end to obtain the two matrixes, then carrying out decryption by adopting partition division in the same way, and restoring the two decrypted matrixes into one matrix according to the partition division reverse method, wherein the matrix is the recovered data matrix. The invention adopts information partition encryption, and can effectively improve the communication safety.
Description
Technical Field
The invention belongs to the technical field of access network communication, and particularly relates to a chaotic physical layer secret access method.
Background
With the continuous promotion of the strategy of 'internet +', cloud computing is largeWith the rapid development of industries such as data, industrial internet and the like, more data and user personal information become business sharing resources, and the social and economic globalization process is promoted. But at the same time, various information security events also present large-scale outbreak situations. Newly released by the Chinese Consumer Association
The percentage of people who have encountered the personal information leakage situation among the people participating in the survey is shown to be 85.2%. Therefore, how to ensure that data and personal information are securely stored, transmitted, managed and shared on the network becomes one of the concerns of people. Network information security issues not only affect individuals, but also relate to the operational management of enterprises. From 3 months in 2018, the global social network site Facebook is subjected to two large-scale user data leakage, and accounts of nearly 5000 ten thousand users are subjected to hacker intrusion and even stealing. The occurrence of such events directly leads to the continuing decline of Facebook stock quotes and the fine due by the british regulatory department, and a plurality of global platform companies such as WeChat, Ali, Jingdong and the like in China should be introduced to give up and improve vigilance.
Reports show that the average investment in network security for enterprises in china and hong kong is about one quarter of the global value, and 72% of enterprises visited in china and hong kong show that the strategy for the security of the internet of things is in place. In addition, the openness of the network provides convenience for lawless persons to transmit terrorism, pornography, inversion, division and other harmful information on the network, and directly threatens the fields of political and defense construction and the like of the country. Therefore, the network information security and confidentiality issues have attracted high attention from the national leaders. In 2 months 2014, a central network security and information leader group was established. In 2016, 3 months, three key tasks of establishing a ubiquitous and efficient information network, strengthening information security guarantee and comprehensively guaranteeing the security of an information system are listed in the outline of thirteen-five planning in China. In 2016, 11 months, the Committee of general Committee of the national Committee of the Ministry of public health issued "network Security Law of the people's republic of China" to ensureThe network security, the network space master right and the national security and social public interests are maintained, the legal rights and interests of citizens, legal people and other organizations are protected, and the health and safety development of the economic and social informatization is promoted. Thereafter, the government of China also issued "national cyberspace security strategy" and "cyberspace international cooperation strategy".
The access network is used as the last kilometer of the network service access, has a large quantity, and becomes one of the most important parts influencing the network construction. Among them, an Orthogonal Frequency Division Multiplexing Passive Optical Network (OFDM-PON) is generally used due to its characteristics of being capable of flexibly allocating resources in a time/Frequency domain, having a high spectrum utilization rate, having a strong tolerance capability for Optical fiber dispersion, and the like, and is considered as a promising way to provide broadband and low-cost access services. However, the information security transmission faces a great challenge due to the huge number of users, frequent service interaction and the broadcasting structure of the PON. In conclusion, the research on the access network security problem and the security enhancement technology thereof has important academic value and social significance.
The encryption technology for enhancing the security of the access network is generally realized on a medium access control layer and an application layer, and the main idea is to add authentication and encryption standards in a hierarchical protocol. Although some methods guarantee high-performance secure communication, the key space is limited, and the methods do not provide security protection for the control information and the header of the data. Compared with an upper-layer protocol encryption mode, the physical layer encryption technology can not only effectively guarantee the security of control protocol data, but also resist attacks from the bottom layer of the access network. In recent years, the physical layer encryption algorithm related to the chaos technique has spurred a research boon. The characteristics of the chaos, the pseudo-randomness, the sensitivity to initial conditions and control parameters and the like of the chaos and the diffusion properties of the chaotic technology are just similar to those of a cryptosystem. Meanwhile, the chaotic sequence is convenient to generate and large in quantity, and a better implementation means can be provided for covert communication. In 2018, in 10 months, the eleventh international chaos and fractal theory and application workshop is held in Chongqing of China, the theme of 'developing chaos fractal science and enabling information security industry' is taken, the development trend of information security is fastened, and the development of the information security industry is assisted.
The Chosen Plaintext Attack (CPA) refers to an Attack mode in which an attacker firstly chooses a part of Plaintext and obtains a corresponding ciphertext through an encryption system, and then obtains related information through analyzing and comparing the relationship between the Plaintext and the ciphertext. Most of the existing chaotic encryption schemes cannot resist chosen plaintext attack, and the scheme capable of resisting chosen plaintext attack has the defects of high operation complexity, deteriorated performance and the like. In 2016, 11 months, the Shanghai university of transportation research team proposed a dynamic phase rotation scheme that incorporated random characterization of the input data, which is resistant to chosen-plaintext attacks. But introduces a 1dB bit error rate performance penalty due to data noise accumulation caused by repeated use of partially erroneous OFDM data during encryption and decryption. In 2017, in 2 months, the chaos binary sequence, the nonlinear displacement box and the chaos constant amplitude zero autocorrelation matrix are used for encrypting data. The scheme has strong capability of resisting plaintext selection attack, but needs to perform cyclic exclusive-or operation for multiple times and generate a chaotic constant-amplitude zero autocorrelation matrix, and has high operation complexity.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a chaotic physical layer secret access method which adopts information partition encryption and can effectively improve the communication safety.
In order to achieve the purpose, the chaos physical layer secret access method comprises the following steps:
s1: the OFDM signals after QAM modulation are distributed through subcarriers to obtain a data matrix M of a multiplied by b, wherein a represents the subcarrier number of one OFDM signal, b represents the symbol number in a single subcarrier, and a is less than b;
s2: partitioning the matrix M to obtain a matrix P and a matrix Q, wherein the specific partitioning method comprises the following steps:
calculating the total column number c of data extracted from the data matrix M to be b-a, extracting c columns of data from the data matrix M according to a preset partition rule, splicing the c columns of data according to column sequence numbers in the data matrix M to obtain an a × c matrix P, and splicing the rest data according to the column sequence numbers in the data matrix M to obtain an a × a matrix Q;
s3: based on the chaotic system, respectively encrypting the matrix P and the matrix Q in different modes to obtain an encrypted matrix P 'and an encrypted matrix Q';
s4: restoring the matrix P ' and the matrix Q ' into a matrix M ' according to the reverse method of the partition division in the step S2;
s5: the sending end carries out subsequent processing on the matrix M 'and sends the matrix M';
s6: after receiving the transmission data, the receiving end analyzes the transmission data to obtain a matrix M ', then divides the matrix M' to obtain a matrix P 'and a matrix Q' according to the partition dividing method in the step S2, decrypts the matrix P 'and the matrix Q' respectively by adopting the corresponding decryption methods to obtain the matrix P and the matrix Q, and then restores the matrix P and the matrix Q by adopting the reverse partition dividing method to obtain the matrix M.
The invention discloses a chaotic physical layer secret access method, which comprises the steps of firstly obtaining a data matrix of an OFDM signal, then carrying out partition division on the matrix to obtain two matrixes, respectively encrypting the two matrixes by adopting different methods, then restoring the two encrypted matrixes into one matrix according to a reverse partition division method, carrying out subsequent processing on the matrix by a sending end and sending the matrix, analyzing the matrix after receiving sending data by a receiving end to obtain the matrix, then also obtaining the two matrixes by adopting partition division, then respectively carrying out decryption by adopting corresponding methods, and restoring the two decrypted matrixes into one matrix according to the reverse partition division method, wherein the matrix is the recovered data matrix.
The invention has the following beneficial effects:
(1) the invention adopts the data matrix to divide the area, which can reduce the cross correlation among the information and reduce the probability of the same-phase combination of the signal Peak, namely reduce the Peak to Average Power Ratio (PAPR);
(2) the invention can increase the space of the secret key and improve the difficulty of brute force cracking of an illegal attacker by partitioning and separately encrypting by using two different encryption means;
(3) the invention can effectively resist the attack of selecting plaintext, an attacker can not crack all information by using the attack mode, and the following scenes are analyzed:
firstly, the selected part of plaintext is encrypted by using only one method, and an attacker can know the encryption method according to the obtained related information but cannot decode the residual information because the partition condition of the data and another encryption method cannot be known;
secondly, the selected part of plaintext is encrypted by using two methods at the same time, so that the difficulty of obtaining related information by an attacker is increased, and the remaining information still cannot be decoded even if the two encryption methods are obtained through multiple analysis, because the condition of the partition of the information cannot be obtained;
(4) the partition division method adopted by the invention is simpler, the operation complexity of the invention is directly related to two different encryption means which are selected, and the encryption means with better performance and lower working complexity is adopted, so that the reduction of the frequency spectrum resource utilization rate can be avoided, and the defects of the prior art scheme are overcome.
Drawings
FIG. 1 is a flow chart of an embodiment of the secure access method of the chaotic physical layer according to the present invention;
FIG. 2 is a diagram illustrating partition of a data matrix according to the present embodiment;
fig. 3 is a flowchart of data transmission and reception decryption in the present embodiment.
Detailed Description
The following description of the embodiments of the present invention is provided in order to better understand the present invention for those skilled in the art with reference to the accompanying drawings. It should be particularly noted that in the following description, a detailed description of known functions and designs will be omitted herein when it may obscure the subject matter of the present invention.
Examples
Fig. 1 is a flowchart of an embodiment of the chaotic physical layer secure access method of the present invention. As shown in fig. 1, the chaotic physical layer secure access method of the present invention specifically includes the steps of:
s101: matrixing an OFDM signal:
and allocating the OFDM signals after QAM modulation to obtain a data matrix M of a multiplied by b through subcarriers, wherein a represents the subcarrier number of one OFDM signal, b represents the symbol number in a single subcarrier, and a is less than b. I.e. one OFDM signal is represented as a data matrix, each OFDM symbol being considered as an element of the data matrix M.
In this embodiment, 16-QAM modulation is used as an example for description. When the modulation mode adopts 16-QAM, the bit number occupied by a single OFDM symbol is log2(16) Therefore, a signal to be transmitted needs to be divided into row vectors of 1 row, a × b × 4 columns, data is converted from binary to decimal through serial/parallel (S/P) conversion, then 16-QAM mapping is performed, and finally, a data matrix M can be obtained through subcarrier allocation. In the present embodiment, a is 120 and b is 200.
S102: partitioning the data matrix:
partitioning the data matrix M to obtain a matrix P and a matrix Q, wherein the specific partitioning method comprises the following steps:
the total column number c of the data extracted from the data matrix M is calculated as b-a, which is to ensure that the data remaining after extraction can be combined into a square matrix. As a result of research, if the total number of extracted data is too small, the practical significance of the encryption method is not great, so that 1/5 ≦ c/b ≦ 4/5 is preferably set, i.e., b/5 ≦ b-a ≦ 4 b/5. C-column data are extracted from the data matrix M according to a preset partition rule, the c-column data are spliced according to column sequence numbers in the data matrix M to obtain an a x c matrix P, and the rest data are spliced according to the column sequence numbers in the data matrix M to obtain an a x a matrix Q.
The specific method of partition division can adopt an adjacent partition method, a staggered partition method and a random partition method, and the three methods are respectively detailed as follows:
adjacent partition method
Let the number d of partitions of the data matrix M be the common divisor of the parameters b and c. If the number of the partitions is too large, the complexity of the subsequent treatment is increased, and if the number of the partitions is too small, the ideal technical effect is difficult to achieve, and researches show that the effect is better when the value range of d is that d is more than or equal to 4 and less than or equal to 12. When a is 120 and b is 200, it is known that c is 80, and then the possible values of the partition number d are 4, 5, 8, and 10. And then, the data matrix M is divided into d partitions according to the column average, each partition comprises e columns, obviously, the e is b/d, continuous f columns of data are respectively extracted from the same position of each partition, and the f is c/d, and the column sequence number of the initial column of the f columns of data in the partition is marked as g. Because of the continuous extraction, there are e-f +1 extraction methods. And splicing the extracted c columns of data according to the column serial numbers in the data matrix M to obtain an a x c matrix P, and splicing the rest data according to the column serial numbers in the data matrix M to obtain an a x a matrix Q.
In this embodiment, a partition division is performed by using an adjacent partition method. Fig. 2 is a schematic diagram of partitioning the data matrix based on the adjacent partition method in this embodiment. As shown in fig. 2, if the number d of partitions is 10, it is obvious that e is 20, and f is 8, that is, the data matrix M is divided into 10 partitions, each partition has 120 rows and 20 columns of data, and 8 columns of continuous data in each 20 columns of data are arbitrarily extracted, which indicates that 13 kinds of extraction methods are used in this embodiment. In fig. 2, g is taken as an example of 5, that is, the positions of 8 columns of continuous data are the 5 th to 12 th columns in each partition. Partitioning as described above yields a 120 × 80 matrix P and a 120 × 120 matrix Q.
Staggered partition method
Dividing the data matrix M into c partitions by columns, wherein the number of the single partition columns of the first c-1 partitions is
The expression is rounded downwards, the number of columns of the c-th partition is b- (c-1) d, 1 column of data is extracted from the same position of each partition respectively, the extracted c column of data is spliced according to the column number in the data matrix M to obtain an a x c matrix P, and the rest of data is spliced according to the column number in the data matrix M to obtain an a x a matrix Q. If the data matrix M needs to be uniformly divided into c partitions by columns, b can be set to be an integral multiple of c through parameter setting.
Random partition method
And randomly extracting c columns of data in the data matrix M, recording column serial numbers of the c columns of data, splicing the extracted c columns of data according to the column serial numbers in the data matrix M to obtain an a x c matrix P, and splicing the rest data according to the column serial numbers in the data matrix M to obtain an a x a matrix Q.
S103: and (3) partition encryption:
and respectively encrypting the matrix P and the matrix Q by adopting different methods to obtain an encrypted matrix P 'and an encrypted matrix Q'.
In practical application, the encryption method may be selected according to actual needs, and in this embodiment, a partition encryption method based on chaos is provided, and the specific method is as follows:
and generating 4 chaotic sequences X, Y, Z, U, wherein the length of the chaotic sequence X is a, the length of the chaotic sequence Y is c, the lengths of the chaotic sequence Z and the chaotic sequence U are a, encrypting the matrix P by adopting the chaotic sequence X, Y to obtain a matrix P ', and encrypting the matrix Q by adopting the chaotic sequence Z, U to obtain a matrix Q'.
The generation method of the chaotic sequence can be selected according to needs, the chaotic sequence is generated by adopting the 4D hyper-chaotic system in the embodiment, and in practice, 4 chaotic sequences can also be generated by running the low-dimensional chaotic system for multiple times. The 4D hyperchaotic system can be expressed by the following formula:
wherein, γ, μ,
In order to generate the parameters of the digital chaotic sequence, x, y, z and u are respectively variables,
respectively, the output of the chaotic system.
Setting parameters ensures that the system works in a good chaotic state, and in the embodiment, the initial value of the chaotic sequence is inputx0、y0、z0、u0Solving the differential equation by using a Runge-Kutta (Runge-Kutta) algorithm in MATLAB to obtain a chaotic sequence
In a chaotic sequence
Intercepting a sequence with the length of a as a chaotic sequence X in the chaotic sequence
Intercepting the sequence with the length of c as a chaotic sequence Y in the chaotic sequence
Intercepting a sequence with the length of a as a chaotic sequence Z and a chaotic sequence
And intercepting the sequence with the length of a as a chaotic sequence U.
The specific encryption method may be selected as needed, and the encryption methods for the two matrices will be described in detail below.
Matrix P encryption:
respectively arranging the elements in the chaotic sequence X, Y to obtain index vectors
And
the serial number of the element with serial number i after arrangement in the original chaotic sequence X is shown, i is 1,2, …, a,
indicating the element with sequence number j after arrangement in the original mixtureThe sequence number j in the chaos sequence Y is 1,2, …, c. Using an index vector DXRow scrambling of the matrix P, i.e. to be
Moving the line data to the ith line and then adopting an index vector DYSubjecting the matrix subjected to the row scrambling treatment to column scrambling, i.e. the first
The column data is shifted to the jth column, resulting in a matrix P'.
The arrangement method can be set according to actual needs, and the arrangement method based on the quick sequencing algorithm is adopted in the embodiment. The arrangement method based on the quick sorting algorithm can be briefly described as follows: first, a critical point C, which is a midpoint of data, is determined, and the value of the point is used as an arrangement reference. The position of the critical point C is not changed, data smaller than the critical point C are placed in front of the critical point, data larger than the critical point C are placed behind the critical point, and then the data arrangement is completed by placing the data closest to the critical point C in front of the sequence. If the column sequence is {0.8,0.6,0.5,0.1,0.7,0.3}, and 0.5 is selected as the critical point, after scrambling by applying the scheme, the sequence becomes {0.5,0.1,0.3,0.8,0.6,0.7}, and then the index vector obtained therefrom is changed from [ 123456 ] to [ 346125 ]. Assuming that row scrambling is performed with this index vector, the data for row 3 is placed on row 1, the data for row 4 is placed on row 2, and so on.
Matrix Q encryption:
in this embodiment, for the encryption of the matrix Q, a chaos sequence Z, U is used to generate a reconfigurable matrix based on Discrete Fourier Transform (DFT), and the matrix Q is pre-coded.
Let F be a x a standard DFT matrix, whose expression is as follows:
wherein, Fα,βRepresenting elements, α, β, of a standard DFT matrix FThe row number and the column number of each element are denoted by α, β,0, 1, …, a-1.
Let F' be a × a DFT-based reconfigurable matrix, whose expression is as follows:
wherein, F'α,βRepresenting elements of a DFT-based reconfigurable matrix F', Z [ alpha ]]Representing the alpha element, Ubeta, in the chaotic sequence Z]Representing the beta-th element in the chaotic sequence U.
The matrix Q is precoded by using the reconfigurable matrix F' based on DFT, which can be expressed by the following formula:
Q′＝F′·Q
where · represents the dot product of the matrix.
In practical application, since the number of digits after the decimal point of the element in the chaotic sequence Z, U is large, the calculation is not easy, and in order to improve the randomness of the element, the chaotic sequence Z, U may be preprocessed, and the preprocessing may be expressed as follows by using a formula:
where K represents the decimal digit, K is 1,2, …, K is set as required, and ω [ α [ [ α ])]kRepresenting the kth digit, upsilon [ beta ] beta after the alpha element decimal point in the original chaotic sequence Z]kRepresents the kth digit after the beta element decimal point in the original chaotic sequence U, lambdak、ρkRespectively representing coefficients corresponding to the k-th digit after the decimal point when the chaotic sequence Z, U is preprocessed, generally, lambdak、ρkAre integers and can be set according to actual needs.
S104: and (3) encryption information synthesis:
according to the reverse method of partition division in step S102, the matrix P ' and the matrix Q ' are reduced to a matrix M ', which is the encrypted matrix.
In this embodiment, a is 120, b is 200, c is 80, d is 10, e is 20, f is 8, and g is 5: dividing the matrix P 'and the matrix Q' into 10 partitions in a column-sharing mode respectively, then inserting 8 columns of data of the partition (I) in the matrix P 'between the 4 th column and the 5 th column of data of the partition (I) in the matrix Q' by taking the matrix Q 'as a reference, and so on, and finally obtaining the encrypted data matrix M'.
Generally, the robustness of an encryption scheme can be quantitatively evaluated by adopting the size of a key space, and the larger the key space is, the stronger the encryption algorithm can resist exhaustive attack. For the present invention, different partitioning parameters d and g will generate different key spaces, and selecting the optimal values of d and g will result in a larger key space.
Taking the parameters in this embodiment as an example, the size of the key space obtained based on the chaotic physical layer secret access method of the present invention is 13 × 120! X 80! X 1015×1015×1015×1015～10379. Wherein 13 represents the number of times of fetching 8 columns of continuous data, 120! X 80! The expression matrix P generates a key space by independent row and column scrambling, and each chaotic sequence provides a conservative key space of 1015. It can be seen that the present invention performs well in terms of key space.
S105: data transmission:
and the sending terminal carries out subsequent processing on the matrix M 'and sends the matrix M'. The specific processing procedure of data transmission can be set according to actual needs, and the current common processing procedure of the OFDM-PON is as follows:
the first step is as follows: the matrix M' is transformed by hermitian conjugation to obtain a conjugate matrix M "of the same size.
The second step is that: and arranging the matrixes M 'and M' according to rows, namely arranging the data of the matrix M 'in the front a rows and the data of the matrix M' in the rear a rows, and then filling the B-2a rows of all-zero data to obtain a matrix N. Where B denotes the number of rows of an Inverse Fast Fourier Transform (IFFT) matrix. At this time, the number of subcarriers is expanded from 2a to B, and an OFDM symbol matrix N is converted from the frequency domain to the time domain using an inverse fast fourier transform method, resulting in a matrix N'.
The third step: after parallel/serial (P/S) conversion of the matrix N', the data sequence becomes a row vector of 1 row B × B columns.
The fourth step: a Cyclic Prefix (CP) is added.
S106: receiving and decrypting:
after receiving the sending data, the receiving end analyzes the sending data to obtain a matrix M'. The analysis process includes CP removal, serial/parallel (S/P) conversion, Fast Fourier Transform (FFT) processing and subcarrier allocation, and the matrix M' can be extracted. Then, according to the partition method in step S102, the matrix M ' is partitioned to obtain a matrix P ' and a matrix Q '. Obviously, the sending end and the receiving end need to share the partition division and the related parameters of the chaotic system in advance to realize decryption. And then, respectively decrypting the matrix P 'and the matrix Q' by adopting a corresponding decryption method to obtain the matrix P and the matrix Q, and then restoring by adopting a reverse method of partition division to obtain the matrix M.
Fig. 3 is a flowchart of data transmission and reception decryption in the present embodiment. As shown in fig. 3, the matrix division, partition encryption, and matrix reassembly are the data matrix partition division and encryption processes in the present invention, and the matrix division, partition decryption, and matrix reassembly are the data decryption processes in the present invention.
As for the chaos-based encryption method adopted in this embodiment, 4 chaos sequences X, Y, Z, U are generated by using the same chaos system and chaos sequence initial values during decryption, then elements in the chaos sequence X, Y are arranged respectively to obtain two index vectors, and row scrambling and column scrambling recovery are performed on the matrix P' according to the index vectors. If the row index vector is [ 346125 ] obtained according to the chaotic sequence X, it means that the data in the 1 st row in the present matrix P 'should be in the 3 rd row in the original matrix P, the data in the 2 nd row in the present matrix P' should be in the 4 th row in the original matrix P, and so on.
Then, a matrix F' is generated by using the chaos sequence Z, U, and the expression is as follows:
wherein, F ″)α,βRepresenting the elements of the matrix F ". F ″, F ═ E, E denotes an identity matrix.
The decryption process is to perform point multiplication on the square matrix Q ' subjected to the precoding of the matrix F ' and the matrix F ', and the expression of decryption is as follows:
F″·Q′＝F″·F′·Q＝Q
although illustrative embodiments of the present invention have been described above to facilitate the understanding of the present invention by those skilled in the art, it should be understood that the present invention is not limited to the scope of the embodiments, and various changes may be made apparent to those skilled in the art as long as they are within the spirit and scope of the present invention as defined and defined by the appended claims, and all matters of the invention which utilize the inventive concepts are protected.
Claims (6)
1. A chaotic physical layer secret access method is characterized by comprising the following steps:
s1: the OFDM signals after QAM modulation are distributed through subcarriers to obtain a data matrix M of a multiplied by b, wherein a represents the subcarrier number of one OFDM signal, b represents the symbol number in a single subcarrier, and a is less than b;
s2: partitioning the matrix M to obtain a matrix P and a matrix Q, wherein the specific partitioning method comprises the following steps:
calculating the total column number c of data extracted from the data matrix M to be b-a, extracting c columns of data from the data matrix M according to a preset partition rule, splicing the c columns of data according to column sequence numbers in the data matrix M to obtain an a × c matrix P, and splicing the rest data according to the column sequence numbers in the data matrix M to obtain an a × a matrix Q;
s3: based on the chaotic system, respectively encrypting the matrix P and the matrix Q in different modes to obtain an encrypted matrix P 'and an encrypted matrix Q'; the encryption method of the matrix P and the matrix Q is as follows:
generating X, Y, Z, U chaotic sequences, wherein the length of the chaotic sequence X is a, the length of the chaotic sequence Y is c, and the lengths of the chaotic sequence Z and U are a, encrypting the matrix P by adopting a chaotic sequence X, Y to obtain a matrix P ', and encrypting the matrix Q by adopting a chaotic sequence Z, U to obtain a matrix Q';
the encryption method of the matrix P is as follows: respectively arranging the elements in the chaotic sequence X, Y to obtain index vectors
And
the serial number of the element with serial number i after arrangement in the original chaotic sequence X is shown, i is 1,2, …, a,
indicating the serial number of the element with the serial number j after arrangement in the original chaotic sequence X, wherein j is 1,2, …, c; using an index vector DXRow scrambling of the matrix P, i.e. to be
Moving the line data to the ith line and then adopting an index vector DYSubjecting the matrix subjected to the row scrambling treatment to column scrambling, i.e. the first
Moving the row data to the j row to obtain a matrix P';
the encryption method of the matrix Q is as follows:
firstly, the chaos sequence Z, U is preprocessed by the following method:
where K represents the decimal digit, K is 1,2, …, K is set as required, and ω [ α [ [ α ])]kRepresenting the kth digit, upsilon [ beta ] beta after the alpha element decimal point in the original chaotic sequence Z]kRepresents the kth digit after the beta element decimal point in the original chaotic sequence U, lambdak、ρkRespectively representing coefficients corresponding to kth digits after decimal point when the chaotic sequence Z, U is preprocessed;
the chaotic sequence Z, U is adopted to generate a reconfigurable matrix F' based on DFT, and the expression is as follows:
wherein, F'α,βDenotes elements of the DFT-based reconfigurable matrix F', α and β denote row numbers and column numbers of the elements, respectively, and α, β are 0,1, …, a-1, Z [ α [, ]]Representing the alpha element, Ubeta, in the chaotic sequence Z]Represents the beta-th element in the chaotic sequence U;
the matrix Q' is calculated using the following equation:
Q′＝F′·Q
s4: restoring the matrix P ' and the matrix Q ' into a matrix M ' according to the reverse method of the partition division in the step S2;
s5: the sending end carries out subsequent processing on the matrix M 'and sends the matrix M';
s6: after receiving the transmission data, the receiving end analyzes the transmission data to obtain a matrix M ', then divides the matrix M' to obtain a matrix P 'and a matrix Q' according to the partition dividing method in the step S2, decrypts the matrix P 'and the matrix Q' respectively by adopting the corresponding decryption methods to obtain the matrix P and the matrix Q, and then restores the matrix P and the matrix Q by adopting the reverse partition dividing method to obtain the matrix M.
2. The chaotic physical layer secure access method of claim 1, wherein the parameters a and b satisfy the following relationship b/5 ≤ b-a ≤ 4 b/5.
3. The chaotic physical layer secure access method of claim 1, wherein the partitioning in step S2 employs an adjacent partitioning method, and the specific method is as follows: and taking the partition number d of the data matrix M as a common divisor of the parameters b and c, equally dividing the data matrix M into d partitions according to columns, extracting continuous f columns of data from the same position of each partition respectively, wherein f is c/d, the column number of the initial column of the f columns of data in the partition is marked as g, splicing the extracted c columns of data according to the column number in the data matrix M to obtain an a × c matrix P, and splicing the rest data according to the column number in the data matrix M to obtain an a × a matrix Q.
4. The chaotic physical layer secure access method of claim 1, wherein the partitioning in step S2 employs a staggered partitioning method, and the specific method is as follows: dividing the data matrix M into c partitions by columns, wherein the number of columns of a single partition of the first c-1 partitions is
The expression is rounded downwards, the number of columns of the c-th partition is b- (c-1) d, 1 column of data is extracted from the same position of each partition respectively, the extracted c column of data is spliced according to the column number in the data matrix M to obtain an a x c matrix P, and the rest of data is spliced according to the column number in the data matrix M to obtain an a x a matrix Q.
5. The chaotic physical layer secure access method of claim 1, wherein the partition in step S2 is performed by a random partition method, and the method specifically comprises: and randomly extracting c columns of data in the data matrix M, recording column serial numbers of the c columns of data, splicing the extracted c columns of data according to the column serial numbers in the data matrix M to obtain an a x c matrix P, and splicing the rest data according to the column serial numbers in the data matrix M to obtain an a x a matrix Q.
6. The chaotic physical layer secure access method of claim 1, wherein the 4 chaotic sequences are generated by a 4D hyper-chaotic system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811512186.3A CN109327478B (en) | 2018-12-11 | 2018-12-11 | Chaotic physical layer secret access method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811512186.3A CN109327478B (en) | 2018-12-11 | 2018-12-11 | Chaotic physical layer secret access method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109327478A CN109327478A (en) | 2019-02-12 |
| CN109327478B true CN109327478B (en) | 2020-11-20 |
Family
ID=65256148
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811512186.3A Active CN109327478B (en) | 2018-12-11 | 2018-12-11 | Chaotic physical layer secret access method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109327478B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111447054B (en) * | 2020-05-28 | 2021-05-14 | 北京邮电大学 | FBMC passive optical network physical layer encryption method and device based on five-dimensional hyperchaos |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103401674A (en) * | 2013-06-21 | 2013-11-20 | 电子科技大学 | Encryption method for broadband access network |
| US8645678B2 (en) * | 2011-12-19 | 2014-02-04 | Khalifa University of Science, Technology & Research (KUSTAR) | Chaotic cryptography for OFDM based communications systems |
| CN105933103A (en) * | 2016-04-28 | 2016-09-07 | 上海交通大学 | Light DFT-S-OFDM secure transmission system based on digital chaos |
| CN107360479A (en) * | 2017-07-17 | 2017-11-17 | 电子科技大学 | A kind of encryption method of multiple access access EPON |
| CN107949997A (en) * | 2015-04-30 | 2018-04-20 | 法国矿业电信学校联盟 | Space Time Coding for communication system |
-
2018
- 2018-12-11 CN CN201811512186.3A patent/CN109327478B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8645678B2 (en) * | 2011-12-19 | 2014-02-04 | Khalifa University of Science, Technology & Research (KUSTAR) | Chaotic cryptography for OFDM based communications systems |
| CN103401674A (en) * | 2013-06-21 | 2013-11-20 | 电子科技大学 | Encryption method for broadband access network |
| CN107949997A (en) * | 2015-04-30 | 2018-04-20 | 法国矿业电信学校联盟 | Space Time Coding for communication system |
| CN105933103A (en) * | 2016-04-28 | 2016-09-07 | 上海交通大学 | Light DFT-S-OFDM secure transmission system based on digital chaos |
| CN107360479A (en) * | 2017-07-17 | 2017-11-17 | 电子科技大学 | A kind of encryption method of multiple access access EPON |
Non-Patent Citations (3)
| Title |
|---|
| "OFDM-PON系统中基于混沌映射的密钥保护和PAPR降低的加密算法";陈瑞兰 等;《光电子·激光》;20181115;全文 * |
| "光接入网络的安全性及其增强技术研究";张位;《中国博士学位论文全文数据库-信息科技辑》;20180215;全文 * |
| Xiaosong Fu 等."A chaotic modified-DFT encryption scheme for physical layer security and PAPR reduction in OFDM-PON".《Optical Fiber Technology》.2018, * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109327478A (en) | 2019-02-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Talhaoui et al. | Fast image encryption algorithm with high security level using the Bülban chaotic map | |
| Wang et al. | A visually secure image encryption scheme based on parallel compressive sensing | |
| Li et al. | Cryptanalysis and improvement in a chaotic image cipher using two-round permutation and diffusion | |
| Ye et al. | A novel multi‐image visually meaningful encryption algorithm based on compressive sensing and Schur decomposition | |
| Pujari et al. | A hybridized model for image encryption through genetic algorithm and DNA sequence | |
| Iyer et al. | A novel idea on multimedia encryption using hybrid crypto approach | |
| Ghebleh et al. | A novel secret image sharing scheme using large primes | |
| Mishra et al. | Multi-layer security of color image based on chaotic system combined with RP2DFRFT and Arnold transform | |
| Erkin et al. | Privacy-preserving distributed clustering | |
| CN110336657B (en) | Optical OFDM dynamic key generation method based on channel characteristics | |
| CN107592298B (en) | Sequence comparison algorithm secure outsourcing method based on single server model, user terminal and server | |
| Mikhail et al. | Two‐Phase Image Encryption Scheme Based on FFCT and Fractals | |
| CN110445797A (en) | A kind of two side's multidimensional data comparative approach and system with secret protection | |
| Reyad et al. | Image encryption using koblitz’s encoding and new mapping method based on elliptic curve random number generator | |
| Vasanthanayaki | Secure medical health care content protection system (SMCPS) with watermark detection for multi cloud computing environment | |
| El Assad | Chaos based information hiding and security | |
| Ravichandran et al. | Chaos and DNA blended hybrid encryption algorithm for secure image transmission over dct pre-coded ofdm | |
| CN109327478B (en) | Chaotic physical layer secret access method | |
| Arumugam et al. | An efficient machine learning based image encryption scheme for medical image security | |
| Siswanto et al. | Chaotic-based encryption algorithm using henon and logistic maps for fingerprint template protection | |
| Ni et al. | PHY‐Aided Secure Communication via Weighted Fractional Fourier Transform | |
| Bhattacharjee et al. | An image-in-image communication scheme using secret sharing and M-ary spread spectrum watermarking | |
| Wang et al. | Secure image transmission in orthogonal frequency division multiplexing visible light communication systems | |
| Chen et al. | Physical-layer OFDM data encryption using chaotic ZCMT precoding matrix | |
| Gulshan et al. | Chaotic image encryption technique based on IDEA and discrete wavelet transformation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |