A data security transmission method for a wireless communication system

Abstract

The application discloses a wireless communication system data security transmission method, relates to the technical field of data security transmission, and covers three major steps of key generation and synchronization, physical layer subcarrier encryption and key enhancement and authentication. First, a dynamic initial key is generated by extracting multi-dimensional features through channel detection, and a trigger condition is set to realize key synchronization; then, the data subcarrier position is scrambled and encrypted by using a key generation permutation matrix, and after descrambling at the receiving end, CRC checking feedback is performed to guarantee data integrity; finally, quantum noise is introduced to enhance the randomness of the key, and zero-knowledge authentication is used to verify the identity, so that the security and attack resistance of wireless communication data transmission are effectively improved.

Description

Technical Field

[0001] This invention relates to the field of data security transmission technology, specifically to a method for data security transmission in a wireless communication system. Background Technology

[0002] With the widespread adoption of 5G / 6G, IoT, and V2V technologies, wireless communication faces severe data security threats. Traditional encryption technologies (such as AES and RSA) rely on preset static keys or digital certificate systems, with their security heavily concentrated on algorithm strength and key management. However, static keys, being fixed for a long time, are vulnerable to brute-force attacks or side-channel attacks, and the development of quantum computing poses a disruptive risk to encryption algorithms based on mathematical problems. Especially in highly mobile scenarios (such as V2X and drone communication), fixed keys cannot adapt to the time-varying characteristics of the channel, causing the encryption mechanism to become disconnected from the physical environment, creating a systemic security weakness.

[0003] The current mainstream solutions suffer from the following key bottlenecks:

[0004] Static key limitation: Once the key is cracked, all historical and future communication content is completely exposed, lacking a dynamic update mechanism;

[0005] Algorithm dependency risk: The encryption strength depends entirely on the complexity of the mathematical algorithm, and is insufficient against quantum computing capabilities;

[0006] Insufficient utilization of physical layer characteristics: Wireless channels possess spatiotemporal uniqueness (such as multipath phase and frequency-selective fading), but traditional encryption has not transformed this into a security resource. Although some studies have attempted to generate keys using channel characteristics, problems such as insufficient entropy (e.g., line-of-sight channels) and one-sided feature extraction (using only phase or amplitude) exist, resulting in low key randomness and easy prediction.

[0007] While existing physical layer security solutions (such as artificial noise and channel modulation) can improve resistance to eavesdropping, they have two major drawbacks:

[0008] High overhead and low compatibility: It requires modification of hardware architecture (such as multi-antenna systems) and is difficult to deploy on terminal devices;

[0009] Lack of closed-loop protection: It lacks linkage with upper-layer encryption and has no self-repair mechanism when keys lose synchronization. Furthermore, in low-entropy channel environments (such as static indoor scenarios), the randomness of physical layer characteristics drops sharply, further weakening the security foundation. Therefore, there is an urgent need for a dynamic, cross-layer collaborative, quantum-resistant wireless secure transmission method that achieves a balance between lightweight design and high security.

[0010] To address the aforementioned shortcomings, a technical solution is provided. Summary of the Invention

[0011] The purpose of this invention is to solve existing problems and propose a method for secure data transmission in a wireless communication system.

[0012] The objective of this invention can be achieved through the following technical solutions:

[0013] A method for secure data transmission in a wireless communication system includes the following steps:

[0014] B1. Key Generation and Synchronization: Extracting multi-dimensional features through channel probing and fusing hashing to generate a dynamic initial key. It sets time, data volume, and channel change trigger conditions, and uses bidirectional random number encryption to achieve key synchronization;

[0015] B2. Physical Layer Subcarrier Randomization and Scrambling Encryption: Using a Key Generate permutation matrix After scrambling the data subcarrier positions, the data is transmitted, and the receiving end performs reverse permutation descrambling and retransmits or resynchronizes the key via CRC check feedback.

[0016] B3. Key Enhancement and Two-Way 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.

[0017] Furthermore, the specific process of B1 is as follows:

[0018] Transmitter A and receiver B execute channel sounding and feature extraction synchronously:

[0019] A sends a known pilot signal to B, and B calculates the current CSI, including multipath amplitude, phase, and time delay.

[0020] Feature quantization: Extract the N most stable subcarrier components from the CSI and convert the phase values... Quantize to a preset range;

[0021] Multi-dimensional feature fusion: By introducing channel power spectral density and frequency selectivity characteristics, features are combined with amplitude, phase and time delay information to generate a more comprehensive channel feature vector;

[0022] Hash digest generation: Input the fused channel feature vector into a lightweight hash function to output a 128-bit initial key seed. ;

[0023] Dynamic key update and synchronization:

[0024] A key update is triggered when any of the following conditions are met:

[0025] The channel coherence time has expired;

[0026] The cumulative number of data packets transmitted exceeds the threshold.

[0027] The CSI Euclidean distance was detected to exceed the threshold;

[0028] Two-way confirmation: A uses the current key Encrypted random numbers Send to B;

[0029] B uses local After decryption, use the newly generated encryption Return;

[0030] After verifying the correct response, both parties simultaneously enable [the new system]. ;

[0031] Anti-synchronization mechanism: If synchronization fails three times in a row, the system will fall back to the initial safe channel to renegotiate the channel detection parameters.

[0032] Furthermore, the specific steps for multi-dimensional feature fusion in B1 are as follows:

[0033] Channel power spectral density calculation: After receiving the pilot signal at receiver B, the signal is first subjected to a fast Fourier transform to convert the time domain signal into a frequency domain signal, and the amplitude and phase information of the signal on different frequency subcarriers are obtained.

[0034] Then, the power value on each frequency subcarrier is calculated; the power spectral density value corresponding to each subcarrier is obtained by squaring the amplitude on the subcarrier.

[0035] The PSD values ​​of all subcarriers are combined into a vector, denoted as . ;

[0036] Frequency selectivity characteristic extraction: Analyze the frequency response characteristics of the channel, calculate the fading degree of the channel on different frequency subcarriers, and reflect the frequency selectivity characteristics by calculating the amplitude difference between adjacent subcarriers;

[0037] Combining the frequency selectivity characteristics of all subcarriers into a vector The length is also M;

[0038] Fusion with amplitude, phase, and time delay information:

[0039] For amplitude information, the amplitude values ​​of each subcarrier are extracted from the CSI to form a vector amp. vec ;

[0040] For phase information, the phase value of each subcarrier is extracted to form a vector phase. vec ;

[0041] For delay information, multipath delay spread characteristics are extracted, and the delay values ​​on each subcarrier are calculated to form a vector delay. vec ;

[0042] Channel power spectral density Frequency selectivity characteristic vector Magnitude vector amp vec Phase vector vec and delay vector delay vec Normalization is performed to make the numerical range consistent, all normalized to the [0,1] interval;

[0043] The normalized eigenvectors are concatenated in order to form a comprehensive channel eigenvector: Comprehensive eigenvector = amp vec phase vec delay vec .

[0044] Furthermore, the specific operation steps of B2 are as follows:

[0045] Dynamic scrambling matrix generation: using the current dynamic key Initialize the pseudo-random number generator and generate a Permutation matrix ;

[0046] Matrix constraints: Each row and each column has exactly one non-zero element to ensure that subcarriers are free from aliasing;

[0047] Data mapping and scrambling: Sender A maps the symbol vector of the data to be transmitted. With transformation matrix Left multiplication yields the scrambled data vector. ;in The scrambled data symbol vector, The original data symbol vector, The original data symbols are M, the total number of system subcarriers is M, and T is the vector transpose operation.

[0048] For the scrambled data Perform the standard OFDM modulation process, including IFFT transformation and adding a cyclic prefix;

[0049] Receiver descrambling: After receiving the signal, B demodulates it using OFDM to obtain... ;

[0050] Using synchronization Calculate the inverse permutation: ;in To recover the original data symbol vector estimate, Permutation matrix The inverse matrix, The estimated value of the symbol vector of the received scrambled data;

[0051] Descrambling verification and feedback: B performs integrity verification on the received data. If the verification fails, B sends a feedback message to A. A decides whether to retransmit or adjust the encryption strategy based on the feedback.

[0052] Key error detection: If Asynchrony leads to Error: The descrambled symbol constellation diagram is abnormal, triggering the key resynchronization process in step one to restore communication security.

[0053] Furthermore, the specific steps for descrambling verification and feedback in B2 are as follows:

[0054] After receiving the signal, B obtains the preliminary demodulated data symbol vector through OFDM demodulation;

[0055] The inverse permutation is calculated using the synchronized permutation matrix to recover the original data symbol vector;

[0056] The descrambled data symbol vectors are reassembled into a data frame format, and the checksum and original data portion of the frame are extracted.

[0057] B performs integrity verification on the received data, uses the extracted checksum to calculate the original data, and checks whether the data is complete and accurate.

[0058] If the verification fails, B immediately sends a feedback message to A to notify that the descrambling has failed; the feedback message contains relevant information about the failure, including the sequence number of the failed frame and the error rate estimate.

[0059] If the verification is successful, B sends a confirmation message to A, indicating that the data has been received correctly;

[0060] 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 retransmits the relevant data frame.

[0061] If the threshold is exceeded, the key resynchronization process is triggered to update the key and resend the relevant data segments.

[0062] Meanwhile, 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;

[0063] After receiving the confirmation message, A continues subsequent data transmission to ensure that the encryption and decryption statuses of both parties are synchronized.

[0064] Furthermore, the specific operation steps of B3 are as follows:

[0065] Deployment and activation of quantum noise sources:

[0066] Quantum noise source integration: Both transmitter A and receiver B integrate quantum noise chips to generate truly random sequences in real time. and ;

[0067] Entropy enhancement trigger condition: When the phase variance after CSI quantization is lower than a set threshold. When the environment is determined to be low-entropy, a quantum noise injection mechanism is activated to enhance the randomness of the key;

[0068] Key Strengthening and Joint Generation:

[0069] Operation A: Obtain the initial key seed from step B1. With quantum sequence XOR the bits to generate the enhancement key: ;in This is a bitwise XOR operation used to mix keys and random sequences. for The first 128 bits of the sequence;

[0070] B-end operations: Execute the same operations synchronously: ; It is necessary to ensure and Probabilistic alignment is achieved through synchronous clock driving;

[0071] Implement fine-tuning mechanisms to improve the consistency of quantum sequences;

[0072] Physical layer zero-knowledge certification:

[0073] Authentication triggered: every time it is enabled Then, end A randomly selects a subcarrier index i, and uses... Encrypt i and send it to B;

[0074] Feature response: The B-end loads a preset feature phase on the corresponding subcarrier i. It also reflects an empty data OFDM symbol to end A.

[0075] Validity verification: Terminal A detects the phase of subcarrier i of the reflected signal. ;

[0076] If the following conditions are met: If so, the authentication is successful.

[0077] Furthermore, the specific operational steps of the fine-tuning mechanism in B3 are as follows:

[0078] use Drive the pseudo-random number generator to generate 16-bit non-contiguous position indices, using the following formula: ,from Extract the 16-bit segment at the corresponding position. ;

[0079] use right Encryption, generating ciphertext ; via auxiliary control channel Send to B;

[0080] B-end: Sequence decryption, difference fine-tuning, and key update:

[0081] Input: Ciphertext , , , ;

[0082] Decryption and Location: Using Decryption get ;

[0083] Using the same PRNG rules, the formula is: ,in, For the position index of the generated quantum sequence fragment, For the initial key seed Applying the result of the hash function, For the mold taking 16 operation, positioning The corresponding 16-bit segment ;

[0084] Difference Analysis and Fine-tuning: Comparison and Statistical difference number of positions The trigger condition is that the difference in the first 32 bits is ≤3 bits, while the difference in the 16-bit segment is usually ≤2 bits.

[0085] use The last 8 bits are used as a fine-tuning mask, and are flipped according to the following rules. Middle 1st place:

[0086] If the mask is even: flip. The rightmost difference position;

[0087] If the mask is odd: flip. The leftmost difference position;

[0088] Updating the quantum sequence and co-key: The corresponding 16-bit segment was replaced with the finely adjusted version. ;

[0089] With fine-tuning Re-execute the initial key seed and Bitwise XOR operation to generate a new collaborative key ;

[0090] Feedback confirmation: Calculation hash digest Fine-tuning is completed via auxiliary control channel. To end A;

[0091] A-side: Verification of fine-tuning results;

[0092] Inputs: Feedback signals from the B-end, and local analog fine-tuning logic;

[0093] Simulated fine-tuning verification: A-end uses local... , Simulate B-end operations;

[0094] Hash verification: Compare with simulated hashes Feedback from B-end If they match, the fine-tuning takes effect, and the local collaboration key is updated. ;

[0095] If there is a discrepancy, the fine-tuning process will be retried, with a maximum of 2 retries. If it still fails, the anti-quantum bias rollback mechanism will be executed.

[0096] Compared with the prior art, the beneficial effects of the present invention are:

[0097] (1) This invention extracts multi-dimensional features (such as channel power spectral density and frequency selectivity) through channel detection, generates a dynamic initial key by fusing hashing, and sets trigger conditions such as time, data volume, and channel changes to achieve dynamic key updates and synchronization; it eliminates the inherent defects of traditional static keys, effectively resists brute-force attacks and side-channel attacks, especially in highly dynamic channel environments, it can closely follow channel changes to update the key in real time, greatly enhancing key security. At the same time, the two-way confirmation mechanism ensures that the keys of both parties are activated synchronously, and the anti-out-of-sync mechanism ensures link stability, so that even in complex and ever-changing communication environments, it can maintain a safe and reliable communication state;

[0098] (2) This invention utilizes a dynamic key generation permutation matrix to randomly scramble and encrypt physical layer subcarriers, achieving encrypted transmission from the physical layer's obfuscated data locations, thus adding a new line of defense for data security. Furthermore, after descrambling at the receiving end, a CRC check feedback mechanism enables the sending end to promptly obtain the descrambling result, allowing for a quick decision on whether to retransmit or adjust the encryption strategy, ensuring both data integrity and optimized transmission efficiency. The key error detection mechanism can also trigger key resynchronization in a timely manner based on the descrambling symbol constellation diagram state, avoiding continuous errors caused by key asynchrony and further improving system reliability.

[0099] (3) This invention introduces a quantum noise source and triggers quantum noise injection in a low-entropy environment. Combined with bitwise XOR operations, it enhances key randomness, effectively resists quantum computing attacks, and makes up for the shortcomings of traditional algorithms that rely on mathematical problems. The fragment fine-tuning mechanism improves the consistency of quantum sequences and ensures high coordination between the two parties' keys. The physical layer zero-knowledge authentication mechanism is based on random subcarrier phase binding and utilizes the spatiotemporal uniqueness of the wireless channel to achieve strong identity authentication, effectively preventing man-in-the-middle attacks and building a comprehensive and high-strength security protection system for wireless communication. Attached Figure Description

[0100] To facilitate understanding by those skilled in the art, the present invention will be further described below with reference to the accompanying drawings;

[0101] Figure 1 This is a flowchart of the method of the present invention. Detailed Implementation

[0102] The technical solution of the present invention will be clearly and completely described below with reference to the embodiments. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0103] It should be understood that the terms “comprising” and “including” used in this disclosure and claims indicate the presence of the described features, integrals, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, integrals, steps, operations, elements, components and / or collections thereof.

[0104] It should also be understood that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the scope of this disclosure. As used in this disclosure and claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used in this disclosure and claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes such combinations.

[0105] like Figure 1 As shown, a method for secure data transmission in a wireless communication system includes the following steps:

[0106] Step 1, Key Generation and Synchronization: Extract multi-dimensional features (PSD, frequency selectivity) through channel probing, and generate a dynamic initial key by fusing hashes. It sets time, data volume, and channel change trigger conditions, and uses bidirectional random number encryption to achieve key synchronization;

[0107] Channel detection and feature extraction (executed synchronously by transmitter A and receiver B): A sends a known pilot signal to B, and B calculates the current CSI, including multipath amplitude, phase, and time delay;

[0108] Feature quantization: Extract N most stable subcarrier components (e.g., the subcarrier with the smallest amplitude variance) from the CSI, and measure their phase values. Quantize to a preset range (e.g.) Divided into 256 levels);

[0109] Multi-dimensional feature fusion: By introducing channel power spectral density (PSD) and frequency selectivity characteristics, these features are combined with amplitude, phase, and time delay information to generate a more comprehensive channel feature vector. The specific process is as follows:

[0110] Channel power spectral density (PSD) calculation: After receiving the pilot signal at receiver B, a Fast Fourier Transform (FFT) is first performed on the signal to convert the time-domain signal into a frequency-domain signal. This allows the acquisition of amplitude and phase information of the signal on subcarriers of different frequencies.

[0111] Next, the power value on each frequency subcarrier is calculated. The power value can be obtained by squaring the amplitude on that subcarrier, i.e., power = amplitude². This yields the power spectral density (PSD) value for each subcarrier; the PSD values ​​of all subcarriers are then grouped into a vector, denoted as... For example, if there are M subcarriers, It is a vector of length M, where the i-th element represents the power spectral density on the i-th subcarrier;

[0112] Frequency selectivity characteristic extraction: Analyze the frequency response characteristics of the channel and calculate the fading degree of the channel on 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 its amplitude difference with its adjacent subcarriers (such as the (i-1)-th and (i+1)-th subcarriers) and take the average. The formula is: ,in This represents the frequency selectivity characteristic value of the i-th subcarrier, used to quantify the fading degree of the channel on different frequency subcarriers. This represents 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.

[0113] Combining the frequency selectivity characteristics of all subcarriers into a vector The length is also M; it is fused with amplitude, phase, and time delay information: for amplitude information, the amplitude value of each subcarrier is extracted from CSI to form a vector amp. vec For phase information, the phase values ​​of each subcarrier are extracted to form a phase vector. vec For delay information, multipath delay spread characteristics are extracted, and the delay values ​​on each subcarrier are calculated to form a vector delay. vec .

[0114] Channel power spectral density Frequency selectivity characteristic vector Magnitude vector amp vec Phase vector vec and delay vector delay vec Normalization is performed to ensure a consistent numerical range, all normalized to the [0,1] interval. The normalized eigenvectors are then concatenated sequentially to form a comprehensive channel eigenvector: Comprehensive eigenvector phasor = amp vec phase vec delay vec (Where “;” indicates vector concatenation).

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

[0116] Dynamic key update and synchronization:

[0117] A key update is triggered when any of the following conditions are met: the channel coherence time expires; the cumulative data packet transmission exceeds a threshold (e.g., 1MB); or a significant change in CSI is detected (Euclidean distance exceeds the threshold δ).

[0118] Two-way confirmation: A uses the current key Encrypted random numbers Send to B; B uses local... After decryption, use the newly generated encryption After A verifies the response is correct, both parties simultaneously enable [the new service]. .

[0119] Anti-synchronization mechanism: If synchronization fails three times in a row, the system will fall back to the initial safe channel to renegotiate the channel detection parameters.

[0120] Step 2: Physical layer subcarrier randomization and scrambling encryption: using the key Generate permutation matrix After scrambling the data subcarrier positions, the data is transmitted. The receiving end performs inverse permutation descrambling and retransmits or resynchronizes the key via CRC check feedback. Encrypted transmission is achieved by scrambling the data positions at the physical layer, and a verification mechanism is combined to prevent key loss of synchronization and ensure data integrity.

[0121] Dynamic scrambling matrix generation (using the key from step one): 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);

[0122] Matrix constraints: Each row and each column has exactly one non-zero element (with a value of 1) to ensure that subcarriers are free from aliasing;

[0123] Data mapping and scrambling: Sender A maps the symbol vector of the data to be transmitted. With the change matrix Left multiplication yields the scrambled data vector. ;in This is the scrambled data symbol vector, which is the result of the sender encrypting the original data. Let be the permutation matrix. The original data symbol vector represents the sequence of data symbols to be transmitted. S represents the original data symbols, M represents the total number of system subcarriers, and T represents the vector transpose operation, indicating that S is a column vector.

[0124] For the scrambled data Perform the standard OFDM modulation process (including IFFT transformation, adding a cyclic prefix, etc.);

[0125] Receiver descrambling: After receiving the signal, B demodulates it using OFDM to obtain... ; Utilizing synchronization Calculate the inverse permutation: ;in The estimated value of the recovered original data symbol vector is the result after decryption at the receiving end. Permutation matrix The inverse matrix is ​​used to restore the scrambling operation. The received scrambled data symbol vector estimate is a preliminary result after OFDM demodulation.

[0126] Descrambling Verification and Feedback: B performs integrity verification on 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:

[0127] After receiving the signal, B obtains the preliminary demodulated data symbol vector through OFDM demodulation; it calculates the inverse permutation using the synchronous permutation matrix to recover the original data symbol vector; it reassembles the descrambled data symbol vector into a data frame format and extracts the check code (such as CRC check code) and the original data part from the frame;

[0128] B performs integrity verification on the received data, using the extracted checksum to calculate the original data and check its completeness and accuracy. For example, it uses a CRC checksum algorithm to calculate the original data, obtains the verification result, and compares it with the extracted CRC checksum.

[0129] If verification fails, B immediately sends a feedback message to A, notifying A of the descrambling failure. The feedback message contains relevant information about the failure, such as the sequence number of the failed frame and the estimated error rate. If verification succeeds, B sends an acknowledgment message to A, indicating that the data was received correctly.

[0130] 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 (e.g., 3 times), A retransmits 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 retransmitted.

[0131] Meanwhile, A evaluates the effectiveness of the current encryption strategy based on the feedback information. If descrambling fails, it may be related to the encryption strategy (such as key missynchronization or unreasonable 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.

[0132] Key error detection: If Asynchrony leads to Error: The descrambled symbol constellation diagram is abnormal (BER spikes), triggering the key resynchronization process in step one to restore communication security.

[0133] Step 3, Key Enhancement and Two-Way 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 biases, while preventing man-in-the-middle attacks.

[0134] Deployment and activation of quantum noise sources:

[0135] Quantum noise source integration: Both transmitter A and receiver B integrate quantum noise chips (such as TRNG based on laser phase fluctuations) to generate truly random sequences in real time. and Entropy enhancement trigger condition: When the phase variance after CSI quantization is lower than a set threshold. When the environment is determined to be low-entropy, a quantum noise injection mechanism is activated to enhance the randomness of the key.

[0136] Key Strengthening and Joint Generation:

[0137] Operation A: Use the initial key seed from step one. With quantum sequence XOR the bits to generate the enhancement key: ;in This is a bitwise XOR operation used to mix keys and random sequences. for The first 128 bits of the sequence (index 0 to 127);

[0138] B-end operations: Execute the same operations synchronously: ; It is necessary to ensure and Probabilistic alignment is achieved through synchronous clock driving.

[0139] To improve the consistency of quantum sequences, the following fine-tuning mechanism is implemented:

[0140] use Drive a pseudo-random number generator (PRNG) to generate 16-bit non-contiguous position indices (formula: ),from Extract the 16-bit segment at the corresponding position. ;use right Encryption, generating ciphertext ; via the auxiliary control channel (independent of the main data channel) Send to B.

[0141] B-end: Sequence decryption, difference fine-tuning, and key update (executed independently by the B-end):

[0142] Input: Ciphertext , , , ;

[0143] Decryption and Location: Using Decryption get ;

[0144] Using the same PRNG rules (formula: in, The index for the generated quantum sequence fragment position is an integer value (ranging from 0 to 15) used to locate a 16-bit fragment within the quantum sequence. For the initial key seed Applying the result of the hash function, For modulo 16 operations, ensure the index value is within the range of 0-15; positioning. The corresponding 16-bit segment ;

[0145] Difference Analysis and Fine-tuning: Comparison and Statistical difference number of positions ( (This is because the trigger condition is a difference of ≤3 bits in the first 32 bits, while a difference in a 16-bit segment is usually ≤2 bits). The last 8 bits are used as a fine-tuning mask. Flip according to the following rules Middle 1st place:

[0146] If the mask is even: flip. The rightmost difference bit; if the mask is odd: flip. Leftmost difference bit; Update quantum sequence and cooperative key:

[0147] Will The corresponding 16-bit segment was replaced with the finely adjusted version. ; with fine-tuning Re-execute the "initial key seed" and A bitwise XOR operation is used to generate a new collaborative key. ;

[0148] Feedback confirmation: Calculation hash digest The message "Fine-tuning complete" is sent via the auxiliary control channel. "To end A."

[0149] A-side: Fine-tuning result verification (executed independently by A-side):

[0150] Inputs: Feedback signals from the B-end, and local analog fine-tuning logic;

[0151] Simulated fine-tuning verification: A-end uses local... , Simulate B-end operation (locate segment → flip → generate) );

[0152] Hash verification: Compare with simulated hashes Feedback from B-end If they match, the fine-tuning takes effect, and the local collaboration key is updated. If there is a discrepancy, the fine-tuning process will be retried (up to 2 retries; if it still fails, the "anti-quantum bias rollback mechanism" will be executed).

[0153] Physical layer zero-knowledge authentication (executed before scrambling in step two):

[0154] Authentication triggered: every time it is enabled Then, end A randomly selects a subcarrier index i, and uses... Encrypt subcarrier i and send it to terminal B; Feature response: Terminal B loads a preset feature phase on the corresponding subcarrier i. (e.g., π / 4), and reflect an empty data OFDM symbol to terminal A; Validity verification: Terminal A detects the phase of subcarrier i of the reflected signal. ;

[0155] If the following conditions are met: If the information is true, then the authentication is successful; this process takes advantage of the fact that the eavesdropper cannot know the relationship between i and... This establishes a binding relationship, thereby enabling zero-knowledge authentication.

[0156] The preferred embodiments of the present invention disclosed above are merely illustrative of the invention. These preferred embodiments do not exhaustively describe all details, nor do they limit the invention to specific implementations. Clearly, many modifications and variations can be made based on the content of this specification. This specification selects and specifically describes these embodiments to better explain the principles and practical applications of the invention, thereby enabling those skilled in the art to better understand and utilize the invention. The invention is limited only by the claims and their full scope and equivalents.

Claims

1. A data security transmission method for a wireless communication system, characterized by, Comprising the following steps: B1, key generation and synchronization: through channel detection to extract multi-dimensional features, and fuse hash to generate dynamic initial key seed And set time, data volume, channel change trigger condition for triggering dynamic key update, and use two-way random number encryption confirmation to realize key synchronization; B2, physical layer subcarrier randomization scrambling encryption: use the current dynamic key Generating permutation matrix After scrambling the data subcarrier position, the receiving end inversely permutes and descrambles and feeds back retransmission or key resynchronization through CRC check. Specifically, after inversely permuting and descrambling, the receiving end verifies data integrity using CRC check code; if the verification is successful, it feeds back a confirmation message, and if the verification fails, it feeds back a failure message containing the frame sequence number and error rate, and the sending end decides to retransmit data or triggers key resynchronization according to the number of consecutive failures; B3, Key enhancement and two-way authentication mechanism: introduce quantum noise and XOR enhances key randomness, aligns sequences through segment fine-tuning mechanism, and verifies identity based on zero-knowledge authentication of random subcarrier phase binding; The specific operation steps of B3 are as follows: Deployment and activation of quantum noise source: Quantum noise source integration: both the sending end A and the receiving end B integrate quantum noise chips to generate true random sequences in real time and ; Entropy enhancement trigger condition: when the phase variance of the quantized CSI is lower than a set threshold When the low-entropy environment is determined, the quantum noise injection mechanism is started to enhance the randomness of the key. Key reinforcement and joint generation: A-side operation: XOR the initial key seed of step B1 with the quantum sequence bitwise XOR, generating the hardened key: ; where is a bitwise XOR operation used to mix the key and the random sequence, is the first 128 bits of the sequence; B side operation: same operation is executed synchronously: ; make sure and Probability alignment is achieved by synchronous clock driving; Perform fine-tuning mechanism to improve quantum sequence consistency; Physical layer zero-knowledge authentication: Authentication trigger: each time enable After that, A end randomly selects a sub-carrier i, uses Encrypts i and sends to B end; Feature response: B side loads preset feature phase on corresponding subcarrier i and reflects an empty data OFDM symbol to A side; Legitimacy verification: A end detects the phase of the subcarrier i of the reflected signal ; If the following is satisfied: then the authentication is passed.

2. The method of claim 1, wherein the method further comprises: The specific process of B1 is as follows: The sending end A and the receiving end B are synchronized to perform channel sounding and feature extraction: A sends a known pilot signal to B, and B calculates the current CSI, including multipath amplitude, phase, and time delay; Feature quantization: extract N most stable subcarrier components from CSI, quantize phase values to preset intervals ; Multi-dimensional feature fusion: Introduce channel power spectral density and frequency selectivity characteristics, combine features with amplitude, phase, and time delay information to generate a more comprehensive channel feature vector; Hash digest generation: input the fused channel feature vector into a lightweight hash function, output a 128-bit initial key seed ; Dynamic key update and synchronization: When any of the following conditions is met, trigger key update: Channel coherence time expires; The cumulative transmission volume of data packets exceeds the threshold; Detect that the CSI Euclidean distance exceeds the threshold; Two-way authentication: A with current key Encrypted random number Sent to B; B with local After decryption, use the newly generated Encryption Backhaul; After the verification response is correct, both sides enable synchronization ; Anti-out-of-sync mechanism: If synchronization fails for 3 consecutive times, fall back to the initial secure channel to renegotiate channel sounding parameters.

3. The method of claim 2, wherein the data security transmission method of a wireless communication system is characterized by, 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 the receiving end B, first perform fast Fourier transform on the signal to convert the time domain signal to the frequency domain signal, obtaining the amplitude and phase information of the signal at different frequency subcarriers; Then, calculate the power value at each frequency subcarrier; by squaring the amplitude on the subcarrier, obtain the power spectral density value corresponding to each subcarrier; The power spectral density values PSD of all subcarriers are grouped into a vector, denoted as ; Frequency selectivity characteristic extraction: analyze the frequency response characteristics of the channel, calculate the fading degree of the channel at different frequency subcarriers, and reflect the frequency selectivity characteristics by calculating the amplitude difference between adjacent subcarriers; The frequency selective characteristic values of all subcarriers are grouped into a vector with length M, M being the total number of subcarriers of the system; Fusion with amplitude, phase, and time delay information: For the amplitude information, the set of amplitude values for each subcarrier is extracted from the CSI to form a vector amp vec ; For the phase information, the phase values of each subcarrier are extracted to form a vector phase vec ; For the delay information, the multipath delay spread characteristics are extracted, and a delay value vector delay is calculated for each subcarrier vec ; The channel power spectral density , the frequency selective characteristic vector , the amplitude vector amp vec , the phase vector phase vec , and the delay vector delay vec are normalized to have the same value range, all normalized to the interval [0, 1]. The normalized feature vectors are spliced in order to form a comprehensive channel feature vector: comprehensive feature phasor amp vec ; phase vec ; delay vec .

4. The method of claim 1, wherein the method further comprises: The specific operation steps of B2 are as follows: Dynamic permutation matrix generation: use current dynamic key Initialize pseudo-random number generator, generate one Permutation matrix ; Matrix constraints: Each row and each column has and only has one non-zero element, ensuring subcarrier aliasing-free; Data mapping and scrambling: the sending end A maps the to-be-transmitted data symbol vector and the permutation matrix left multiplication, to obtain the scrambled data vector ; wherein 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 transposition operation; data after permutation performing a standard OFDM modulation procedure, including IFFT transform, adding a cyclic prefix; Receiving end descrambling: After B receives the signal, it gets ; with synchronization Computing the inverse permutation: ; where is the recovered original data symbol vector estimate, is the inverse of the permutation matrix , and is the received scrambled data symbol vector estimate; Decryption verification and feedback: B verifies the integrity of the received data, and sends feedback messages to A if the verification fails; A decides whether to retransmit or adjust the encryption strategy according to the feedback; Key error detection: if Out of sync causes Error, abnormal post-descrambling symbol constellation, triggers key resynchronization process to restore communication security.

5. The method of claim 4, wherein the data security transmission method of a wireless communication system is characterized by, The specific operation steps of decryption 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 restore the original data symbol vector; Reorganize the demodulated 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, calculates the original data using the extracted check code, and checks whether the data is complete and accurate; If the verification fails, B immediately sends a feedback message to A, indicating that the decryption fails; the feedback message contains relevant information about the failure, including the frame number and error rate estimate; If the verification is successful, B sends a confirmation message to A, indicating that the data is correctly received; After receiving the feedback message, A decides whether to retransmit the data according to the number of failures if the feedback is a decryption failure; If the number of consecutive failures does not exceed the set threshold, A retransmits the relevant data frames; If the threshold is exceeded, trigger the key resynchronization process, update the key and retransmit the relevant data segment; At the same time, A evaluates the effectiveness of the current encryption strategy according to the feedback information; if the decryption failure is related to the encryption strategy, A adjusts the encryption strategy, including enhancing the scrambling strength and optimizing the key update frequency; A receives the confirmation message, continues the subsequent data transmission, and ensures that the encryption and decryption states of both parties are synchronized.

6. The method of claim 1, wherein the method further comprises: The specific operation steps of the fine-tuning mechanism in B3 are as follows: With drive the pseudo-random number generator to generate a 16-bit non-continuous position index, formula: , extract the 16-bit segment of the corresponding position from ;​ Use To Encrypt, generate ciphertext ; send to B through auxiliary control channel ; B side: sequence decryption, differential fine-tuning, and key update: Input: ciphertext , , , ; Decipherment and localization: with Decipherment Obtaining ; With the same pseudo-random number generator rule, formula: wherein, is the generated quantum sequence segment position index, is the initial key seed to which the hash function is applied, is the modulo 16 operation, locating the corresponding 16-bit segment in ; Difference analysis and fine-tuning: comparison With , the number of statistical difference bits , the trigger condition is that the difference in the first 32 bits is ≤ 3 bits, and the difference in the 16-bit segment is ≤ 2 bits; Use the last 8 bits of the 32-bit value as a fine-tune mask, flipping the bits in the following rule 1 bit in the middle:​ If mask is even: flip Rightmost differing bit; If mask is odd: flip Leftmost differing bit; Updating quantum sequence and cooperative key: Will In the middle of the 16-bit segment replaced by fine-tuned ; with the fine-tuned , re-executes the initial key seed and bit XOR operation, generating a new collaborative key ; Feedback Acknowledgement: Compute Hash Digest of Fine Completion and to A side; A side: fine-tuning result verification; Input: B side feedback signal, local analog fine-tuning logic; Analog trim verification: A side operates with local , B side analog trim verification. Hash check: compare with simulation generated B-end feedback If consistent, fine-tune takes effect, update local collaborative key to ; If not consistent, re-trigger the fine-tuning process, with a maximum of 2 retries, and if still failed, execute the anti-quantum bias fallback mechanism.

Images