CN105846947B - A kind of encryption in physical layer method introducing Latin battle array - Google Patents
A kind of encryption in physical layer method introducing Latin battle array Download PDFInfo
- Publication number
- CN105846947B CN105846947B CN201610162614.9A CN201610162614A CN105846947B CN 105846947 B CN105846947 B CN 105846947B CN 201610162614 A CN201610162614 A CN 201610162614A CN 105846947 B CN105846947 B CN 105846947B
- Authority
- CN
- China
- Prior art keywords
- key
- latin
- battle array
- encryption
- physical layer
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000013507 mapping Methods 0.000 claims abstract description 7
- 239000011159 matrix material Substances 0.000 claims description 40
- 230000008569 process Effects 0.000 claims description 10
- 238000006243 chemical reaction Methods 0.000 claims description 7
- 230000017105 transposition Effects 0.000 claims 1
- 238000001583 randomness test Methods 0.000 abstract description 2
- 230000000739 chaotic effect Effects 0.000 description 23
- 238000004422 calculation algorithm Methods 0.000 description 20
- 238000010586 diagram Methods 0.000 description 17
- 238000004891 communication Methods 0.000 description 13
- 230000009466 transformation Effects 0.000 description 13
- 238000004458 analytical method Methods 0.000 description 10
- 238000012360 testing method Methods 0.000 description 10
- 230000005540 biological transmission Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 5
- 230000035945 sensitivity Effects 0.000 description 4
- 230000006399 behavior Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000007774 longterm Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000001174 ascending effect Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 125000004122 cyclic group Chemical group 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 description 1
- 102100026758 Serine/threonine-protein kinase 16 Human genes 0.000 description 1
- 101710184778 Serine/threonine-protein kinase 16 Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000001149 cognitive effect Effects 0.000 description 1
- 239000013256 coordination polymer Substances 0.000 description 1
- 238000005336 cracking Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000005562 fading Methods 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000003064 k means clustering Methods 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000010206 sensitivity analysis Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000005309 stochastic process Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04K—SECRET COMMUNICATION; JAMMING OF COMMUNICATION
- H04K1/00—Secret communication
- H04K1/04—Secret communication by frequency scrambling, i.e. by transposing or inverting parts of the frequency band or by inverting the whole band
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04K—SECRET COMMUNICATION; JAMMING OF COMMUNICATION
- H04K1/00—Secret communication
- H04K1/06—Secret communication by transmitting the information or elements thereof at unnatural speeds or in jumbled order or backwards
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
技术领域technical field
本发明涉及一种物理层加密方法,具体来说,涉及一种基于拉丁阵和幅相变换的物理层加密方法。The invention relates to a physical layer encryption method, in particular to a physical layer encryption method based on Latin matrix and amplitude-to-phase transformation.
背景技术Background technique
随着当今社会的信息化程度越来越高,传统的商务活动、事物处理以及政府服务已经越来越多地通过开放的计算机和通信网,特别是基于万维网的工具来实施和提供,信息安全已成为人们在信息空间中生存和发展的重要保证条件。从安全性角度看,信息安全的主要特点包括保密性、完整性、认证性和不可否认性。在现阶段,基于密码技术来保证信息安全仍是主要安全策略。但在通信网络中,基于传统密码学的上层加密机制面临着一些新的挑战。With the increasing degree of informatization in today's society, traditional business activities, transaction processing, and government services have been increasingly implemented and provided through open computer and communication networks, especially tools based on the World Wide Web. Information security It has become an important guarantee condition for people to survive and develop in the information space. From the perspective of security, the main characteristics of information security include confidentiality, integrity, authentication and non-repudiation. At this stage, ensuring information security based on cryptography is still the main security strategy. But in the communication network, the upper layer encryption mechanism based on traditional cryptography faces some new challenges.
无线移动通信系统的扁平化发展,无线链路的开放特性、移动网络的动态拓扑和节点的微型化,使得基于密码学在链路层等通信上层进行加密的传统安全策略面临一些新的挑战。一方面,超级计算机的快速发展,使得基于大运算量的传统加密机制存在着被破译的可能;增加密钥长度、扩充密钥空间以抵抗穷举破解的思路又会受到密钥管理和宽带传输系统高传输速率的限制。另一方面,认知无线电技术的快速发展,使得窃听者通过一些窃听技术可以截获无线信道的频率、带宽以及调制方式等传统安全策略未加以保护的信息。The flat development of wireless mobile communication systems, the open nature of wireless links, the dynamic topology of mobile networks, and the miniaturization of nodes have brought some new challenges to the traditional security strategies based on cryptography for encryption at the upper communication layers such as the link layer. On the one hand, the rapid development of supercomputers makes it possible for the traditional encryption mechanism based on large calculations to be deciphered; the idea of increasing the key length and expanding the key space to resist exhaustive cracking will be affected by key management and broadband transmission. System high transfer rate limitation. On the other hand, with the rapid development of cognitive radio technology, eavesdroppers can use some eavesdropping techniques to intercept information that is not protected by traditional security strategies such as the frequency, bandwidth, and modulation mode of wireless channels.
基于以上通信网络的现状,部分窃听行为逐渐演变为窃听者不窃取通信数据等破译难度较大的信息,而是根据未被保护的物理层信息,窃听出通信双发是谁,各自地理位置等破译难度相对较小的信息,这种方法被称为流量分析攻击(Traffic analysis attack)。窃听者通过流量分析攻击所窃取的信息,虽然不是通信数据,但可反映通信状况,这在军事通信中仍构成很大威胁。因而如何在物理层保证调制方式和调制信息的安全成为目前研究移动通信安全性的一个重要方面。Based on the current situation of the above-mentioned communication network, some eavesdropping behaviors have gradually evolved into the fact that the eavesdroppers do not steal information that is difficult to decipher, such as communication data, but instead use unprotected physical layer information to eavesdrop on who the two communication parties are, their respective geographical locations, etc. Information that is relatively less difficult to decipher is called a traffic analysis attack (Traffic analysis attack). Although the information stolen by eavesdroppers through traffic analysis attacks is not communication data, it can reflect the communication status, which still poses a great threat in military communication. Therefore, how to ensure the security of the modulation mode and modulation information at the physical layer has become an important aspect in the current research on the security of mobile communications.
从物理层实现通信安全主要有两个方向,一是利用无线信道的物理特性来产生、管理和分发密钥以及基于无线信道的物理层认证;二是以窃听信道模型为基础的物理层安全,即Wyner基于Shannon信息论所提出的保密容量的概念。而基于保密容量的物理层安全技术要求主信道的信道质量优于窃听信道,则存在保密编码既保证合法用户的可靠通信,又使窃听者无法获取信息,达到不借助密钥即可实现保密通信的目的,包括人工噪声、波束成形等物理层安全传输技术。但是这种基于信息论的物理层安全技术依赖于信道信息,窃听者和合法者信道相似时无法保证安全性。因而本发明在物理层,基于混沌系统,提出一种利用利用拉丁阵和混沌序列置乱星座图的加密方法。There are two main directions to achieve communication security from the physical layer. One is to use the physical characteristics of the wireless channel to generate, manage and distribute keys and physical layer authentication based on the wireless channel; the other is to use the physical layer security based on the eavesdropping channel model. That is, the concept of secrecy capacity proposed by Wyner based on Shannon information theory. The physical layer security technology based on secret capacity requires that the channel quality of the main channel is better than that of the eavesdropping channel, and there is a secret code that not only ensures the reliable communication of legitimate users, but also makes it impossible for eavesdroppers to obtain information, so that secret communication can be realized without the use of keys The purpose, including physical layer security transmission technologies such as artificial noise and beamforming. But this kind of physical layer security technology based on information theory depends on channel information, and the security cannot be guaranteed when the eavesdropper and legitimate party have similar channels. Therefore, at the physical layer, the present invention proposes an encryption method that utilizes a Latin matrix and a chaotic sequence to scramble a constellation diagram based on a chaotic system.
发明内容Contents of the invention
本发明所要解决的技术问题是提供一种利用混沌系统和拉丁阵生成性能良好的密钥,然后利用密钥置乱星座图,使不同调制方式的星座点在复平面上的分布趋于均匀,进而不同调制方式所具有的个性特征参数趋于相同,达到从物理层着手保护调制方式和调制信息的目的。为解决上述问题,本发明提出一种拉丁阵和幅相变换相结合的物理层加密方法,通过混沌系统生成密钥集,达到加密星座图的目的。The technical problem to be solved by the present invention is to provide a key with good performance using the chaotic system and the Latin matrix, and then use the key to scramble the constellation diagram, so that the distribution of the constellation points of different modulation methods on the complex plane tends to be uniform, Furthermore, the individual characteristic parameters of different modulation methods tend to be the same, so as to achieve the purpose of protecting the modulation method and modulation information from the physical layer. In order to solve the above problems, the present invention proposes a physical layer encryption method combining Latin matrix and amplitude-phase transformation, and generates a key set through a chaotic system to achieve the purpose of encrypting a constellation diagram.
所述物理层加密算法包括:The physical layer encryption algorithm includes:
S1:设置系统的各种参量:载波频率,调制方式等;S1: Set various parameters of the system: carrier frequency, modulation mode, etc.;
S2:系统输入二进制信息序列,经串并变换、星座映射,转换为复数向量C,其中C=[c1,c2,c3,…cn]T,其中[]T表示对矩阵的转置,则得到待加密信息plain_data,其中plain_data=C;S2: The system inputs the binary information sequence, converts it into a complex vector C through serial-to-parallel transformation and constellation mapping, where C=[c 1 ,c 2 ,c 3 ,…c n ] T , where [] T represents the transformation of the matrix Set, then obtain the information to be encrypted plain_data, wherein plain_data=C;
S3:利用混沌序列生成密钥集{K1,K2,拉丁阵},用K1与待加密信息plain_data的相位相加,得到密文E1;用K2与密文E1对应元素相乘,得到密文E2;最后根据拉丁阵中的元素值,对密文E2进行相应变换,得到最终密文E;S3: Use the chaotic sequence to generate the key set {K1, K2, Latin matrix}, add K1 to the phase of the information to be encrypted plain_data to obtain the ciphertext E1; use K2 to multiply the corresponding elements of the ciphertext E1 to obtain the ciphertext E2 ; Finally, according to the element values in the Latin matrix, the ciphertext E2 is transformed accordingly to obtain the final ciphertext E;
密钥集{K1,K2,拉丁阵}的生成过程如下:The generation process of the key set {K1, K2, Latin matrix} is as follows:
1)选择一种混沌系统和初始值start_data,生成混沌序列xi;1) Select a chaotic system and initial value start_data to generate chaotic sequence x i ;
2)混沌序列虽然具有长期不可预测特点,但其短期行为具有一定相关性,针对此问题,本文引入Extract函数和拉丁阵,在密钥生成和拉丁阵的构造上进行了创新,做到控制复杂度的前提下,进一步提高安全性;2) Although the chaotic sequence has long-term unpredictable characteristics, its short-term behavior has a certain correlation. To solve this problem, this paper introduces the Extract function and the Latin matrix, and innovates in the key generation and the construction of the Latin matrix to achieve complex control Under the premise of high degree, further improve the security;
Dxi=mod(Extract(xi,12,13,14),256)/512 Dxi = mod(Extract( xi ,12,13,14),256)/512
其中Extract函数为抽取输入值xi小数部分的第12,13,14位数据,以获得密钥良好的不可预测性。根据上式,可得到一组位于[0,0.5]之间的随机数据Dxi,由K1=Dxi×4π和K2=Dxi+0.75得到用于相位旋转的密钥K1(0≤K1≤2π)和幅度变换的密钥K2(0.75≤K2≤1.25);The Extract function is to extract the 12th, 13th, and 14th digits of the decimal part of the input value x i , so as to obtain good unpredictability of the key. According to the above formula, a group of random data D xi between [0, 0.5] can be obtained, and the key K1 for phase rotation can be obtained from K1=D xi ×4π and K2=D xi +0.75 (0≤K1≤ 2π) and the key K2 for amplitude transformation (0.75≤K2≤1.25);
3)为消除数据之间的相关性,对xi进行如下处理得到yi;3) In order to eliminate the correlation between the data, xi is processed as follows to obtain yi ;
yi=106xi-floor(106xi)i=1,2…ny i =10 6 x i -floor(10 6 x i )i=1,2...n
对yi进行升序排列,得出yi对应序号i的排列信息,即为拉丁阵。拉丁阵主要特点是每一行或者每一列的元素为1到矩阵行数或者列数的随机分布;Arrange y i in ascending order to obtain the arrangement information of y i corresponding to serial number i, which is the Latin matrix. The main feature of the Latin matrix is that the elements of each row or column are randomly distributed from 1 to the number of rows or columns of the matrix;
S4:对密文E进行并串变换,然后经D/A变换处理,送入无线信道中传输;S4: Parallel-to-serial conversion is performed on the ciphertext E, and then processed by D/A conversion, and sent to the wireless channel for transmission;
物理层解密方法为加密方法的逆过程,最后加密的最先解密,逐一层层解密,即得到原始明文信息。The physical layer decryption method is the reverse process of the encryption method. The last encrypted one is decrypted first, and the original plaintext information is obtained by decrypting layer by layer.
采用了上述技术方案,本发明的有益效果为:调制的本质是将信息从二元比特域映射到复数域,这个过程带来一些冗余信息,传统加密方式没有充分利用映射带来的额外信息。本文所提算法将映射后的复平面信息充分利用,达到极大地扩充密钥空间的目的。通过引入Extract函数,充分消除混沌序列间的关联性,在保证密钥空间的前提下而又不必生成大量密钥,大大减小了硬件实现复杂度,并对生成的密钥进行NIST随机性测试,验证其不可预测性。引入拉丁阵,将星座点坐标信息彻底打乱,并从密钥空间,密钥敏感性和识别调制方式等几方面分析本算法的安全性,分析结果表明,本算法具有很大的密钥空间,几乎不可能暴力破解。算法在所需额外计算量很小的前提下,具有很强的安全性,在物理层安全传输方面具有广阔的应用前景。Adopting the above-mentioned technical solution, the beneficial effect of the present invention is: the essence of modulation is to map information from the binary bit field to the complex field, this process brings some redundant information, and the traditional encryption method does not make full use of the additional information brought by the mapping . The algorithm proposed in this paper makes full use of the mapped complex plane information to greatly expand the key space. By introducing the Extract function, the correlation between chaotic sequences is fully eliminated. On the premise of ensuring the key space without generating a large number of keys, the complexity of hardware implementation is greatly reduced, and the generated keys are tested for NIST randomness. , verifying its unpredictability. Introduce the Latin matrix, completely disrupt the coordinate information of the constellation points, and analyze the security of this algorithm from the aspects of key space, key sensitivity and identification modulation mode. The analysis results show that this algorithm has a large key space , nearly impossible to brute force. The algorithm has strong security under the premise of requiring little additional calculation, and has broad application prospects in the secure transmission of physical layer.
附图说明Description of drawings
图1是本发明提出的拉丁阵和幅相变换相结合的物理层加密方法流程图;Fig. 1 is the flow chart of the physical layer encryption method that the Latin matrix proposed by the present invention combines with amplitude-phase transformation;
图2是发送端加密前星座图;Figure 2 is a constellation diagram before encryption at the sending end;
图3是发送端加密后星座图;Figure 3 is a constellation diagram after encryption at the sending end;
图4是合法者星座图;Fig. 4 is a legal person constellation diagram;
图5是窃听者星座图;Fig. 5 is the eavesdropper constellation diagram;
图6是合法者和窃听者密钥差别很小时,误比特率对比图;Fig. 6 is when the legitimate person and the eavesdropper's key difference are very small, the comparison chart of the bit error rate;
图7是应用本发明前后,误比特率对比图;Fig. 7 is before and after applying the present invention, bit error rate comparison chart;
图8是基于高阶累积量识别算法成功率对比图。Fig. 8 is a comparison chart of the success rate based on the high-order cumulant recognition algorithm.
具体实施方式Detailed ways
下面通过实例对本发明做进一步的说明,但是需要注意的是,公布实施例的目的在于帮助进一步理解本发明,但是本领域的技术人员可以理解:在不脱离本发明及所附的权利要求的精神和范围内,各种替换和修改都是可能的。因此,本发明不应局限于实例所公开的内容,本发明要求保护的范围以权利要求书界定的范围为准。The present invention is further described by examples below, but it should be noted that the purpose of announcing the embodiments is to help further understand the present invention, but those skilled in the art can understand: without departing from the spirit of the present invention and the appended claims Various substitutions and modifications are possible within the scope. Therefore, the present invention should not be limited to the content disclosed in the examples, and the protection scope of the present invention is subject to the scope defined in the claims.
本发明的技术方案是,在OFDM系统上,一种引入拉丁阵的星座置乱方法,具体发送端加密过程包括下述步骤:The technical scheme of the present invention is, on the OFDM system, a kind of constellation scrambling method that introduces Latin matrix, the concrete sending end encryption process comprises the following steps:
S1:设置系统的各种参量:子载波数N,循环前缀CP,调制方式等;S1: Set various parameters of the system: number of subcarriers N, cyclic prefix CP, modulation mode, etc.;
S2:系统输入二进制信息序列,经串并变换、星座映射,转换为复数向量C,其中C=[c1,c2,c3,…cn]T,其中[]T表示对矩阵的转置,则得到待加密信息plain_data,其中plain_data=C;S2: The system inputs the binary information sequence, converts it into a complex vector C through serial-to-parallel transformation and constellation mapping, where C=[c 1 ,c 2 ,c 3 ,…c n ] T , where [] T represents the transformation of the matrix Set, then obtain the information to be encrypted plain_data, wherein plain_data=C;
S3:利用混沌序列生成密钥集{K1,K2,拉丁阵},用K1与待加密信息plain_data的相位相加,得到密文E1;用K2与密文E1对应元素相乘,得到密文E2;最后根据拉丁阵中的元素值,对密文E2进行相应变换,得到最终密文E;密钥集的生成过程如下:S3: Use the chaotic sequence to generate the key set {K1, K2, Latin matrix}, add K1 to the phase of the information to be encrypted plain_data to obtain the ciphertext E1; use K2 to multiply the corresponding elements of the ciphertext E1 to obtain the ciphertext E2 ; Finally, according to the element values in the Latin matrix, the ciphertext E2 is transformed accordingly to obtain the final ciphertext E; the key set generation process is as follows:
1)选择一种混沌系统和初始值start_data,生成混沌序列xi;1) Select a chaotic system and initial value start_data to generate chaotic sequence x i ;
2)混沌序列虽然具有长期不可预测特点,但其短期行为具有一定相关性,针对此问题,本文引入Extract函数和拉丁阵,在密钥生成和拉丁阵的构造上进行了创新,做到控制复杂度的前提下,进一步提高安全性;2) Although the chaotic sequence has long-term unpredictable characteristics, its short-term behavior has a certain correlation. To solve this problem, this paper introduces the Extract function and the Latin matrix, and innovates in the key generation and the construction of the Latin matrix to achieve complex control Under the premise of high degree, further improve the security;
Dxi=mod(Extract(xi,12,13,14),256)/512 Dxi = mod(Extract( xi ,12,13,14),256)/512
其中Extract函数为抽取输入值xi小数部分的第12,13,14位数据,以获得密钥良好的不可预测性。根据上式,可得到一组位于[0,0.5]之间的随机数据Dxi,由K1=Dxi×4π和K2=Dxi+0.75得到用于相位旋转的密钥K1(0≤K1≤2π)和幅度变换的密钥K2(0.75≤K2≤1.25);The Extract function is to extract the 12th, 13th, and 14th digits of the decimal part of the input value x i , so as to obtain good unpredictability of the key. According to the above formula, a group of random data D xi between [0, 0.5] can be obtained, and the key K1 for phase rotation can be obtained from K1=D xi ×4π and K2=D xi +0.75 (0≤K1≤ 2π) and the key K2 for amplitude transformation (0.75≤K2≤1.25);
3)为消除数据之间的相关性,对xi进行如下处理得到yi;3) In order to eliminate the correlation between the data, xi is processed as follows to obtain yi ;
yi=106xi-floor(106xi) i=1,2…ny i =10 6 x i -floor(10 6 x i ) i=1,2…n
对yi进行升序排列,得出yi对应序号i的排列信息,即为拉丁阵。拉丁阵主要特点是每一行或者每一列的元素为1到矩阵行数或者列数的随机分布。Arrange y i in ascending order to obtain the arrangement information of y i corresponding to serial number i, which is the Latin matrix. The main feature of the Latin matrix is that the elements of each row or column are randomly distributed from 1 to the number of rows or columns of the matrix.
利用拉丁阵对幅相变换后的坐标信息进行置乱。置乱过程以下面矩阵为例:矩阵A为明文矩阵,矩阵B为拉丁阵,矩阵C为拉丁阵置乱之后的密文。对明文阵A的每个元素而言,拉丁阵B相应元素值为对应元素的变换,如拉丁阵B中B(2,1)=4,则将矩阵A中的A(2,4)元素放入C(2,1),这样依次对各行进行变换,得到密文阵C;The coordinate information after amplitude-phase transformation is scrambled by Latin matrix. The scrambling process takes the following matrix as an example: matrix A is the plaintext matrix, matrix B is the Latin matrix, and matrix C is the ciphertext after the Latin matrix is scrambled. For each element of the plaintext array A, the corresponding element value of the Latin array B is the transformation of the corresponding element, such as B (2,1)=4 in the Latin array B, then the A (2,4) element in the matrix A Put in C(2,1), so that each line is transformed in turn to obtain the ciphertext array C;
待加密明文阵 plaintext array to be encrypted
拉丁矩阵 latin matrix
经拉丁阵加密后的密文阵 Ciphertext matrix encrypted by Latin matrix
S4:对密文E进行并串变换,然后经加插导频、降峰均比、循环前缀,D/A变换等处理,送入无线信道中传输。S4: Carry out parallel-to-serial conversion on the ciphertext E, and then send it to the wireless channel for transmission after processing such as adding pilot frequency, peak-to-average ratio reduction, cyclic prefix, and D/A conversion.
以下是对本发明算法的抗攻击能力进行理论分析:The following is a theoretical analysis of the anti-attack capability of the algorithm of the present invention:
A混沌序列作为密钥的密码学特性测试Cryptographic Characteristic Test of A Chaotic Sequence as Key
混沌序列能够作为密钥,必然要求其满足密码学对密钥的随机性要求。本文采用二值量化方法对生成的混沌序列进行量化,然后进行NIST随机性测试以检验其不可预测性;The chaotic sequence can be used as a key, which must meet the randomness requirements of cryptography for keys. In this paper, the binary quantization method is used to quantify the generated chaotic sequence, and then the NIST randomness test is carried out to test its unpredictability;
NIST测试是由美国国家标准研究院制定的一套包含16项指标的检测随机性的标准。该标准通过不同指标从不同角度对检测序列与理想随机序列进行偏离程度的比较。该标准中的各项指标结果,都是通过一定的测试算法得到各项指标的P-value作为测试结果来体现。P-value∈[0,1],如果P-value≥0.01则通过测试,且P-value越大,被测试序列的伪随机性越好。下表为量化后的混沌密钥序列进行NIST测试结果,本次测试选取其中几个典型指标,可以看到所有的P-value值均符合随机性标准,即由混沌序列生成的密钥满足良好的不可预测性。The NIST test is a set of standards for testing randomness that includes 16 indicators developed by the National Institute of Standards and Technology. This standard compares the degree of deviation between the detection sequence and the ideal random sequence from different angles through different indicators. The results of each indicator in this standard are reflected by the P-value of each indicator obtained through a certain test algorithm as the test result. P-value∈[0,1], if P-value≥0.01, the test is passed, and the larger the P-value, the better the pseudo-randomness of the tested sequence. The following table shows the NIST test results of the quantized chaotic key sequence. This test selects several typical indicators, and it can be seen that all the P-value values meet the randomness standard, that is, the key generated by the chaotic sequence meets the good of unpredictability.
表1混沌序列NIST测试结果Table 1 Chaotic sequence NIST test results
B密钥敏感性分析B key sensitivity analysis
完美的加密算法应该有很强的密钥敏感性,即当窃听者的密钥和合法者密钥存在十分微小的差别时,窃听者也不能恢复出源信息。在本文所提算法中,当合法密钥K1为[1,1,1],Eve密钥为[1,1,1+1×10-14],合法者和窃听者得到的星座图和误比特率对比图分别如附图6,7,8所示,同理可得生成拉丁阵时的密钥精度为10-8。即使密钥差别很小,窃听者也不能得到任何有价值信息,所以密钥具有很强的敏感性;A perfect encryption algorithm should have strong key sensitivity, that is, when the eavesdropper's key is very slightly different from the legal key, the eavesdropper cannot recover the source information. In the algorithm proposed in this paper, when the legal key K1 is [1,1,1], and the Eve key is [1,1,1+1×10 -14 ], the constellation diagram and erroneous Bit rate comparison diagrams are shown in Figures 6, 7, and 8 respectively. Similarly, it can be obtained that the key accuracy when generating the Latin matrix is 10 -8 . Even if the key difference is small, the eavesdropper cannot get any valuable information, so the key has strong sensitivity;
C密钥空间分析(计算量分析)C key space analysis (calculation analysis)
面对暴力攻击(brute-force attack),用于信息加密的密钥应具有足够大的密钥空间。考虑到幅度变换只是混淆星座图形状,而没有改变星座点在复数域所在象限,故幅度变换密钥K2不参与密钥空间分析。假设密钥取值范围为(0,20],当然远不止此范围,在三维洛伦兹混沌序列下,密钥空间为(3×20×108)×(3×20×1014)=3.6×1025。以每秒运行100亿次的计算机为例,若窃听者破译三分之一的信息即认为窃听成功,则破译所需时间为3.8×107年,远远超出可计算时间,可见该算法的密钥空间非常大,故而想要破解密钥是非常困难的;In the face of brute-force attack, the key used for information encryption should have a large enough key space. Considering that the amplitude transformation only confuses the shape of the constellation diagram, but does not change the quadrant where the constellation points are located in the complex domain, the amplitude transformation key K2 does not participate in the key space analysis. Assume that the value range of the key is (0,20], of course it is far beyond this range. Under the three-dimensional Lorentzian chaotic sequence, the key space is (3×20×10 8 )×(3×20×10 14 )= 3.6×10 25 . Taking a computer that operates 10 billion times per second as an example, if the eavesdropper deciphers one-third of the information, the eavesdropping is considered successful, and the time required for deciphering is 3.8×10 7 years, which is far beyond the calculable time , it can be seen that the key space of the algorithm is very large, so it is very difficult to crack the key;
D调制方式识别分析D modulation identification analysis
基于重构星座图的调制识别。k-平均聚类算法是选取聚类中心,非聚类中心对象依据相似程度划分到相似程度最高的聚类中心,再对所有对象取平均值,得到新的聚类中心。依次进行下去,直到测度函数收敛。但由图2所示,经过本加密算法后,星座点在平面范围内,基本符合随机分布,星座点相位信息也无规律性,与已有调制方式的星座模板无法匹配。即不可通过重构星座图来恢复信息。Modulation recognition based on reconstructed constellation diagrams. The k-means clustering algorithm is to select the cluster center, and the non-cluster center objects are divided into the cluster center with the highest similarity according to the similarity degree, and then take the average value of all objects to obtain a new cluster center. Continue in turn until the measure function converges. However, as shown in Figure 2, after this encryption algorithm, the constellation points are within the plane range, which basically conforms to random distribution, and the phase information of the constellation points is also irregular, which cannot match the constellation template of the existing modulation method. That is, the information cannot be recovered by reconstructing the constellation diagram.
基于高阶累积量的调制识别Modulation Recognition Based on Higher Order Cumulants
高阶统计量简记为HOS(Higher order statics),主要用于数字信号调制识别。使用高阶累积量的绝对值,能消除相位抖动的影响;使用其比值作为识别参数,还能消除幅度对参数的影响。相对于瞬时统计量,高阶累积量具有良好的抗衰落特性;与高阶矩相比,它还具有抑制高斯噪声的优点。零均值平稳复随机过程记为y(k),它的p阶混合矩定义为:Higher order statistics are abbreviated as HOS (Higher order statics), which are mainly used for digital signal modulation identification. Using the absolute value of the high-order cumulant can eliminate the influence of phase jitter; using its ratio as the identification parameter can also eliminate the influence of the amplitude on the parameter. Compared with instantaneous statistics, high-order cumulants have good anti-fading properties; compared with high-order moments, they also have the advantage of suppressing Gaussian noise. The zero-mean stationary complex stochastic process is denoted as y(k), and its p-order mixed moment is defined as:
Mpq=E(y(k)(p-q)y*(k)q)M pq = E(y(k) (pq) y * (k) q )
有关累积量的内容,这里给出用到的各阶累积量的定义:Regarding the content of cumulants, here are the definitions of cumulants of each order used:
C20=Cum(y(k),y(k))=M20 C 20 =Cum(y(k),y(k))=M 20
C21=Cum(y(k),y*(k))=M21 C 21 =Cum(y(k),y * (k))=M 21
C40=Cum(y(k),y(k),y(k),y(k))=M40-3(M20)2 C 40 =Cum(y(k),y(k),y(k),y(k))=M 40 -3(M 20 ) 2
在无噪、符号发射等概、平均功率归一化的条件下,求得不同调制方式下,高阶累积量的理论值,如下表所示。为消除相位抖动的影响,使用高阶累积量的绝对值。其中E为信号平均功率;Under the conditions of no noise, equal probability of symbol emission, and normalized average power, the theoretical values of high-order cumulants under different modulation modes are obtained, as shown in the table below. To remove the effect of phase jitter, the absolute value of the higher-order cumulant is used. Where E is the average signal power;
表2高阶累积量的理论值Table 2 Theoretical values of higher order cumulants
利用上表构造MPSK信号特征不变量FM可用于调制方式的识别:Using the above table to construct the MPSK signal characteristic invariant F M can be used to identify the modulation mode:
由式(10)的理论值,可以得出调制方式判决标准,如式(11)所示:From the theoretical value of formula (10), the modulation mode judgment standard can be obtained, as shown in formula (11):
在不同信噪比下,进行500次独立仿真,得出该判决标准下的识别成功率如附图8所示。可以看出,基于高阶累积量的识别调制方式方法能够有效识别不加密的调制方式,信噪比大于4dB时,识别不加密的调制方式,其成功率高达95%以上。而对本算法的识别成功率一直低于5%,可以看出,没有正确密钥的情况下,基于高阶累积量的识别方法不能识别出经过本算法加密后的调制方式。即本文算法具有很强的抗识别优势。Under different signal-to-noise ratios, 500 independent simulations were carried out, and the recognition success rate under this judgment standard is shown in Figure 8. It can be seen that the identification method based on the high-order cumulant can effectively identify the unencrypted modulation mode, and when the signal-to-noise ratio is greater than 4dB, the success rate of identifying the unencrypted modulation mode is as high as 95%. However, the recognition success rate of this algorithm has been lower than 5%. It can be seen that without the correct key, the recognition method based on high-order cumulants cannot recognize the modulation method encrypted by this algorithm. That is to say, the algorithm in this paper has a strong anti-identification advantage.
以下是对图1本发明加密算法流程图的说明:Below is the explanation to Fig. 1 encryption algorithm flowchart of the present invention:
本加密算法是在星座映射后的星座图上进行,通过利用混沌序列和拉丁阵,在复平面对星座图予以变换。充分利用星座映射所带来的冗余信息,以扩充密钥空间,达到安全通信的目的。This encryption algorithm is carried out on the constellation diagram after constellation mapping, and transforms the constellation diagram in the complex plane by using the chaotic sequence and the Latin matrix. Make full use of the redundant information brought by constellation mapping to expand the key space and achieve the purpose of secure communication.
以下是对图2收发两端对应的星座图和图6、7误比特率对比图的分析The following is an analysis of the constellation diagram corresponding to the sending and receiving ends in Figure 2 and the bit error rate comparison chart in Figure 6 and 7
图2一次为合法发送端加密前后,合法接收端和窃听端的星座图。由于混沌系统对初值的敏感性,即设置初始值即使差别很小,经过混沌系统的长期演化,所得到的结果也完全不同。这里窃听者所使用的密钥与正确密钥只有10-14的差异,得到的星座图也完全看不出是哪种调制方式,对应的误比特率也一直在0.5附近。而拥有正确密钥的合法接收端能够很好地恢复出星座信息,误比特率也没有显著恶化,起到很好的加密效果。Figure 2 is a constellation diagram of the legal receiver and the eavesdropping terminal before and after encryption of the legal transmitter. Due to the sensitivity of the chaotic system to the initial value, that is, even if the initial value is set with a small difference, the results obtained after the long-term evolution of the chaotic system are completely different. Here, the key used by the eavesdropper is only 10-14 different from the correct key, and the obtained constellation diagram does not show which modulation method it is, and the corresponding bit error rate is always around 0.5. However, the legal receiver with the correct key can recover the constellation information very well, and the bit error rate does not deteriorate significantly, which plays a very good encryption effect.
图8为利用高阶累积量识别调制方式的成功率对比图。由图可知,经过本算法加密后的信息,基于高阶累积量的识别算法基本失效,识别成功率低于5%,可以认为不能识别出来。FIG. 8 is a comparison chart of the success rate of identifying modulation schemes using high-order cumulants. It can be seen from the figure that the recognition algorithm based on high-order cumulants is basically invalid for the information encrypted by this algorithm, and the recognition success rate is less than 5%, which can be considered as unrecognizable.
以上所述仅为本发明的一种实施方式,本发明并不局限于上述实施方式,在实施过程中可能存在局部微小的结构改动,如果对本发明的各种改动或变型不脱离本发明的精神和范围,且属于本发明的权利要求和等同技术范围之内,则本发明也意图包含这些改动和变型。The above description is only one embodiment of the present invention, the present invention is not limited to the above embodiment, there may be local slight structural changes in the implementation process, if the various changes or modifications of the present invention do not depart from the spirit of the present invention and scope, and belong to the claims and equivalent technical scope of the present invention, the present invention also intends to include these changes and modifications.
Claims (1)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610162614.9A CN105846947B (en) | 2016-03-22 | 2016-03-22 | A kind of encryption in physical layer method introducing Latin battle array |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610162614.9A CN105846947B (en) | 2016-03-22 | 2016-03-22 | A kind of encryption in physical layer method introducing Latin battle array |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105846947A CN105846947A (en) | 2016-08-10 |
CN105846947B true CN105846947B (en) | 2018-11-09 |
Family
ID=56587831
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610162614.9A Active CN105846947B (en) | 2016-03-22 | 2016-03-22 | A kind of encryption in physical layer method introducing Latin battle array |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105846947B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US12256214B2 (en) | 2022-04-14 | 2025-03-18 | Qualcomm Incorporated | Signal modification for control channel physical layer security |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108833390B (en) * | 2018-06-05 | 2021-01-26 | 中国人民解放军国防科技大学 | A Packet Physical Layer Encryption Method Based on Matrix Transformation |
CN108964910B (en) * | 2018-09-17 | 2021-09-17 | 中国人民解放军战略支援部队信息工程大学 | Network time synchronization message secure transmission method and device |
CN109768990B (en) * | 2019-03-04 | 2022-09-16 | 中国人民解放军国防科技大学 | Physical layer secure transmission method based on asymmetric key |
CN109996215A (en) * | 2019-03-31 | 2019-07-09 | 南京信息工程大学 | A kind of multi-path communications method based on privacy sharing under vehicular ad hoc network network environment |
CN109889338A (en) * | 2019-04-22 | 2019-06-14 | 苏州大学 | Quantum encryption method based on chaotic sequence |
CN110336667B (en) * | 2019-07-26 | 2022-04-08 | 电子科技大学 | A communication physical layer encryption communication method and device based on pseudo-random sequence control |
CN111447054B (en) * | 2020-05-28 | 2021-05-14 | 北京邮电大学 | FBMC passive optical network physical layer encryption method and device based on five-dimensional hyperchaos |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1359211A (en) * | 2002-01-10 | 2002-07-17 | 张红雨 | Chaotic encipher series generator |
CN101145901A (en) * | 2007-07-06 | 2008-03-19 | 哈尔滨工程大学 | Hyperchaotic Pseudo-Random Sequence Generator |
CN105120453A (en) * | 2015-07-15 | 2015-12-02 | 中国科学院信息工程研究所 | Secret key generation method |
-
2016
- 2016-03-22 CN CN201610162614.9A patent/CN105846947B/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1359211A (en) * | 2002-01-10 | 2002-07-17 | 张红雨 | Chaotic encipher series generator |
CN101145901A (en) * | 2007-07-06 | 2008-03-19 | 哈尔滨工程大学 | Hyperchaotic Pseudo-Random Sequence Generator |
CN105120453A (en) * | 2015-07-15 | 2015-12-02 | 中国科学院信息工程研究所 | Secret key generation method |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US12256214B2 (en) | 2022-04-14 | 2025-03-18 | Qualcomm Incorporated | Signal modification for control channel physical layer security |
Also Published As
Publication number | Publication date |
---|---|
CN105846947A (en) | 2016-08-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105846947B (en) | A kind of encryption in physical layer method introducing Latin battle array | |
Zebari et al. | Multi-level of DNA encryption technique based on DNA arithmetic and biological operations | |
CN108833390B (en) | A Packet Physical Layer Encryption Method Based on Matrix Transformation | |
Zhou et al. | Quantum proxy signature scheme with public verifiability | |
CN102170350A (en) | Multiple uncertainty encryption system with misleading function | |
Zhang et al. | A novel chaotic image encryption algorithm based on latin square and random shift | |
Kayarkar et al. | A survey on various data hiding techniques and their comparative analysis | |
Noura et al. | Efficient and secure physical encryption scheme for low-power wireless M2M devices | |
Aziz et al. | A Noise‐Tolerant Audio Encryption Framework Designed by the Application of S8 Symmetric Group and Chaotic Systems | |
Peng et al. | A digital image encryption algorithm based on hyper-chaotic cellular neural network | |
Noura et al. | A physical encryption scheme for low-power wireless M2M devices: a dynamic key approach | |
CN118337386A (en) | Network security communication method, storage medium, device and computer program product based on improved enhanced quantum security encryption algorithm | |
Alexan et al. | Social engineering and technical security fusion | |
Sharma et al. | Cryptography Algorithms and approaches used for data security | |
Saran et al. | An improvised algorithm for a dynamic key generation model | |
Singh | An advance cryptosystem using extended polybius square with qwerty pattern | |
Tamimi et al. | A variable circular-shift image-encryption algorithm | |
Rajba et al. | Proof-of-work based new encoding scheme for information hiding purposes | |
Pushpa | Enhancing Data Security by Adapting Network Security and Cryptographic Paradigms | |
Nagaraj et al. | Image security using ECC approach | |
Nagamani et al. | Physical layer security using cross layer authentication for aes-ecdsa algorithm | |
CN109327478B (en) | A secure access method for chaotic physical layer | |
Xing et al. | Enhanced Message Authentication Encryption Scheme Based on Physical-Layer Key Generation in Resource-Limited Internet of Things | |
Abduljabbar et al. | Robust scheme to protect authentication code of message/image documents in cloud computing | |
Abad et al. | Enhanced key generation algorithm of hashing message authentication code |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |