A wireless data security transmission method and device based on time stamp random permutation

Abstract

The application relates to the technical field of wireless data transmission, in particular to a wireless data security transmission method and device based on time stamp random permutation. The application obtains a current time stamp value in a logical frame to be replaced, then generates a pseudo-random seed according to the time stamp value and a preset constant set. The pseudo-random seed is used to drive a pseudo-random number generator, and a permutation sequence is generated by combining a shuffling algorithm. According to the permutation sequence, message fields in the logical frame to be replaced, except for a frame header and a time stamp field, are permuted to obtain a permuted logical frame. The application uses a time stamp value of full-network synchronization as a pseudo-random seed at a sending end, so that a permutation sequence is dynamically generated to obtain a time stamp random permutation logical frame, and lightweight data security transmission is realized. At a receiving end, the same algorithm is used to generate the same permutation sequence as that at the sending end, and the disturbed data is inversely recombined to recover original data, so that low-delay and low-overhead data link layer security communication is realized.

Description

Technical Field

[0001] This application relates to the field of wireless data transmission technology, and in particular to a method and apparatus for secure wireless data transmission based on timestamp random scrambling. Background Technology

[0002] In scenarios such as Wireless Networks for Industrial Automation (WIA-FA) and the Internet of Things (IoT), wireless LANs need to transmit critical control commands and sensitive data. Currently, traditional data security mechanisms mainly rely on high-level security protocols or MAC-level security protocols (such as WPA2, WPA3, and other encryption technologies). While these methods offer high security strength, their computational complexity is high, introducing significant processing latency and additional power consumption, making it difficult to meet the stringent requirements of low-latency, high-real-time industrial applications.

[0003] Therefore, there is an urgent need for a new type of wireless data transmission method that can effectively resist eavesdropping and data parsing while maintaining low latency and low computational overhead, thus ensuring the confidentiality and real-time nature of communication. Summary of the Invention

[0004] This application provides a wireless data security transmission method and apparatus based on timestamp random scrambling, which can effectively prevent wireless data from being eavesdropped and analyzed, and can maintain a low-latency and low-computational-overhead wireless data transmission method.

[0005] This application provides a secure wireless data transmission method based on timestamp randomization, which is based on a time-division multiple access clock-synchronized wireless local area network. The method can be applied to any transmitting end. The secure wireless data transmission method based on timestamp randomization includes:

[0006] Get the current timestamp value in the timestamp field of the logical frame to be replaced;

[0007] A pseudo-random seed is generated based on the timestamp value and a preset set of constants, where the preset set of constants includes: seed constant, multiplier, increment, modulus and total number of message fields;

[0008] A pseudo-random number generator is driven by a pseudo-random seed and combined with a shuffling algorithm to generate a permutation sequence;

[0009] According to the permutation sequence, the message fields in the logical frame to be permuted, except for the frame header and timestamp fields, are permuted to obtain the permuted logical frame and then the permuted logical frame is sent.

[0010] In one embodiment, before the step of obtaining the current timestamp value in the timestamp field of the logical frame to be replaced, the method further includes:

[0011] The gateway or AC controller serves as the sole clock source for the wireless local area network, enabling clock synchronization.

[0012] When there is no gateway or AC controller in the network, a uniquely designated wireless access point is selected as the clock source for clock synchronization.

[0013] In one embodiment, the step of generating a pseudo-random seed based on a timestamp value and a preset set of constants includes:

[0014] Perform a bitwise XOR operation between the timestamp value and a preset constant to obtain a pseudo-random seed.

[0015] In one embodiment, a pseudo-random number generator is driven by a pseudo-random seed, and a permutation sequence generation step is performed in conjunction with a shuffling algorithm, including:

[0016] Generate an initial index array, which is used to represent the original field order, where the index represents the original field position and the value represents the field number at that position;

[0017] The initial index array is iteratively shuffled using the Fisher-Yates shuffle algorithm to obtain the shuffled index array.

[0018] Based on the shuffled index array, the message fields in the logical frame to be replaced are rearranged.

[0019] In one embodiment, the step of performing an iterative shuffling operation using the Fisher-Yates shuffling algorithm on the initial index array to obtain the shuffled index array includes:

[0020] Set a loop variable i, which starts from N-1 and decreases to 1 to execute the loop, where N is the total number of message fields;

[0021] The permutation index j is obtained by taking the modulo of the current pseudo-random seed value with the loop variable (i + 1);

[0022] Swap the elements at position i and position j in the initial index array;

[0023] Update the pseudo-random seed value for the next iteration;

[0024] After the loop ends, you get a shuffled array of indices.

[0025] This application provides another method for secure wireless data transmission based on timestamp randomization, which is based on a time-division multiple access clock-synchronized wireless local area network. The method can be applied to any receiving end. The secure wireless data transmission method based on timestamp randomization includes:

[0026] Get the timestamp value in the timestamp field of the replaced logical frame, where the timestamp value is the hardware-level timestamp value added by the sender to the timestamp field of the replaced logical frame when sending the replaced logical frame;

[0027] A pseudo-random seed is generated based on the timestamp value and a preset set of constants;

[0028] A pseudo-random number generator is driven by a pseudo-random seed and combined with a shuffling algorithm to generate a permutation sequence consistent with the sending end.

[0029] Based on the inverse sequence of the permutation sequence, the message fields of the permuted logical frame are reassembled to obtain the reassembled logical frame, which is the original logical frame.

[0030] In one embodiment, a wireless data secure transmission method based on timestamp random scrambling is characterized by further comprising:

[0031] Perform cyclic redundancy check on the reassembled logic frame;

[0032] If the verification passes, the reassembled logic frame is submitted to the upper-layer protocol.

[0033] In one embodiment, the logical frame replacement and reassembly process is only effective within the same time slot of time division multiple access;

[0034] Each time slot corresponds to a unique permutation sequence;

[0035] At the time slot boundary, the receiver is configured to simultaneously attempt to reassemble the message fields of the permuted logical frame using the permutations corresponding to the current time slot and the previous time slot.

[0036] This application also provides a wireless data security transmission device based on timestamp random scrambling, based on a time-division multiple access clock-synchronized wireless local area network. The wireless data security transmission device based on timestamp random scrambling is deployed at any transmitting end, and includes:

[0037] The first acquisition unit is used to acquire the current timestamp value in the timestamp field of the logical frame to be replaced;

[0038] The first pseudo-random seed generation unit is used to generate a pseudo-random seed based on the timestamp value and a preset constant set, wherein the preset constant set includes: seed constant, multiplier, increment, modulus and total number of message fields;

[0039] The first permutation sequence generation unit is used to drive a pseudo-random number generator with a pseudo-random seed and combine it with a shuffle algorithm to generate a permutation sequence.

[0040] The permutation unit is used to permutate the message fields in the logical frame to be permuted, excluding the frame header and timestamp fields, according to the permutation sequence, to obtain the permuted logical frame and send the permuted logical frame.

[0041] This application also provides another wireless data security transmission device based on timestamp random scrambling, based on a time division multiple access clock-synchronized wireless local area network. The wireless data security transmission device based on timestamp random scrambling is deployed at any receiving end, and includes:

[0042] The second acquisition unit acquires the timestamp value in the timestamp field of the replaced logical frame, wherein the timestamp value is the hardware-level timestamp value added by the sender to the timestamp field of the replaced logical frame when sending the replaced logical frame;

[0043] The second pseudo-random seed generation unit is used to generate pseudo-random seeds based on timestamp values ​​and a preset set of constants.

[0044] The second permutation sequence generation unit is used to drive a pseudo-random number generator with a pseudo-random seed and combine it with a shuffling algorithm to generate a permutation sequence consistent with the sending end.

[0045] The reassembly unit is used to reassemble the message fields of the permuted logical frame according to the inverse sequence of the permutation sequence to obtain a reassembled logical frame, which is the original logical frame.

[0046] This application describes a wireless data security transmission method based on timestamp random scrambling. The method involves obtaining the current timestamp value in the timestamp field of the logical frame to be replaced, and then generating a pseudo-random seed based on the timestamp value and a preset constant set. The pseudo-random seed drives a pseudo-random number generator, which, combined with a shuffling algorithm, generates a permutation sequence. Based on this permutation sequence, all message fields in the logical frame to be replaced, except for the frame header and timestamp fields, are permuted to obtain the replaced logical frame. Traditional data security relies primarily on higher-layer security or MAC-layer security protocols, introducing significant processing latency and additional power consumption, making it difficult to meet the stringent requirements of low-latency, high-real-time industrial applications. This application addresses this by using network-wide synchronized timestamp values ​​as a pseudo-random seed at the transmitting end to dynamically generate a permutation sequence, resulting in a timestamp-randomized logical frame, thus achieving lightweight data security transmission. At the receiving end, the same algorithm generates the same permutation sequence as at the transmitting end. The scrambled data is then reverse-engineered to restore the original data, achieving low-latency, low-overhead data link layer secure communication. This significantly increases the difficulty of eavesdropping and replay attacks, effectively solving the problems in related technologies. Attached Figure Description

[0047] To more clearly illustrate the technical solutions in this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0048] Figure 1 This is an application scenario diagram illustrating a wireless data security transmission method based on timestamp random scrambling, as shown in one embodiment of this application.

[0049] Figure 2 This is a flowchart illustrating a wireless data security transmission method based on timestamp random scrambling, as shown in one embodiment of this application. Detailed Implementation

[0050] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0051] Traditional solutions rely on computationally complex encryption algorithms, introducing significant processing latency and power consumption, becoming a bottleneck in scenarios with high real-time requirements. This application fundamentally overcomes this limitation by achieving near-zero latency secure processing through an innovative lightweight dynamic permutation mechanism. Its core advantage lies in creatively utilizing the inherent global clock synchronization characteristics of TDMA networks, transforming timestamp values ​​into a dynamic random source driving the security mechanism, thereby eliminating the enormous computational overhead required for traditional encryption and decryption. This not only significantly reduces device power consumption, enabling efficient operation on resource-constrained IoT terminals, but also achieves deep and seamless integration with the communication protocol layer, eliminating the need for an additional secure synchronization mechanism.

[0052] Furthermore, the permutation sequence of each logical frame in this application is uniquely generated from the current timestamp value, achieving protection by generating a unique scrambling scheme for each logical frame. This effectively resists replay attacks and greatly increases the difficulty of eavesdropping and parsing the data stream. Simultaneously, this mechanism can be implemented at the MAC layer or physical layer, remaining completely transparent to upper-layer applications and providing a more fundamental and universal security guarantee. In summary, this invention successfully solves the fundamental contradiction of existing technologies being difficult to apply in high real-time, low-power scenarios while ensuring high performance and security. The following section will detail the method of this application using a time-division multiple access-based clock synchronization wireless local area network, with the method applied to any transmitting end, as an example.

[0053] Figure 1 This is a flowchart illustrating a wireless data security transmission method based on timestamp random scrambling, as shown in one embodiment of this application. (Refer to...) Figure 1 and Figure 2 The method of this application may include:

[0054] Step 101: Obtain the current timestamp value in the timestamp field of the logical frame to be replaced.

[0055] The logical frame includes: a frame header, a timestamp field, a source address, a destination address, a reserved space, a sequence number, a function code, a data length, a data payload, and a CRC check field, as shown in Table 1, the original logical frame structure. The timestamp field is a dedicated field for storing a high-precision global synchronization timestamp value. This field's position within the frame remains fixed, and its content is not involved in subsequent permutation / scrambling operations. The frame header and timestamp field maintain fixed positions and do not participate in permutation / scrambling, serving as seed references for permutation and reassembly. The device obtains the current precise time value from a hardware clock synchronized with the global clock source and writes this value as the current timestamp value into the fixed-position timestamp field within the logical frame. This operation is typically performed at the data link layer by hardware or a lower-level driver to ensure the accuracy and real-time performance of the timestamp.

[0056] Table 1 Original Logical Frame Structure

[0057]

[0058] Step 102: Generate a pseudo-random seed based on the timestamp value and a preset constant set, wherein the preset constant set includes: seed constant, multiplier, increment, modulus and total number of message fields.

[0059] Specifically, after obtaining the current timestamp value, the device performs a mixing operation with a seed constant from a preset set of constants to generate an initial pseudo-random seed. A preferred and efficient implementation of the mixing operation is the bitwise XOR (exclusive OR) operation.

[0060] Step 103: Use a pseudo-random seed to drive a pseudo-random number generator and combine it with a shuffle algorithm to generate a permutation sequence.

[0061] Specifically, the device uses a pseudo-random seed to drive a pseudo-random number generator, producing a completely random and unpredictable permutation sequence that defines the final order of message fields. This scheme employs an efficient method combining a lightweight pseudo-random number generator (PRNG) with the Fisher-Yates shuffle algorithm, ensuring the generation of high-quality random permutations with extremely low computational overhead.

[0062] Step 104: According to the permutation sequence, permutate the message fields in the logical frame to be permuted, except for the frame header and timestamp fields, to obtain the permuted logical frame and send the permuted logical frame.

[0063] Specifically, the wireless data security transmission device based on timestamp randomization rearranges the message fields of the logical frame to be replaced according to the replacement sequence generated in step 103. After the above steps, the transmission buffer stores a complete replaced logical frame. The frame header and timestamp fields remain unchanged, while the order of the message fields (including possible CRC fields) has been randomized, as shown in Table 2, which shows the structure of the replaced logical frame. The device calls the underlying transmitter to encapsulate the assembled replaced logical frame into a data packet conforming to the physical layer protocol (e.g., adding a preamble, SFD, etc.), keeping the frame header and timestamp fields unchanged, and broadcasts or sends it to the designated receiver via the radio channel.

[0064] Table 2. Structure of the logical frame after replacement

[0065]

[0066] In this embodiment, a wireless data security transmission device based on timestamp random scrambling dynamically generates a permutation sequence at the transmitting end to obtain a logical frame with randomly scrambled timestamps, achieving lightweight data security transmission. At the receiving end, the same algorithm is used to generate the same permutation sequence as at the transmitting end, and the scrambled data is reverse-engineered to restore the original data. This achieves low-latency, low-overhead data link layer secure communication, significantly increasing the difficulty of eavesdropping and replay attacks, and effectively solving problems in related technologies.

[0067] In one embodiment, before obtaining the current timestamp value in the timestamp field of the logic frame to be replaced, the method further includes: using a gateway or AC controller as the sole clock source for the wireless local area network to perform clock synchronization; when there is no gateway or AC controller in the network, a uniquely designated wireless access point is selected as the clock source for clock synchronization.

[0068] Specifically, the gateway or access controller serves as the sole clock source for the entire wireless LAN. In this centralized network architecture, the gateway / AC controller naturally acts as the central control node, responsible for managing time slot allocation and clock synchronization. All station devices, including access points (APs) and terminal devices (STAs), calibrate their local clocks by receiving synchronization beacon frames or specific clock synchronization messages from the gateway / AC controller, thereby achieving network-wide clock synchronization.

[0069] Specifically, when there is no gateway or AC controller in the network, such as in an ad-hoc network or a distributed network consisting only of APs, a unique wireless access point (AP) is pre-selected as an alternative clock source through the network management protocol. This designated AP performs clock synchronization functions similar to a gateway, periodically broadcasting synchronization signals, and other devices in the network synchronize based on the clock of this AP.

[0070] In this embodiment, a unique data scrambling scheme is generated for each transmission opportunity (time slot) by using the dynamically changing timestamp value shared by all network devices as a source of randomness, thereby achieving a low-cost dynamic secure transmission with a "one-time key" style.

[0071] In one embodiment, a wireless data security transmission device based on timestamp random scrambling uses a pseudo-random seed to drive a pseudo-random number generator and combines it with a shuffling algorithm to generate a permutation sequence step, including: generating an initial index array, which represents the original field order, wherein the index represents the original field position and the value represents the field number at that position; performing an iterative shuffling operation of the Fisher-Yates shuffling algorithm on the initial index array to obtain a shuffled index array; and rearranging the message fields in the logical frame to be permuted according to the shuffled index array.

[0072] It should be noted that the pseudo-random number generator used in this method is a linear congruential generator (LCG). Before use, parameters need to be predefined to generate a high-quality pseudo-random number sequence during the iteration process, ensuring the randomness of the permutation and avoiding modulo operation conflicts. The parameters include: a seed constant C, a multiplier A (A=1103515245 in this example), an increment B (B=12345 in this embodiment), and a modulus M (M=2^31 in this example). Simultaneously, the total number of data fields to be shuffled, i.e., the total number of message fields N, is set; in this example, N=7.

[0073] Specifically, a wireless data security transmission device based on timestamp-based random scrambling generates an original index array `arr` with values ​​[0, 1, 2, ..., N-1]. The index of this array represents the position of the original field, and its value represents the field number at that position. The steps of performing an iterative shuffling operation using the Fisher-Yates shuffling algorithm on the initial index array `arr` to obtain the shuffled index array include: setting a loop variable `i`, which decreases from N-1 to 1 during the loop, where N is the total number of message fields; taking the modulo of the loop variable `(i + 1)` based on the current pseudo-random seed value to obtain the permutation index `j`; swapping the elements at positions `i` and `j` in the initial index array; updating the pseudo-random seed value for the next iteration; and obtaining the shuffled index array after the loop ends.

[0074] Specifically, first, set the loop variable i, starting from its maximum value (N-1, i.e., 6) and decreasing it to 1.

[0075] In each iteration, perform the following operations:

[0076] i. Calculate the swap index: Take the current timestamp seed F modulo (i + 1) to obtain an integer j between 0 and i (inclusive). That is: j = F % (i + 1). This index j specifies the position of the field that needs to be swapped with position i.

[0077] ii. Perform a swap operation: Swap the elements at positions i and j in the index array. This operation is equivalent to swapping the corresponding fields in the actual data buffer.

[0078] iii. Update seed value: Update the value of F using the linear congruential formula (A * F + B) % M to generate a new pseudo-random number with good statistical properties for the next iteration.

[0079] After the loop ends, the index array arr represents a completely new, randomized arrangement of fields.

[0080] Apply the permutation sequence: Based on the shuffled index array arr, rearrange the fields (source address, destination address, etc.) in the actual data packet.

[0081] This application provides another method for secure wireless data transmission based on timestamp random scrambling, which is based on a time-division multiple access clock-synchronized wireless local area network. The method can be applied to any receiving end. The secure wireless data transmission method based on timestamp random scrambling includes: obtaining the timestamp value in the timestamp field of the permuted logical frame, wherein the timestamp value is the hardware-level timestamp value added by the transmitting end to the timestamp field of the permuted logical frame when sending the permuted logical frame; generating a pseudo-random seed based on the timestamp value and a preset constant set; using the pseudo-random seed to drive a pseudo-random number generator and combining it with a shuffling algorithm to generate a permutation sequence consistent with that of the transmitting end; and reassembling the message field of the permuted logical frame according to the inverse sequence of the permutation sequence to obtain a reassembled logical frame, which is the original logical frame.

[0082] Specifically, the receiver extracts the timestamp value T from the header of the received reassembled logical frame and calculates the same pseudo-random seed as the sender using the same constant C as the sender, F = T XOR C. The receiver then generates an index array arr representing the original order, with values ​​[0, 1, 2, ..., N-1]. The index of this array represents the position of the original field, and its value represents the field number at that position. The receiver then uses the same LCG parameters and algorithm to generate a shuffled index array arr_f, identical to the sender's array, representing the new position of each original field after shuffling. For reassembly, the receiver needs to derive the inverse permutation sequence from the shuffled sequence arr_f. A new array inverse_arr is created, where inverse_arr[arr_f[i]] = i. This inverse sequence indicates the original positions of the shuffled fields. Based on the calculated inverse permutation sequence inverse_arr, the received shuffled message fields are rearranged to restore the original, correct logical frame order.

[0083] In this embodiment, the transmitting end uses the globally synchronized timestamp value, directly or indirectly (e.g., a timestamp XOR constant), as the seed for the pseudo-random number generator to control the specific implementation of the logical frame reset and reassembly process. The transmitting end employs a linear congruential generator (LCG) combined with an enhanced Fisher-Yates shuffling algorithm for rearrangement. No complex key management is required; it relies solely on the inherent clock synchronization characteristics of WLAN. Compared to traditional encryption algorithms such as AES, the Fisher-Yates shuffling algorithm has a complexity of O(N), significantly reducing processing latency and computational resource consumption, making it suitable for scenarios with extremely high real-time requirements.

[0084] In one embodiment, a wireless data security transmission method based on timestamp random scrambling further includes: performing cyclic redundancy check on the reassembled logical frame; if the check passes, submitting the reassembled logical frame to the upper layer protocol.

[0085] Specifically, the receiving end performs a CRC check on the integrity of the reassembled logical frame, and submits it to the upper-layer protocol if the check passes.

[0086] In one embodiment, the permutation and reassembly process of logical frames is only valid within the same time slot of time division multiple access; each time slot corresponds to a unique permutation sequence; at the time slot boundary, the receiver is configured to simultaneously attempt to reassemble the message fields of the permuted logical frame using the permutations corresponding to the current time slot and the previous time slot.

[0087] Specifically, the permutation and reassembly process of logical frames is only valid within the TDMA time slots. Each time slot corresponds to a unique permutation sequence, and different logical frames, even if the fields are the same, will have different arrangements. At the time slot boundary, the receiver can simultaneously try the permutation sequences corresponding to the current time slot and the previous time slot, and select the correct descrambling scheme based on the CRC verification result.

[0088] In this embodiment, a wireless data security transmission device based on timestamp random scrambling utilizes the timestamp values ​​synchronized across the entire TDMA network in the wireless local area network to ensure consistency between the transmitting and receiving ends, which is difficult to guarantee with other permutation and reassembly methods. This application cleverly leverages the inherent clock synchronization characteristics of TDMA networks using existing synchronization mechanisms, eliminating the need to establish additional synchronization mechanisms for security purposes. It can be applied without changing the basic structure of logical frames and is easily integrated into existing WLAN protocol stacks.

[0089] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.

[0090] Based on the same inventive concept, this application also provides an apparatus for a wireless data security transmission method based on timestamp random scrambling. The solution provided by this wireless data security transmission apparatus based on timestamp random scrambling is similar to the solution described in the above method. Therefore, the specific limitations of one or more scene frame processing apparatus embodiments provided below can be found in the limitations of the scene frame processing method described above, and will not be repeated here.

[0091] This application also provides a wireless data security transmission device based on timestamp random scrambling, based on a time-division multiple access clock-synchronized wireless local area network. The wireless data security transmission device based on timestamp random scrambling is deployed at any transmitting end, and includes:

[0092] The first acquisition unit is used to acquire the current timestamp value in the timestamp field of the logical frame to be replaced;

[0093] The first pseudo-random seed generation unit is used to generate a pseudo-random seed based on the timestamp value and a preset constant set, wherein the preset constant set includes: seed constant, multiplier, increment, modulus and total number of message fields;

[0094] The first permutation sequence generation unit is used to drive a pseudo-random number generator with a pseudo-random seed and combine it with a shuffle algorithm to generate a permutation sequence.

[0095] The permutation unit is used to permutate the message fields in the logical frame to be permuted, excluding the frame header and timestamp fields, according to the permutation sequence, to obtain the permuted logical frame and send the permuted logical frame.

[0096] In one embodiment, before the step of obtaining the current timestamp value in the timestamp field of the logical frame to be replaced, the method further includes:

[0097] The first clock synchronization unit is used to synchronize the clock when the gateway or AC controller is used as the sole clock source for the wireless local area network.

[0098] The second clock synchronization unit is used to select a uniquely designated wireless access point as the clock source for clock synchronization when there is no gateway or AC controller in the network.

[0099] In one embodiment, the step of generating a pseudo-random seed based on a timestamp value and a preset set of constants includes:

[0100] The pseudo-random seed generation unit is used to perform a bitwise XOR operation between the timestamp value and a preset constant to obtain a pseudo-random seed.

[0101] In one embodiment, a pseudo-random number generator is driven by a pseudo-random seed, and a permutation sequence generation step is performed in conjunction with a shuffling algorithm, including:

[0102] The initial index array generation unit is used to generate an initial index array, which represents the original field order. The index represents the original field position, and the value represents the field number at that position.

[0103] The shuffled index array generation unit is used to perform an iterative shuffling operation of the Fisher-Yates shuffling algorithm on the initial index array to obtain the shuffled index array;

[0104] The rearrangement unit is used to rearrange the message fields in the logical frame to be replaced based on the shuffled index array.

