Secure data transmission method for wireless communication system

Abstract

The invention discloses a secure data transmission method for a wireless communication system, which relates to the technical field of secure data transmission and comprises three steps of key generation and synchronization, physical layer subcarrier encryption and key enhancement and authentication. The method comprises the following steps: firstly, extracting multi-dimensional features through channel detection to generate a dynamic initial key, and setting a trigger condition to realize key synchronization; then, a permutation matrix is generated by using a secret key to perform scrambling encryption on a data subcarrier position, and a receiving end performs descrambling and then performs feedback through CRC verification so as to guarantee data integrity; and finally, quantum noise is introduced to enhance the randomness of the secret key, and zero-knowledge authentication is adopted to verify the identity, so that the security and the anti-attack capability of wireless communication data transmission are effectively improved.

Description

Technical Field

[0001] The present invention relates to the technical field of secure data transmission, and in particular to a secure data transmission method for a wireless communication system. Background Art

[0002] With the widespread adoption of 5G / 6G, the Internet of Things, and the Internet of Vehicles (IoV) technologies, wireless communications face severe data security threats. Traditional encryption technologies (such as AES and RSA) rely on static keys or digital certificate systems, with their security heavily focused on algorithm strength and key management. However, the long-term immobility of static keys makes them vulnerable to brute force attacks or side-channel attacks, and the development of quantum computing poses disruptive risks to cryptographic algorithms based on mathematical problems. In high-mobility scenarios (such as vehicle-to-everything (V2X) and drone communications), fixed keys are unable to adapt to the time-varying nature of the channel, leading to a disconnect between encryption mechanisms and the physical environment and creating systemic security weaknesses.

[0003] The current mainstream solutions have the following key bottlenecks: Static key flaw: Once the key is cracked, all past and future communications are completely exposed, and there is no dynamic update mechanism. Algorithm dependency risk: Encryption strength depends entirely on the complexity of the mathematical algorithm, and its ability to resist quantum computing is insufficient; Insufficient utilization of physical layer characteristics: Wireless channels possess temporal and spatial uniqueness (such as multipath phase and frequency-selective fading), but traditional encryption fails to transform these into security resources. While some research has attempted to utilize channel characteristics to generate keys, these efforts suffer from insufficient entropy (e.g., line-of-sight channels) and one-sided feature extraction (using only phase or amplitude), resulting in low randomness and easily predictable keys.

[0004] While existing physical layer security solutions (such as artificial noise and channel modulation) can improve anti-eavesdropping capabilities, they suffer from two major drawbacks: High overhead and low compatibility: Requires hardware architecture modification (such as multi-antenna systems), making deployment on terminal devices difficult. Lack of closed-loop protection: This technology lacks linkage with upper-layer encryption and lacks a self-repair mechanism in the event of key desynchronization. Furthermore, in low-entropy channel environments (such as static indoor scenarios), the randomness of physical layer characteristics decreases dramatically, further weakening security fundamentals. Therefore, a dynamic, cross-layer collaborative, quantum-resistant wireless transmission method is urgently needed to achieve both lightweight and robust performance.

[0005] In order to solve the above-mentioned defects, a technical solution is now provided. Summary of the Invention

[0006] The purpose of the present invention is to solve the existing problems and to provide a method for secure data transmission in a wireless communication system.

[0007] The purpose of the present invention can be achieved through the following technical solutions: A method for securely transmitting data in a wireless communication system, comprising the following steps: B1. Key generation and synchronization: Extract multi-dimensional features through channel detection and generate dynamic initial keys by fusing hashes , and set the time, data volume, and channel change trigger conditions, and use two-way random number encryption confirmation to achieve key synchronization; B2. Physical layer subcarrier randomization scrambling encryption: using key Generate permutation matrix After scrambling the data subcarrier positions, the receiving end performs inverse permutation descrambling and retransmits or resynchronizes the key through CRC check feedback; B3. Key Enhancement and Bidirectional Authentication Mechanism: Introducing Quantum Noise and XOR enhances key randomness, sequence alignment is achieved through a fragment fine-tuning mechanism, and identity is verified based on zero-knowledge authentication with random subcarrier phase bundling.

[0008] Furthermore, the specific process of B1 is as follows: Transmitter A and receiver B execute synchronously, channel detection and feature extraction: A sends a known pilot signal to B, and B calculates the current CSI, including multipath amplitude, phase, and delay; Feature quantization: Extract the N most stable subcarrier components from CSI and convert the phase value Quantify to a preset interval; Multi-dimensional feature fusion: Introducing channel power spectrum density and frequency selectivity, the features are combined with amplitude, phase, and delay information to generate a more comprehensive channel feature vector; Hash summary generation: Input the fused channel feature vector into a lightweight hash function and output a 128-bit initial key seed ; Dynamic key update and synchronization: A key update is triggered when any of the following conditions are met: Channel coherence time expires; The cumulative transmission volume of data packets exceeds the threshold; It is detected that the CSI Euclidean distance exceeds the threshold; Two-way confirmation: A uses the current key Encrypted random number Send to B; B uses local After decryption, use the newly generated encryption return; After A verifies that the response is correct, both parties will enable ; Anti-desynchronization mechanism: If synchronization fails three times in a row, it will fall back to the initial secure channel to renegotiate channel detection parameters.

[0009] Furthermore, the specific operation steps of multi-dimensional feature fusion in B1 are as follows: Channel power spectral density calculation: After receiving the pilot signal at receiver B, it first performs a fast Fourier transform on the signal to convert the time domain signal into a frequency domain signal, obtaining the amplitude and phase information of the signal at different frequency subcarriers. Then, the power value on each frequency subcarrier is calculated; the power spectrum density value corresponding to each subcarrier is obtained by squaring the amplitude on the subcarrier; The PSD values ​​of all subcarriers are combined into a vector, which is recorded as ; Frequency selectivity extraction: Analyze the frequency response characteristics of the channel, calculate the degree of channel fading on different frequency subcarriers, and reflect the frequency selectivity by calculating the amplitude difference between adjacent subcarriers; The frequency selectivity characteristics of all subcarriers are combined into a vector , the length is also M; Fusion with amplitude, phase and delay information: For amplitude information, the amplitude value of each subcarrier is extracted from the CSI to form a vector amp vec ; For phase information, extract the phase value of each subcarrier to form a vector phase vec ; For delay information, extract the multipath delay spread characteristics and calculate the delay value on each subcarrier to form a vector delay vec ; Channel power spectral density , frequency selectivity characteristic vector , amplitude vector amp vec , phase vector phase vec and delay vector delay vec Perform normalization to make the numerical range consistent and normalize them to the interval [0,1]; The normalized eigenvectors are concatenated in order to form a comprehensive channel eigenvector: Comprehensive eigenvector = amp vec ;phase vec ;delay vec .

[0010] Furthermore, the specific operation steps of B2 are as follows: Dynamic scrambling matrix generation: using the current dynamic key Initialize the pseudo-random number generator and generate a Permutation Matrix ; Matrix constraints: Each row and column has only one non-zero element to ensure that there is no aliasing of subcarriers; Data mapping and scrambling: The sender A transforms the data symbol vector to be transmitted With the transformation matrix Multiply on the left to get the scrambled data vector ;in is the scrambled data symbol vector, is the original data symbol vector, is the original data symbol, M is the total number of system subcarriers, and T is the vector transpose operation; After scrambling the data Perform standard OFDM modulation process, including IFFT transformation and adding cyclic prefix; Descrambling at the receiving end: After receiving the signal, B demodulates it through OFDM to obtain ; Using synchronous Compute the inverse permutation: ;in is the estimated value of the restored original data symbol vector, is the permutation matrix The inverse matrix of is an estimated value of the received scrambled data symbol vector; Descrambling verification and feedback: B verifies the integrity of the received data and sends a feedback message to A if the verification fails. A decides whether to retransmit or adjust the encryption strategy based on the feedback. Key error detection: If Asynchronous Error, the symbol constellation diagram after descrambling is abnormal, triggering the key resynchronization process in step 1 to restore communication security.

[0011] Furthermore, the specific operation steps of descrambling verification and feedback in B2 are as follows: After receiving the signal, B obtains the preliminary demodulated data symbol vector through OFDM demodulation; Calculate the inverse permutation using the synchronized permutation matrix to recover the original data symbol vector; Reorganize the descrambled data symbol vector into a data frame format and extract the check code and original data part in the frame; B verifies the integrity of the received data and uses the extracted check code to calculate the original data to check whether the data is complete and accurate; If the verification fails, B immediately sends a feedback message to A, notifying the descrambling failure. The feedback message contains relevant information about the failure, including the failed frame number and error rate estimate. If the verification is successful, B sends a confirmation message to A, indicating that the data has been received correctly; After receiving the feedback message: If it is a descrambling failure feedback, A decides whether to retransmit the data based on the number of failures; if the number of consecutive failures does not exceed the set threshold, A resends the relevant data frame; If the threshold is exceeded, the key resynchronization process is triggered, the key is updated and the relevant data segments are resent; At the same time, A evaluates the effectiveness of the current encryption strategy based on the feedback information. If the descrambling failure is related to the encryption strategy, A adjusts the encryption strategy, including increasing the scrambling strength and optimizing the key update frequency. After receiving the confirmation message, A continues subsequent data transmission to ensure that the encryption and decryption status of both parties are synchronized.

[0012] Furthermore, the specific operation steps of B3 are as follows: Deployment and activation of quantum noise sources: Quantum noise source integration: Both transmitter A and receiver B integrate quantum noise chips to generate true random sequences in real time and ; Entropy enhancement trigger condition: When the phase variance after CSI quantization is lower than the set threshold That is, when it is determined to be a low-entropy environment, the quantum noise injection mechanism is activated to enhance the randomness of the key; Key strengthening and joint generation: Operation on the A side: The initial key seed of step B1 With quantum sequence Bitwise XOR to generate a hardened key: ;in is a bitwise XOR operation used to mix the key and random sequence. for The first 128 bits of the sequence; B-side operation: Perform the same operation synchronously: ; Need to ensure and Probabilistic alignment is achieved through synchronous clock driving; Implement fine-tuning mechanisms to improve quantum sequence consistency; Physical layer zero-knowledge authentication: Authentication trigger: Every time enabled After that, end A randomly selects a subcarrier index i and uses Encrypt i and send it to the B side; Characteristic response: The B end loads the preset characteristic phase on the corresponding subcarrier i and reflects a null data OFDM symbol to end A; Validation: End A detects the phase of subcarrier i of the reflected signal ; If satisfied: , the authentication is successful.

[0013] Furthermore, the specific operation steps of the fine-tuning mechanism in B3 are as follows: use Drive the pseudo-random number generator to generate 16-bit non-continuous position indexes. The formula is: ,from Extract the 16-bit fragment at the corresponding position ; use right Encryption, generate ciphertext ; Through the auxiliary control channel Send to B side; B-side: Sequence decryption, difference fine-tuning and key update: Input: Ciphertext 、 、 、 ; Decryption and positioning: Decryption get ; Using the same PRNG rules, the formula is: ,in, is the position index of the generated quantum sequence fragment, For the initial key seed The result of applying the hash function, For modulo 16 operation, positioning Corresponding 16-bit fragment ; Gap Analysis and Fine-tuning: A Comparison and , count the number of different bits ,Since the trigger condition is that the difference in the first 32 bits is ≤3 bits, the difference in the 16-bit segment is usually ≤2 bits; use The last 8 bits are used as fine-tuning masks and flipped according to the following rules 1 in the middle: If mask is even: flip The rightmost difference bit; If mask is odd: flip The leftmost difference bit; Update quantum sequence and collaborative key: The corresponding 16-bit fragment is replaced with the fine-tuned ; After fine-tuning , re-execute the initial key seed and Bitwise XOR operation to generate a new collaborative key ; Feedback confirmation: calculation Hash digest of , fine-tuning is completed by sending it through the auxiliary control channel To end A; End A: fine-tuning result verification; Input: B-end feedback signal, local analog fine-tuning logic; Simulation fine-tuning verification: A side uses local 、 Simulate B-side operations; Hash check: Comparison with simulated generated Feedback from B-side If they are consistent, the fine-tuning takes effect and the local collaborative key is updated to ; If there is any inconsistency, the fine-tuning process is retriggered and retried up to 2 times. If it still fails, the anti-quantum bias fallback mechanism is executed.

[0014] Compared with the prior art, the present invention has the following beneficial effects: (1) This invention extracts multi-dimensional features (such as channel power spectrum density and frequency selectivity) through channel detection, fuses hashing to generate dynamic initial keys, and sets trigger conditions such as time, data volume, and channel changes to achieve dynamic key updates and synchronization. This eliminates the inherent defects of traditional static keys and effectively resists brute force cracking and side-channel attacks. Especially in highly dynamic channel environments, it can closely follow channel changes and update keys in real time, greatly enhancing key security. At the same time, a two-way confirmation mechanism ensures that the keys of both parties are enabled synchronously, and an anti-desynchronization mechanism ensures link stability, maintaining a secure and reliable communication state even in complex and changing communication environments. (2) The present invention uses a dynamic key generation permutation matrix to perform randomized scrambling encryption on the physical layer subcarriers, achieving encrypted transmission by obfuscating the data position at the physical layer, adding a new line of defense for data security. After descrambling at the receiving end, the CRC check feedback mechanism is used to enable the sending end to promptly obtain the descrambling result, and then quickly decide whether to retransmit or adjust the encryption strategy, thereby ensuring data integrity and optimizing transmission efficiency. The key error detection mechanism can also trigger key resynchronization in a timely manner based on the state of the symbol constellation diagram after descrambling, avoiding continuous errors caused by key asynchrony, and further improving system reliability. (3) This invention introduces a quantum noise source and triggers quantum noise injection in a low-entropy environment. This, combined with bitwise XOR operations, enhances the randomness of the key, effectively resisting quantum computing attacks and addressing the shortcomings of traditional algorithms that rely on mathematical problems. The fragment fine-tuning mechanism enhances the consistency of quantum sequences, ensuring high key coordination between the two parties. The physical layer zero-knowledge authentication mechanism, based on random subcarrier phase binding and leveraging the spatiotemporal uniqueness of wireless channels, achieves strong identity authentication, effectively preventing man-in-the-middle attacks, and building a comprehensive, high-intensity security protection system for wireless communications. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] In order to facilitate understanding by those skilled in the art, the present invention will be further described below with reference to the accompanying drawings; Figure 1 Flow chart of the method of the present invention. DETAILED DESCRIPTION

[0016] The technical solutions of the present invention will be clearly and completely described below with reference to the embodiments. Obviously, the embodiments described are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making any creative efforts shall fall within the scope of protection of the present invention.

[0017] It should be understood that the terms “include” and “comprising” used in the specification and claims of the present disclosure indicate the presence of described features, integers, steps, operations, elements and / or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or collections thereof.

[0018] It should also be understood that the terminology used in this disclosure is for the purpose of describing specific embodiments only and is not intended to limit the disclosure. As used in this disclosure and the claims, the singular forms "a," "an," and "the" are intended to include the plural forms unless the context clearly indicates otherwise. It should be further understood that the term "and / or" as used in this disclosure and the claims refers to any and all possible combinations of one or more of the associated listed items, including and including these combinations.

[0019] like Figure 1 As shown, a method for secure data transmission in a wireless communication system includes the following steps: Step 1: Key generation and synchronization: Extract multi-dimensional features (PSD, frequency selectivity) through channel detection, and fuse hash to generate dynamic initial keys , and set the time, data volume, and channel change trigger conditions, and use two-way random number encryption confirmation to achieve key synchronization; Channel detection and feature extraction (performed synchronously by transmitter A and receiver B): A sends a known pilot signal to receiver B, which calculates the current CSI, including multipath amplitude, phase, and delay. Feature quantization: Extract the N most stable subcarrier components (such as the subcarrier with the smallest amplitude variance) from the CSI and calculate their phase values. Quantize to a preset interval (such as Divided into 256 levels); Multi-dimensional feature fusion: Introducing the channel power spectral density (PSD) and frequency selectivity characteristics, these features are combined with amplitude, phase, and delay information to generate a more comprehensive channel feature vector. The specific process is as follows: Channel Power Spectral Density (PSD) calculation: After receiving the pilot signal at receiver B, it first performs a Fast Fourier Transform (FFT) on the signal to convert the time domain signal into a frequency domain signal. This allows the amplitude and phase information of the signal at different frequency subcarriers to be obtained. Then, calculate the power value on each frequency subcarrier. The power value can be obtained by squaring the amplitude on the subcarrier, that is, power = amplitude². This gives the power spectral density (PSD) value corresponding to each subcarrier; the PSD values ​​of all subcarriers are combined into a vector, which is recorded as For example, if there are M subcarriers, It is a vector of length M, where the i-th element represents the power spectrum density on the i-th subcarrier; Frequency selectivity extraction: Analyze the frequency response characteristics of the channel and calculate the degree of channel fading at different frequency subcarriers. Frequency selectivity can be reflected by calculating the amplitude difference between adjacent subcarriers. Specifically, for the i-th subcarrier, calculate the absolute value of the amplitude difference between it and the adjacent subcarriers (such as the i-1 and i+1 subcarriers) and take the average. The formula is: ,in Represents the frequency selectivity characteristic value of the i-th subcarrier, which is used to quantify the fading degree of the channel on different frequency subcarriers. Indicates the amplitude of the i-th subcarrier; i is the subcarrier index, ranging from 1 to M, where M is the total number of subcarriers in the system; The frequency selectivity characteristics of all subcarriers are combined into a vector , the length is also M; fused with amplitude, phase and delay information: For amplitude information, the amplitude value of each subcarrier is extracted from CSI to form a vector amp vec For phase information, extract the phase value of each subcarrier to form a vector phase vec For delay information, extract the multipath delay spread characteristics and calculate the delay value on each subcarrier to form a vector delay vec .