[0105] In one embodiment, the step of performing an iterative shuffling operation using the Fisher-Yates shuffling algorithm on the initial index array to obtain the shuffled index array includes:

[0106] The loop unit is used to set the loop variable i. The loop variable i starts from N-1 and decreases to 1 to execute the loop, where N is the total number of message fields;

[0107] The modulo unit is used to take the modulo of the current pseudo-random seed value with respect to the loop variable (i + 1) to obtain the permutation index j;

[0108] The swap unit is used to swap elements at position i and position j in the initial index array;

[0109] The update unit is used to update the pseudo-random seed value for the next iteration;

[0110] The shuffled index array generation unit is used to obtain the shuffled index array after the loop ends.

[0111] This application also provides another wireless data security transmission device based on timestamp random scrambling, based on a time division multiple access clock-synchronized wireless local area network. The wireless data security transmission device based on timestamp random scrambling is deployed at any receiving end, and includes:

[0112] The second acquisition unit is used to acquire the timestamp value in the timestamp field of the replaced logical frame, wherein the timestamp value is the hardware-level timestamp value added by the sending end to the timestamp field of the replaced logical frame when sending the replaced logical frame;

[0113] The second pseudo-random seed generation unit is used to generate pseudo-random seeds based on timestamp values ​​and a preset set of constants.

[0114] The second permutation sequence generation unit is used to drive a pseudo-random number generator with a pseudo-random seed and combine it with a shuffling algorithm to generate a permutation sequence consistent with the sending end.

[0115] The reassembly unit is used to reassemble the message fields of the permuted logical frame according to the inverse sequence of the permutation sequence to obtain a reassembled logical frame, which is the original logical frame.

[0116] In one embodiment, a wireless data security transmission device based on timestamp random scrambling further includes:

[0117] Cyclic redundancy check unit, used to perform cyclic redundancy check on the reassembled logic frame;

[0118] The submission unit is used to submit the reassembled logical frame to the upper-layer protocol if the verification passes.

[0119] In one embodiment, a wireless data security transmission device based on timestamp random scrambling, wherein the logical frame replacement and reassembly process is only effective within the same time slot of time division multiple access;

[0120] Permutation sequence unit, used to provide a unique permutation sequence for each time slot;

[0121] The reassembly unit is used at the time slot boundary, where the receiver is configured to simultaneously attempt to reassemble the message fields of the permuted logical frame using the permutations corresponding to the current time slot and the previous time slot.

[0122] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit them. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of this application.

Claims

1. A method for secure wireless data transmission based on timestamp random scrambling, characterized in that, In a time-division multiple access-based clock-synchronized wireless local area network, the method is applied to any transmitting end, and the wireless data secure transmission method based on timestamp random scrambling includes: Get the current timestamp value in the timestamp field of the logical frame to be replaced; A pseudo-random seed is generated based on the timestamp value and a preset set of constants, wherein the preset set of constants includes: seed constant, multiplier, increment, modulus and total number of message fields; The pseudo-random seed is used to drive the pseudo-random number generator, and a permutation sequence is generated in combination with the shuffle algorithm; The message fields in the logical frame to be replaced, excluding the frame header and the timestamp field, are replaced according to the replacement sequence to obtain the replaced logical frame and send the replaced logical frame.

2. The wireless data secure transmission method based on timestamp random scrambling according to claim 1, characterized in that, Before the step of obtaining the current timestamp value in the timestamp field of the logical frame to be replaced, the method further includes: The gateway or AC controller serves as the sole clock source for the wireless local area network, enabling clock synchronization. When the gateway or AC controller is not present in the network, a uniquely designated wireless access point is selected as the clock source for clock synchronization.

3. The wireless data secure transmission method based on timestamp random scrambling according to claim 1, characterized in that, The step of generating a pseudo-random seed based on the timestamp value and a preset constant set includes: The pseudo-random seed is obtained by performing a bitwise XOR operation between the timestamp value and the preset constant.

4. The wireless data secure transmission method based on timestamp random scrambling according to claim 1, characterized in that, The step of using the pseudo-random seed to drive the pseudo-random number generator and combining it with the shuffling algorithm to generate a permutation sequence includes: Generate an initial index array, which is used to represent the original field order, where the index represents the original field position and the value represents the field number at that position; The initial index array is shuffled iteratively using the Fisher-Yates shuffle algorithm to obtain the shuffled index array. Based on the shuffled index array, the message fields in the logical frame to be replaced are rearranged.