[0020] Channel power spectral density , frequency selectivity characteristic vector , amplitude vector amp vec , phase vector phase vec and delay vector delay vec Normalize the values ​​to the same range, and normalize them to the interval [0,1]. Concatenate the normalized eigenvectors in order to form a comprehensive channel eigenvector: Comprehensive eigenvector = amp vec ;phase vec ;delay vec (where “;” represents the vector concatenation operation).

[0021] Hash summary generation: Input the fused channel feature vector into a lightweight hash function (such as SHA-256) and output a 128-bit initial key seed .

[0022] Dynamic key update and synchronization: The key update is triggered when any of the following conditions are met: the channel coherence time expires; the cumulative data packet transmission volume exceeds a threshold (such as 1MB); a significant change in CSI is detected (the Euclidean distance exceeds a threshold δ); Two-way confirmation: A uses the current key Encrypted random number Send to B; B uses local After decryption, use the newly generated encryption After A verifies that the response is correct, both parties will start the .

[0023] Anti-desynchronization mechanism: If synchronization fails three times in a row, it will fall back to the initial secure channel to renegotiate channel detection parameters.

[0024] Step 2: Physical layer subcarrier randomization scrambling encryption: using key Generate permutation matrix The data subcarrier positions are scrambled before transmission. The receiving end performs inverse permutation descrambling and retransmits or resynchronizes the key through CRC check feedback. The data positions are obfuscated at the physical layer to achieve encrypted transmission. Combined with the verification mechanism, key desynchronization is prevented and data integrity is guaranteed. Dynamic scrambling matrix generation (using the key from step 1): using the current dynamic key Initialize the pseudo-random number generator (PRNG) to generate a Permutation Matrix (M is the total number of system subcarriers); Matrix constraints: Each row and column has only one non-zero element (value is 1) to ensure that there is no aliasing of subcarriers; Data mapping and scrambling: The sender A transforms the data symbol vector to be transmitted and exchange matrix Multiply on the left to get the scrambled data vector ;in is the scrambled data symbol vector, which is the result of the original data encryption by the sender. is the permutation matrix, is the original data symbol vector, representing the data symbol sequence to be transmitted, is the original data symbol, M is the total number of system subcarriers, T is the vector transpose operation, indicating that S is a column vector; After scrambling the data Perform standard OFDM modulation process (including IFFT transformation, adding cyclic prefix, etc.); Descrambling at the receiving end: After receiving the signal, B demodulates it through OFDM to obtain ; Using synchronous Compute the inverse permutation: ;in is the estimated value of the restored original data symbol vector, which is the result of decryption at the receiving end. is the permutation matrix The inverse matrix of is used to restore the scrambling operation, is the estimated value of the received scrambled data symbol vector, which is the preliminary result after OFDM demodulation; Descrambling verification and feedback: B verifies the integrity of the received data (such as CRC check). If the verification fails, it sends a feedback message to A. A decides whether to retransmit or adjust the encryption strategy based on the feedback. The specific process is as follows: After receiving the signal, B performs OFDM demodulation to obtain a preliminary demodulated data symbol vector. It then uses a synchronized permutation matrix to calculate the inverse permutation and restore the original data symbol vector. It then reconstructs the descrambled data symbol vector into a data frame format and extracts the checksum (e.g., CRC) and the original data from the frame. B verifies the integrity of the received data and uses the extracted check code to calculate the original data to check whether the data is complete and accurate. For example, it uses a CRC check algorithm to calculate the original data, obtains the check result, and compares it with the extracted CRC check code. If verification fails, B immediately sends a feedback message to A, notifying it of the descrambling failure. The feedback message contains relevant information about the failure, such as the failed frame number and error rate estimate. If verification succeeds, B sends a confirmation message to A, indicating that the data was received correctly.

[0025] After A receives the feedback message: If it is a descrambling failure feedback, A decides whether to retransmit the data based on the number of failures; if the number of consecutive failures does not exceed the set threshold (such as 3 times), A resends the relevant data frame; if it exceeds the threshold, the key resynchronization process is triggered, the key is updated and the relevant data segment is resent.

[0026] At the same time, A evaluates the effectiveness of the current encryption strategy based on the feedback. If the descrambling failure is likely related to the encryption strategy (such as key asynchrony or improper encryption algorithm parameter settings), A can adjust the encryption strategy, such as increasing the scrambling strength or optimizing the key update frequency. After receiving the confirmation message, A continues subsequent data transmission to ensure that the encryption and decryption states of both parties are synchronized.

[0027] Key error detection: If Asynchronous Error, the symbol constellation diagram after descrambling is abnormal (BER suddenly increases), triggering the key resynchronization process in step 1 to restore communication security.

[0028] Step 3: Key Enhancement and Bidirectional Authentication Mechanism: Introducing Quantum Noise and XOR enhances key randomness, aligns sequences through a fragment fine-tuning mechanism, and verifies identity based on zero-knowledge authentication using random subcarrier phase binding; it resists security risks in low-entropy environments and quantum hardware deviations, while preventing man-in-the-middle attacks. Deployment and activation of quantum noise sources: Quantum noise source integration: Both transmitter A and receiver B integrate quantum noise chips (such as TRNG based on laser phase fluctuations) to generate true random sequences in real time. and ; Entropy enhancement trigger condition: when the phase variance after CSI quantization is lower than the set threshold When the environment is judged to be low entropy, the quantum noise injection mechanism is activated to enhance the randomness of the key.

[0029] Key strengthening and joint generation: Operation on the A side: The initial key seed of step 1 With quantum sequence Bitwise XOR to generate a hardened key: ;in A bitwise exclusive OR (XOR) operation is used to mix the key and the random sequence. for The first 128 bits of the sequence (index 0 to 127); B-side operation: Perform the same operation synchronously: ; Need to ensure and Probabilistic alignment is achieved through synchronous clock driving.

[0030] To improve the consistency of quantum sequences, the following fine-tuning mechanism is implemented: use Drive the pseudo-random number generator (PRNG) to generate 16-bit non-continuous position index (formula: ),from Extract the 16-bit fragment at the corresponding position ;use right Encryption, generate ciphertext ; Through the auxiliary control channel (independent of the main data channel) Send to end B.

[0031] B-side: Sequence decryption, difference fine-tuning and key update (B-side performs independently): Input: Ciphertext 、 、 、 ; Decryption and positioning: Decryption get ; Using the same PRNG rules (formula: in, The position index of the generated quantum sequence fragment is an integer value (range 0 to 15) used to locate the 16-bit fragment in the quantum sequence. For the initial key seed The result of applying the hash function, For modulo 16 operations, ensure that the index value is in the range of 0-15). Corresponding 16-bit fragment ; Gap Analysis and Fine-tuning: A Comparison and , count the number of different bits ( ), because the trigger condition is that the difference in the first 32 bits is ≤3 bits, and the difference in the 16-bit segment is usually ≤2 bits); use The last 8 bits are used as fine-tuning mask ( ), flip according to the following rules 1 in the middle: If mask is even: flip The rightmost difference bit; if mask is odd: flip Leftmost difference bit; update quantum sequence and collaborative key: Will The corresponding 16-bit fragment is replaced with the fine-tuned ; After fine-tuning , re-execute the "Initial Key Seed and Bitwise XOR operation to generate a new collaborative key ; Feedback confirmation: calculation Hash digest of , send "fine tuning completed" through the auxiliary control channel ” to the A end.

[0032] End A: Fine-tuning result verification (A-end performs independently): Input: B-end feedback signal, local analog fine-tuning logic; Simulation fine-tuning verification: A side uses local 、 Simulate the B-side operation (locate the fragment → flip → generate ); Hash check: Comparison with simulated generated Feedback from B-side If they are consistent, the fine-tuning takes effect and the local collaborative key is updated to If there is any inconsistency, the fine-tuning process is retriggered (retry up to 2 times, and if it still fails, execute the "anti-quantum bias fallback mechanism").

[0033] Physical layer zero-knowledge authentication (performed before scrambling in step 2): Authentication trigger: Every time enabled After that, end A randomly selects a subcarrier index i and uses Encrypt i and send it to the B-end; Characteristic response: The B-end loads the preset characteristic phase on the corresponding subcarrier i (such as π / 4), and reflects a null data OFDM symbol to end A; legitimacy verification: end A detects the phase of subcarrier i of the reflected signal ; If satisfied: , the authentication is successful; this process takes advantage of the fact that the eavesdropper cannot know i and Binding relationship, thereby achieving zero-knowledge authentication.

[0034] The preferred embodiments of the present invention disclosed above are intended only to help illustrate the present invention. These preferred embodiments do not exhaustively describe all details, nor do they limit the present invention to specific embodiments. Obviously, many modifications and variations are possible based on the contents of this specification. These embodiments are selected and described in detail in this specification to better explain the principles and practical applications of the present invention, thereby enabling those skilled in the art to better understand and utilize the present invention. The present invention is limited only by the claims and their full scope and equivalents.

Claims

1. A method for secure data transmission in a wireless communication system, characterized in that: Follow these steps: B1. Key generation and synchronization: Extract multi-dimensional features through channel detection and generate dynamic initial keys by fusing hashes , and set the time, data volume, and channel change trigger conditions, and use two-way random number encryption confirmation to achieve key synchronization; B2. Physical layer subcarrier randomization scrambling encryption: using key Generate permutation matrix After scrambling the data subcarrier positions, the receiving end performs inverse permutation descrambling and retransmits or resynchronizes the key through CRC check feedback; B3. Key Enhancement and Bidirectional Authentication Mechanism: Introducing Quantum Noise and XOR enhances key randomness, sequence alignment is achieved through a fragment fine-tuning mechanism, and identity is verified based on zero-knowledge authentication with random subcarrier phase bundling.

2. A wireless communication system data security transmission method according to claim 1, characterized in that: The specific process of B1 is as follows: Transmitter A and receiver B execute synchronously, channel detection and feature extraction: A sends a known pilot signal to B, and B calculates the current CSI, including multipath amplitude, phase, and delay; Feature quantization: Extract the N most stable subcarrier components from CSI and convert the phase value Quantify to a preset interval; Multi-dimensional feature fusion: Introducing channel power spectrum density and frequency selectivity, the features are combined with amplitude, phase, and delay information to generate a more comprehensive channel feature vector; Hash summary generation: Input the fused channel feature vector into a lightweight hash function and output a 128-bit initial key seed ; Dynamic key update and synchronization: A key update is triggered when any of the following conditions are met: Channel coherence time expires; The cumulative transmission volume of data packets exceeds the threshold; It is detected that the CSI Euclidean distance exceeds the threshold; Two-way confirmation: A uses the current key Encrypted random number Send to B; B uses local After decryption, use the newly generated encryption return; After A verifies that the response is correct, both parties will enable ; Anti-desynchronization mechanism: If synchronization fails three times in a row, it will fall back to the initial secure channel to renegotiate channel detection parameters.

3. A wireless communication system data security transmission method according to claim 2, characterized in that: The specific steps of multi-dimensional feature fusion in B1 are as follows: Channel power spectral density calculation: After receiving the pilot signal at receiver B, it first performs a fast Fourier transform on the signal to convert the time domain signal into a frequency domain signal, obtaining the amplitude and phase information of the signal at different frequency subcarriers. Then, the power value on each frequency subcarrier is calculated; the power spectrum density value corresponding to each subcarrier is obtained by squaring the amplitude on the subcarrier; The PSD values ​​of all subcarriers are combined into a vector, which is recorded as ; Frequency selectivity extraction: Analyze the frequency response characteristics of the channel, calculate the degree of channel fading on different frequency subcarriers, and reflect the frequency selectivity by calculating the amplitude difference between adjacent subcarriers; The frequency selectivity characteristics of all subcarriers are combined into a vector , the length is also M; Fusion with amplitude, phase and delay information: For amplitude information, the amplitude value of each subcarrier is extracted from the CSI to form a vector amp vec ; For phase information, extract the phase value of each subcarrier to form a vector phase vec ; For delay information, extract the multipath delay spread characteristics and calculate the delay value on each subcarrier to form a vector delay vec ; Channel power spectral density , frequency selectivity characteristic vector , amplitude vector amp vec , phase vector phase vec and delay vector delay vec Perform normalization to make the numerical range consistent and normalize them to the interval [0,1]; The normalized eigenvectors are concatenated in order to form a comprehensive channel eigenvector: Comprehensive eigenvector = amp vec ;phase vec ;delay vec .

4. The method for secure data transmission in a wireless communication system according to claim 1, wherein: The specific operation steps of B2 are as follows: Dynamic scrambling matrix generation: using the current dynamic key Initialize the pseudo-random number generator and generate a Permutation Matrix ; Matrix constraints: Each row and column has only one non-zero element to ensure that there is no aliasing of subcarriers; Data mapping and scrambling: The sender A transforms the data symbol vector to be transmitted With the transformation matrix Multiply on the left to get the scrambled data vector ;in is the scrambled data symbol vector, is the original data symbol vector, is the original data symbol, M is the total number of system subcarriers, and T is the vector transpose operation; After scrambling the data Perform standard OFDM modulation process, including IFFT transformation and adding cyclic prefix; Descrambling at the receiving end: After receiving the signal, B demodulates it through OFDM to obtain ; Using synchronous Compute the inverse permutation: ;in is the estimated value of the restored original data symbol vector, is the permutation matrix The inverse matrix of is an estimated value of the received scrambled data symbol vector; Descrambling verification and feedback: B verifies the integrity of the received data and sends a feedback message to A if the verification fails. A decides whether to retransmit or adjust the encryption strategy based on the feedback. Key error detection: If Asynchronous Error, the symbol constellation diagram after descrambling is abnormal, triggering the key resynchronization process in step 1 to restore communication security.