5. A wireless data security transmission method based on timestamp random scrambling according to claim 4, characterized in that, The step of performing an iterative shuffling operation on the initial index array using the Fisher-Yates shuffling algorithm to obtain the shuffled index array includes: Set a loop variable i, which starts from N-1 and decreases to 1 to execute the loop, where N is the total number of message fields; The permutation index j is obtained by taking the modulo of the current pseudo-random seed value with the loop variable (i + 1); Swap the elements at positions i and j in the initial index array; Update the pseudo-random seed value for the next iteration; After the loop ends, the shuffled index array is obtained.

6. A method for secure wireless data transmission based on timestamp random scrambling, characterized in that, In a time-division multiple access-based clock-synchronized wireless local area network, the method is applied to any receiving end. The wireless data secure transmission method based on timestamp random scrambling includes: Obtain the timestamp value in the timestamp field of the replaced logical frame, wherein the timestamp value is the hardware-level timestamp value added by the sending end to the timestamp field of the replaced logical frame when sending the replaced logical frame; A pseudo-random seed is generated based on the timestamp value and a preset set of constants; The pseudo-random seed is used to drive the pseudo-random number generator, and a permutation sequence consistent with the sending end is generated in combination with the shuffling algorithm; Based on the inverse sequence of the permutation sequence, the message fields of the permuted logical frame are reassembled to obtain a reassembled logical frame, which is the original logical frame.

7. A wireless data security transmission method based on timestamp random scrambling according to claim 6, characterized in that, Also includes: Perform cyclic redundancy check on the recombined logic frame; If the verification passes, the reassembled logic frame is submitted to the upper-layer protocol.

8. A wireless data security transmission method based on timestamp random scrambling according to any one of claims 6 to 7, characterized in that, The replacement and reassembly process of the logical frame is only valid within the same time slot of time division multiple access; Each time slot corresponds to a unique permutation sequence; At the time slot boundary, the receiver is configured to simultaneously attempt to reassemble the message fields of the permuted logical frame using the permutation corresponding to the current time slot and the previous time slot.

9. A wireless data security transmission device based on timestamp random scrambling, characterized in that, In a time-division multiple access-based clock-synchronized wireless local area network, the wireless data security transmission device based on random timestamp scrambling is deployed at any transmitting end. The wireless data security transmission device based on random timestamp scrambling includes: The first acquisition unit is used to acquire the current timestamp value in the timestamp field of the logical frame to be replaced; The first pseudo-random seed generation unit is used to generate a pseudo-random seed based on the timestamp value and a preset constant set, wherein the preset constant set includes: seed constant, multiplier, increment, modulus and total number of message fields; The first permutation sequence generation unit is used to drive the pseudo-random number generator with the pseudo-random seed and generate a permutation sequence in combination with the shuffle algorithm; The replacement unit is used to replace the message fields in the logical frame to be replaced, excluding the frame header and the timestamp field, according to the replacement sequence, to obtain the replaced logical frame and send the replaced logical frame.

10. A wireless data security transmission device based on timestamp random scrambling, characterized in that, In a time-division multiple access-based clock-synchronized wireless local area network, the wireless data security transmission device based on random timestamp scrambling is deployed at any receiving end. The wireless data security transmission device based on random timestamp scrambling includes: The second acquisition unit acquires the timestamp value in the timestamp field of the replaced logical frame, wherein the timestamp value is the hardware-level timestamp value added by the sending end to the timestamp field of the replaced logical frame when sending the replaced logical frame; The second pseudo-random seed generation unit is used to generate a pseudo-random seed based on the timestamp value and a preset set of constants. The second permutation sequence generation unit is used to drive the pseudo-random number generator with the pseudo-random seed and generate a permutation sequence consistent with the sending end in combination with the shuffling algorithm. The reassembly unit is used to reassemble the message fields of the permuted logical frame according to the inverse sequence of the permutation sequence to obtain a reassembled logical frame, wherein the reassembled logical frame is the original logical frame.

Images