5. A wireless communication system data security transmission method according to claim 4, characterized in that: The specific steps of descrambling verification and feedback in B2 are as follows: After receiving the signal, B obtains the preliminary demodulated data symbol vector through OFDM demodulation; Calculate the inverse permutation using the synchronized permutation matrix to recover the original data symbol vector; Reorganize the descrambled data symbol vector into a data frame format and extract the check code and original data part in the frame; B verifies the integrity of the received data and uses the extracted check code to calculate the original data to check whether the data is complete and accurate; If the verification fails, B immediately sends a feedback message to A, notifying the descrambling failure. The feedback message contains relevant information about the failure, including the failed frame number and error rate estimate. If the verification is successful, B sends a confirmation message to A, indicating that the data has been received correctly; After receiving the feedback message: If it is a descrambling failure feedback, A decides whether to retransmit the data based on the number of failures; If the number of consecutive failures does not exceed the set threshold, A resends the relevant data frame; If the threshold is exceeded, the key resynchronization process is triggered, the key is updated and the relevant data segments are resent; At the same time, A evaluates the effectiveness of the current encryption strategy based on the feedback information. If the descrambling failure is related to the encryption strategy, A adjusts the encryption strategy, including increasing the scrambling strength and optimizing the key update frequency. After receiving the confirmation message, A continues subsequent data transmission to ensure that the encryption and decryption status of both parties are synchronized.

6. A wireless communication system data security transmission method according to claim 1, characterized in that: The specific operation steps of B3 are as follows: Deployment and activation of quantum noise sources: Quantum noise source integration: Both transmitter A and receiver B integrate quantum noise chips to generate true random sequences in real time and ; Entropy enhancement trigger condition: When the phase variance after CSI quantization is lower than the set threshold That is, when it is determined to be a low-entropy environment, the quantum noise injection mechanism is activated to enhance the randomness of the key; Key strengthening and joint generation: Operation on the A side: The initial key seed of step B1 With quantum sequence Bitwise XOR to generate a hardened key: ;in is a bitwise XOR operation used to mix the key and random sequence. for The first 128 bits of the sequence; B-side operation: Perform the same operation synchronously: ; Need to ensure and Probabilistic alignment is achieved through synchronous clock driving; Implement fine-tuning mechanisms to improve quantum sequence consistency; Physical layer zero-knowledge authentication: Authentication trigger: Every time enabled After that, end A randomly selects a subcarrier index i and uses Encrypt i and send it to the B side; Characteristic response: The B end loads the preset characteristic phase on the corresponding subcarrier i and reflects a null data OFDM symbol to end A; Validation: End A detects the phase of subcarrier i of the reflected signal ; If satisfied: , the authentication is successful.

7. A wireless communication system data security transmission method according to claim 6, characterized in that: The specific operation steps of the fine-tuning mechanism in B3 are as follows: use Drive the pseudo-random number generator to generate 16-bit non-continuous position indexes. The formula is: ,from Extract the 16-bit fragment at the corresponding position ; use right Encryption, generate ciphertext ; Through the auxiliary control channel Send to B side; B-side: Sequence decryption, difference fine-tuning and key update: Input: Ciphertext 、 、 、 ; Decryption and positioning: Decryption get ; Using the same PRNG rules, the formula is: ,in, is the position index of the generated quantum sequence fragment, For the initial key seed The result of applying the hash function, For modulo 16 operation, positioning Corresponding 16-bit fragment ; Gap Analysis and Fine-tuning: A Comparison and , count the number of different bits ,Since the trigger condition is that the difference in the first 32 bits is ≤3 bits, the difference in the 16-bit segment is usually ≤2 bits; use The last 8 bits are used as fine-tuning masks and flipped according to the following rules 1 in the middle: If mask is even: flip The rightmost difference bit; If mask is odd: flip The leftmost difference bit; Update quantum sequence and collaborative key: The corresponding 16-bit fragment is replaced with the fine-tuned ; After fine-tuning , re-execute the initial key seed and Bitwise XOR operation to generate a new collaborative key ; Feedback confirmation: calculation Hash digest of , fine-tuning is completed by sending it through the auxiliary control channel To end A; End A: fine-tuning result verification; Input: B-end feedback signal, local analog fine-tuning logic; Simulation fine-tuning verification: A side uses local 、 Simulate B-side operations; Hash check: Comparison with simulated generated Feedback from B-side If they are consistent, the fine-tuning takes effect and the local collaborative key is updated to ; If there is any inconsistency, the fine-tuning process is retriggered and retried up to 2 times. If it still fails, the anti-quantum bias fallback mechanism is executed.

Images