Power multi-source data secure transmission and encryption analysis system

Abstract

The invention relates to the technical field of power system industrial internet communication security, and discloses a power multi-source data security transmission and encryption analysis system, which comprises a sending end gateway and a receiving end gateway. The sending end gateway is configured to solidify multi-source aggregation and synchronous sampling period parameters, generate a multi-path fragment index by using a deterministic mapping algorithm, and compulsively schedule a service message to a discrete sending time slot in a synchronous period, so as to carry out smoothing and whitening processing and secure packaging on a propulsion mode of a serial number; and the receiving end gateway establishes multiple paths of parallel anti-replay windows of which the number is consistent with the multi-source aggregation parameters, and guides the message to the corresponding sub-channel according to the fragment index of the message to execute independent anti-replay verification. According to the method, the time sequence distribution and verification architecture of the serial numbers are remodeled, the clustering congestion risk of the serial number lag at a specific critical point is avoided, and continuous and reliable transmission of key power service data in a complex network environment is guaranteed.

Description

Technical Field

[0001] This invention relates to the field of communication security technology for industrial internet in power systems, and more specifically, to a system for secure transmission and encrypted analysis of multi-source power data. Background Technology

[0002] In the construction of modern smart grids, critical operations such as wide-area phasor measurement systems and dispatch automation place extremely high demands on the real-time performance and security of data. To ensure the confidentiality and integrity of data transmission, security gateways typically use IPsec (Internet Security Protocol) to establish encrypted tunnels at the network layer. In the IPsec protocol suite, the anti-replay mechanism is a core component. It identifies and discards stale packets that have been intercepted and retransmitted by an attacker by maintaining a monotonically increasing sequence number and a sliding window.

[0003] However, the traffic patterns of power business systems differ significantly from those of traditional internet services. Power terminals (such as phasor measurement units, PMUs) typically perform high-precision synchronous sampling based on a unified satellite timing source and report centrally to the dispatch center according to a fixed power frequency period (e.g., 20ms). This mechanism results in network layer traffic exhibiting multi-source, periodic, and synchronous convergence characteristics.

[0004] Meanwhile, to meet the high reliability standards of power communication, the bearer network widely adopts dual-plane, parallel redundancy protocols or dynamic routing backup mechanisms. When the primary and backup links switch over or multi-path transmission occurs, the arrival order of data packets will be disordered (out of order), introducing significant path delay differences.

[0005] Under the combined effects of synchronous aggregation and redundant out-of-order delivery, existing IPsec anti-replay mechanisms face severe challenges:

[0006] Clustering of sequence number lag: Due to the large number of terminals sending data at the same time, the growth of sequence numbers within the same encrypted tunnel exhibits a periodic burst-like trend. When a group of packets experiences delay due to link switching, the sequence number lag of this group of packets will not be smoothly distributed like in ordinary streaming media, but will instead manifest as a stepped clustered lag with periodic aggregation steps.

[0007] Limitations of traditional window mechanisms: Existing single sliding window mechanisms advance linearly based solely on the largest received sequence number. When encountering clustered and delayed messages, if the window's coverage area fails to precisely match the step span, it can cause legitimate message clusters to be cut off at the window edges, leading to periodic batch erroneous discarding.

[0008] Resource and performance conflict: To address the aforementioned misjudgment, the current common practice is to blindly increase the size of the sliding window (e.g., to thousands of bits). This not only significantly consumes the gateway's storage resources and bitmap search computing power, but also increases system processing latency jitter, making it difficult to meet the stringent requirements of power services for deterministic transmission.

[0009] Therefore, there is an urgent need for a new network layer transmission and verification system that can adapt to the synchronous aggregation attributes of power business and effectively eliminate the risk of clustered false positives in a redundant network environment. Summary of the Invention

[0010] This invention provides a system for secure transmission and encrypted analysis of multi-source power data, which solves the technical problems mentioned in the background art.

[0011] This invention provides a secure transmission and encryption analysis system for multi-source power data, including a sending gateway and a receiving gateway:

[0012] The sending gateway is configured to preset the number of multi-source aggregations and the synchronous sampling period parameters at the network layer, generate a multi-path fragmentation index for inbound service packets through deterministic mapping, schedule the packets to the corresponding discrete transmission time slots within the synchronous sampling period according to the multi-path fragmentation index, and perform secure encapsulation after completing the sequence number timing smoothing process.

[0013] The receiving gateway is configured to establish a number of parallel anti-replay windows that are consistent with the number of multi-source aggregations, parse and encapsulate the sequence number of the received message and determine the fragment channel to which it belongs, and index it to the corresponding parallel anti-replay window to perform independent sub-channel anti-replay verification.

[0014] The system degrades the aggregated congestion of sequence number lag through discrete time slot scheduling at the transmitting end, and eliminates the risk of periodic packet loss for the verification window through parallel anti-replay window at the receiving end.

[0015] The beneficial effects of this invention are as follows: By employing a discrete time-slot scheduling mechanism at the transmitting end and a multi-channel parallel verification architecture at the receiving end, it effectively solves the problem of clustered and erroneously dropped power service traffic due to path switching in a redundant network environment. This invention utilizes discrete time-slot scheduling to evenly distribute the originally concentrated sequence number lag risk, and, in conjunction with a multi-channel parallel window, eliminates the tiered failure risk faced by a single verification window. Without significantly increasing the computational and storage resource overhead of the gateway, it significantly improves the continuity and stability of wide-area protection and measurement services during network fault switching, while ensuring the timing requirements of end-to-end data transmission. Attached Figure Description

[0016] Figure 1This is a flowchart of the network layer encrypted transmission process for lattice-aware sequence number whitening and remainder decomposition anti-replay verification of the present invention.

[0017] Figure 2 This is a diagram illustrating the deployment of key node gateways in the power dedicated communication network and the IPsec tunnel scenario under redundant multipaths, as presented in this invention.

[0018] Figure 3 This is a diagram illustrating the formation mechanism of the serial number hysteresis lattice burst and the time slot whitening superposition remainder decomposition parallel anti-replay suppression mechanism of the present invention. Detailed Implementation

[0019] The subject matter described herein will now be discussed with reference to exemplary embodiments. It should be understood that these embodiments are discussed only to enable those skilled in the art to better understand and implement the subject matter described herein, and changes may be made to the function and arrangement of the elements discussed without departing from the scope of this specification. Various processes or components may be omitted, substituted, or added as needed in the examples. Furthermore, features described in some examples may be combined in other examples.

[0020] like Figure 1 As shown, the power multi-source data secure transmission and encryption analysis system includes a sending gateway and a receiving gateway:

[0021] The sending gateway is configured to preset the number of multi-source aggregations and the synchronous sampling period parameters at the network layer, generate a multi-path fragmentation index for inbound service packets through deterministic mapping, schedule the packets to the corresponding discrete transmission time slots within the synchronous sampling period according to the multi-path fragmentation index, and perform secure encapsulation after completing the sequence number timing smoothing process.

[0022] The receiving gateway is configured to establish a number of parallel anti-replay windows that are consistent with the number of multi-source aggregations, parse and encapsulate the sequence number of the received message and determine the fragment channel to which it belongs, and index it to the corresponding parallel anti-replay window to perform independent sub-channel anti-replay verification.

[0023] The system degrades the aggregated congestion of sequence number lag through discrete time slot scheduling at the transmitting end, and eliminates the risk of periodic packet loss for the verification window through parallel anti-replay window at the receiving end.

[0024] In a preferred embodiment, the network layer preset parameters in the sending gateway and the sources of the network layer preset parameters include:

[0025] The number of multi-source aggregations It originates from the number of equivalent synchronization phase-locked sources within the encrypted tunnel;

[0026] The synchronous sampling period Its origin is the nominal reporting cycle of business data;

[0027] Discrete transmission time slot width The calculation formula is as follows:

[0028]

[0029] Maximum inter-cycle delay order The calculation formula is as follows:

[0030]

[0031] in, The maximum network redundancy delay introduced for network redundancy switching This indicates the rounding up operation.

[0032] In detail, the network layer preset parameters of the sending gateway need to be adapted to the inherent attributes of the power service network layer. (Multi-source aggregation quantity) The value of the value is related to the actual scale of the equivalent synchronous phase-locked source within the encrypted tunnel. In power operations, PMU synchronous phasor streams and SCADA periodic polling streams all possess time synchronization characteristics and need to be converged for transmission. These concurrent periodic streams constitute the source of the sequence number lattice burst. Therefore, The actual number of this type of stream needs to be matched. Synchronization sampling period. Based on the nominal reporting period of business data, the PMU reporting rate in power business is strongly correlated with the nominal frequency of the power grid, and its reporting period is fixed (e.g., a 20ms reporting period corresponds to a 50Hz power grid). The value must be consistent with this inherent period to achieve precise binding between traffic and the time dimension. Discrete transmission slot width The derivation is based on the need for traffic dispersion, because A synchronous cycle flow in Internally, a concentrated burst of events may occur. To avoid clustered advancements due to concentrated sequence number transmission, it is necessary to... Evenly divided into Each time slot is a separate time slot, and each time slot carries only the transmission of one stream, therefore pass and The ratio is determined, that is This disperses the originally concentrated traffic across different time points within the cycle. Maximum cross-cycle delay order. The derivation addresses the maximum latency introduced by network redundancy switching. Redundant path switching or multipath transmission can cause cross-cycle delays in packets. To quantify the range of delay impact in the worst-case scenario, it is necessary to calculate... and The ratio, since the delay may span integer periods, needs to be ensured by rounding up. It can fully cover the worst-case latency scenario, that is .

[0033] In a preferred embodiment, the mapping algorithm for generating the multi-path fragmentation index by the sending gateway includes:

[0034] Extracting inbound service messages quintuple information ;

[0035] The multi-way sharding index is calculated according to the following formula. :

[0036]

[0037]

[0038] in, For source Internet Protocol address, For destination Internet Protocol address, For transport layer protocol number, For the source port, For destination port, This indicates a data concatenation operation. This represents a deterministic hash algorithm or cyclic redundancy check algorithm. The number of multi-source aggregations, This represents the modulo operation. This is the generated multi-way sharding index.

[0039] In detail, the sending gateway generates a multi-path fragmentation index to establish a stable association between the service flow and the sequence space remainder track. This involves selecting the five-tuple information of the inbound service packet. The 5-tuple is used as a mapping input because it can identify the service flow, ensuring that all packets of the same service flow always correspond to the same fragmentation index during transmission, avoiding time slot allocation chaos caused by ambiguous flow identifiers. After concatenating the 5-tuple information, a deterministic hash operation (such as CRC32 or other consistent hash algorithms) is performed to obtain an intermediate hash value. This is to transform variable-length quintuple information into fixed-length values, eliminating the influence of quintuples of different lengths on subsequent mapping operations, while ensuring that the same quintuple input always yields the same hash output, satisfying the mapping requirements. The intermediate hash value is then aggregated across multiple sources. Perform modulo operation It restricts the range of hash values ​​to a certain value. Internally, this enables the generation of multi-way sharding indexes. Able to be compatible with preset Each discrete transmission time slot corresponds one-to-one, ensuring that each service flow can be accurately allocated to a specific phase slot within the synchronous sampling period.

[0040] In a preferred embodiment, the specific timing smoothing process by which the sending gateway schedules packets to discrete transmission time slots includes:

[0041] Obtain the monotonic timestamp of inbound service packets arriving at the gateway. ;

[0042] Calculate the periodic index using the following formula and target sending time :

[0043]

[0044]

[0045] in, The synchronous sampling period is... This indicates the floor function. For the multi-way sharding index, The width of the discrete transmission time slot, This is the phase constant used to locate the transmission time to the center of the time slot. That is, the determined target transmission time.

[0046] In detail, the sending gateway performs time-series smoothing processing on packets by distributing service flows concentrated at the period boundary to discrete time slots within the synchronous sampling period, thereby achieving uniformity in the sequence number advancement pattern. This involves obtaining the monotonic timestamp of the inbound service packet arriving at the gateway. This is because monotonic timestamps provide continuously increasing time references, preventing time rollback from interfering with periodicity determination and ensuring that the time positioning of each message is unique and accurate. (Calculate the periodic index.) Use floor function to round down. This is to lock the complete synchronization sampling period to which the message belongs, ensuring that subsequent time slot allocation always occurs within a fixed period frame and preventing time slot overlap between messages from different periods. The phase offset is achieved through... Calculation, where For multi-way sharding index, To add numerical values ​​to the discrete transmission time slot width This is to ensure that the message transmission time falls precisely at the center of the corresponding time slot, reducing message transmission conflicts at the boundaries of different time slots, and minimizing the impact of time slot edge jitter on sequence number advancement. Target transmission time This involves superimposing the start time of the period to which the message belongs with the phase offset of the corresponding time slot, so that each message can be scheduled to a specific discrete time slot within the synchronous sampling period, instead of being concentrated at the period boundaries. The traffic flow is evenly distributed to In each independent time slot, the business flow of a single remainder track is carried in only one time slot, so that the growth of the sequence number changes from a concentrated burst to a continuous and uniform increase.

[0047] In a preferred embodiment, the gating release mechanism of the sending gateway when performing time slot scheduling includes:

[0048] Construct and release gated variables The calculation formula is as follows:

[0049]

[0050] in, The current system time of the gateway. The time for sending to the target. This is a unit step indicator function;

[0051] when When, the message is released; when At that time, keep the message waiting.

[0052] In detail, the gating release mechanism of the sending gateway controls the timing of packet transmission, ensuring the smooth execution of timing processing. This involves constructing a release gating variable. The unit step indicator function is chosen because it naturally adapts to the binary logic of releasing upon reaching a preset time and waiting if the preset time is not reached, thus enabling state switching. The independent variable is set to the current system time. Sending time with target The difference is used to quantify the time relationship between the current time and the preset time slot; its functional expression is: Real-time monitoring This is to dynamically capture the time progression status, respond promptly to time slot triggering conditions, and prevent message transmission from deviating from the preset time slot due to time monitoring delays. When the unit step indicator function outputs 1, it triggers the message to enter the secure encapsulation process. This is because the message has reached the center of the allocated discrete time slot, and after release, the sequence number is guaranteed to increment in a smoothed pattern. When the function outputs 0, the message is kept in the queue to prevent premature message transmission from disrupting the uniformity of time slot allocation and to avoid messages from different remainder tracks from converging again in the time dimension.

[0053] In a preferred embodiment, the method for calculating the window width of the parallel anti-replay window in the receiving gateway includes:

[0054] First, calculate the upper bound of the smoothed sequence lag using the following formula. :

[0055]

[0056] The window width of the parallel anti-replay window is then calculated according to the following formula. :

[0057]

[0058] in, The maximum network redundancy delay introduced for network redundancy switching Jitter is allowed for the local scheduling of the sending gateway. For synchronous sampling period, For the number of multi-source aggregations, This indicates the rounding up operation.

[0059] In detail, the parallel anti-replay window width of the receiver gateway is an adapted buffer range allocated to each remainder channel to absorb the smoothed sequence number drift within that channel. This introduces the maximum delay caused by network redundancy switching. Jitter allowed by the sender's local scheduling This is because both types of delays will cause a sequence number lag when the message arrives at the receiver, which must be fully covered within the window width. Calculate the upper bound of the smoothed sequence lag. At that time, first and Sum the results to get the total delay in the worst case, then divide by the synchronization sampling period. The cross-cycle ratio corresponding to the total delay is obtained and multiplied by the number of multi-source aggregations. This is because the sending end has already pushed the sequence number forward. The time slots are dispersed, and the magnitude of the lag is... Directly related, and finally rounded up. Ensure the upper bound fully covers the worst-case latency scenario to avoid misjudgments due to latency exceeding the range. Determine the width of the parallel anti-replay window. At that time, Divide by Because The total lag needs to be evenly distributed among the parallel windows, so that each sub-window only needs to handle the drift of its corresponding remainder channel, without having to bear the full lag, and then the floor function is used to achieve this. Ensure that the width of each sub-window is sufficient to absorb the sequence number drift within its own channel, so that legitimate messages are not lost due to insufficient width, nor are resources wasted due to excessive width.

[0060] In a preferred embodiment, the receiving gateway performs a state update process for channel-specific anti-replay verification, including:

[0061] Get the historical maximum sequence number of the current parallel anti-replay window and parallel anti-replay window width ;

[0062] Calculate the anti-replay receiver weight using the following formula. :

[0063]

[0064] Update the historical maximum serial number according to the following formula :

[0065]

[0066] in, The encapsulation sequence number for the received message. For unit step indicator function, To find the maximum value function; when When the value equals one, it means the verification has passed. A value of zero indicates that the verification failed.

[0067] In detail, the receiver gateway's channel-specific anti-replay verification state update implements verification and state maintenance, ensuring that the anti-replay logic of each remaining channel is independent. It reads the historical maximum sequence number of the current parallel anti-replay window. With window width Because The position of the largest sequence that has been received by this channel is marked. An acceptable sequence number drift range is defined, and together these two factors form the benchmark for replay resistance verification. The lower bound of the effective window is set to... Calculate the encapsulation sequence number of the received message. The difference from the lower bound is used to determine Whether it falls within the currently acceptable sequence range, a non-negative difference indicates... The window constraint was not exceeded. This difference was substituted into the unit step indicator function to generate anti-replay receiver weights. Its expression is This function can naturally perform binary comparison. When inside the window ,otherwise Update the historical maximum serial number. At that time, adopt The weighted summation method is because when At that time, it is necessary to Updated to the maximum sequence number of the current channel (i.e. and (the larger value in the sequence), ensuring the window advances with the valid sequence; when At that time, keep The settings remain unchanged to prevent illegal or expired serial numbers from affecting the window baseline.

[0068] In a preferred embodiment, the delivery decision process incorporating integrity verification weights includes:

[0069] Calculate the local computational integrity check value according to the following formula. and integrity verification weight :

[0070]

[0071]

[0072] The final delivery weight is generated according to the following formula. and delivery data :

[0073]

[0074]

[0075] in, It is a message authentication code algorithm based on authentication keys. For security parameter indexing, For encapsulating serial numbers, For encrypted payload, To receive the integrity check value carried in the message, For distance metric norm, To map any non-negative input to a saturation function in the interval between zero and one, The anti-replay reception weight, This is the decrypted plaintext message.

[0076] In detail, the delivery decision, which incorporates integrity verification weights, integrates replay protection verification and data integrity verification results to achieve message delivery control. This involves executing [a specific procedure] on the encrypted payload of the received message. The calculation yields the local computation integrity check value. This is because SPI, S, and c together constitute the core identifier and data components of IPsec encapsulation. Based on this information, the message authentication code calculation can verify whether tampering or forgery has occurred during data transmission. With the received message carried The difference distance between them, and the saturation function Mapping it to the [0,1] interval is because the saturation function can stably handle differences of any scale, avoiding interference from extreme differences on the judgment result. Then, through... Generate integrity verification weights This ensures that the data has not been tampered with (difference distance is 0). When tampering exists (difference distance greater than 0). This implements binary integrity assessment. The integrity check weights are then... With anti-replay receiver weights Perform multiplication operations to generate final delivery weights This is because only those who pass the anti-replay verification simultaneously ( ) and data integrity verification ( Only messages that pass the multiplication operation are eligible for delivery; the multiplication operation implements the logic of double verification before delivery. The final delivery weight is then determined. With the decrypted plaintext message Performing multiplication yields Because It can directly output the complete plaintext. Output all zero silent data at any time.

[0077] In a preferred embodiment, the network layer environment and message sequence characteristics of the system include:

[0078] The network layer environment introduces random cross-cycle arrival delays. This results in a lag in the original serial number before the serial number whitening process was performed. It exhibits the following lattice-like aggregation characteristics:

[0079]

[0080] After processing by the system, the sequence number lag is decomposed into various remainder sub-channels, and the sub-sequence number lag in each channel is... satisfy:

[0081]

[0082] in, The number of multi-source aggregations, The synchronous sampling period is... For floor operations, This corresponds to the historical maximum sequence number of the parallel anti-replay window. The system will use the encapsulation sequence number of the received message; The explosive lag of the step size is transformed into a smooth drift within the sub-channel constrained by the window width.

[0083] In detail, the multipath transmission structure introduced at the network layer is built from parallel redundancy protocols or high-availability seamless redundancy protocols. This type of structure will cause random cross-cycle arrival delays in packets. However, the multi-source phase-locked loop fan-in aggregation characteristic in the power industry results in a significant lag in the original sequence number before processing. and Number of multi-source aggregations Synchronous sampling period Form a fixed association, Each time a complete There will be A new serial number was issued ahead of schedule, therefore Presentation The lattice-like aggregation, the floor operation corresponds to The system spans an integer number of periods. Lattice-sensing sequence number whitening is achieved through discrete time-slot scheduling, shifting the original concentrations at period boundaries... Road messages are distributed to The independent time slots transform the sequence number advancement from a clumping pattern to a uniform pattern; the remainder factorization anti-replay verification further divides the single sequence space into... Each of the several remainder sub-channels maintains its own historical maximum sequence number. This makes the encapsulation sequence number of the received message... Corresponding sub-sequence number lag It only reflects the sequence drift within that channel. Therefore, what was originally... The burst hysteresis of the step size is split into various sub-channels, and the drift range of each sub-channel is constrained by the width of the corresponding parallel anti-replay window, ultimately realizing the transformation of the sequence number hysteresis from lattice-like aggregation to smooth and controllable drift.

[0084] It should be noted that multi-source phase-locked loop (PLL) fan-in convergence is caused by the traffic structure of the power service network layer. It refers to multiple power service data sources with time synchronization characteristics (such as PMU phasor measurement devices, SCADA periodic polling terminals, etc.) achieving high-precision time alignment based on a unified time source (such as GPS, PTP). Their data reporting rate is strongly correlated with the nominal frequency of the power grid and maintains periodic consistency. These dispersed periodic service flows converge towards the same target node (such as the phasor data concentrator PDC, dispatch center gateway, IPsec encrypted tunnel entrance) during transmission, ultimately forming a phase-in, periodic micro-burst traffic pattern at the network layer. This traffic pattern is caused by the power system's time synchronization requirements for measurement and control data, and the system architecture of superimposed PMUs and PDCs. The phase-locked alignment of multi-source traffic in the time dimension and the concentrated convergence in the spatial dimension lead to the lattice-like aggregation of sequence number lags.

[0085] It should be noted that the number of multi-source aggregations This corresponds to the equivalent number of concurrent periodic streams within the encrypted tunnel. It is used to calculate the equivalent number of all periodic service streams with time synchronization characteristics within the tunnel after aggregation and statistics. The acquisition method needs to be combined with the actual deployment scenario of the power business. The actual number of synchronization phase-locked sources within the encrypted tunnel should be determined through engineering measurements, or the equivalent number of periodic streams should be calculated based on the aggregation capability of the PDC (Phasor Data Concentrator) to ensure coverage of all service stream types participating in synchronization aggregation (such as PMU synchronization phasor streams, SCADA periodic polling streams, etc.). The preferred value should match the scale of concurrent periodic streams in the power business, typically ranging from 8 to 32. For example, if an encrypted tunnel contains 6 PMU streams and 2 SCADA periodic streams, the equivalent multi-source aggregation number after aggregation would be... 8 is a good choice.

[0086] It should be noted that the synchronous sampling period The nominal reporting period, derived from power business data, is related to the nominal frequency of the power grid and the sampling and reporting mechanism of the business equipment, and is the core manifestation of the periodicity of power business traffic. It is obtained by reading the configuration parameters of the business equipment or the nominal values ​​in relevant protocol specifications. For example, for PMU equipment conforming to IEC standards, the nominal reporting period can be 20ms in a 50Hz power grid scenario and approximately 16.67ms in a 60Hz scenario.

[0087] It should be noted that the discrete transmission time slot width The calculation formula is It is the synchronous sampling period Based on the number of multi-source aggregations The time interval obtained after uniform division. The method of acquisition is through a predetermined... and The derivation of division operation is performed, and its value follows... and The dynamic adjustment is achieved by adjusting the frequency of data transmission. For example, when the synchronization sampling period is a fixed value and the number of multi-source aggregations increases, the width of the discrete transmission time slot will decrease accordingly, making the time span of each time slot more precise. The width of the discrete transmission time slot is used to locate the transmission phase of a message within a period, ensuring that messages from different fragment indices are distributed into non-overlapping time windows, thus achieving uniformity in sequence number progression.

[0088] It should be noted that the maximum latency of network redundancy This is the worst-case latency value introduced during network redundancy failover (such as PRP / HSR protocol switching, primary / backup link failover), reflecting the maximum upper limit of packet delay caused by multi-path transmission or link switching. It needs to be obtained by collecting latency data under redundancy failover scenarios through engineering testing, taking the maximum value from multiple test results as a conservative upper limit, or referring to the upper limit of latency indicators in the design specifications of power WAN (IP / MPLS / Ethernet WAN). The preferred value should cover extreme failover scenarios; for example, if the measured maximum latency for redundancy failover of a certain power WAN link is 50ms, a conservative value could be set to 60ms.

[0089] It should be noted that the maximum cross-cycle delay order The calculation formula is ,in This is an up-rounding operation used to quantify the maximum latency of network redundancy. Crossing synchronous sampling period The number of integers. For example, when When the corresponding cross-cycle ratio is 2.3, rounded up... Set the value to 3. This parameter is used to specify the maximum number of cycles a message may span, providing a quantitative reference for the receiver's delay absorption capability of the replay window, and avoiding the loss of legitimate messages due to unexpected delays across cycles.

[0090] It should be noted that the business message This refers to the original service data packets sent from power terminals (such as PMUs and RTUs) to the dispatch center, which need to be transmitted through an encrypted tunnel. It covers all types of power services participating in network layer encryption verification (such as synchronization phasor data, telemetry and telecontrol data, alarm event data, etc.). The acquisition method involves the sending gateway receiving inbound packets in real time through a legitimate and compliant hardware interface, ensuring that the data acquisition process complies with power communication standards and data security requirements. The packets must contain complete network layer and transport layer header information and service payload.

[0091] It should be noted that the 5-tuple information is derived from the source Internet Protocol address. , destination Internet Protocol address Transport layer protocol number Source port and destination port Composition is a core network feature that uniquely identifies a service flow. It is obtained by connecting the sending gateway to the receiving station's service packets. Protocol parsing is performed to extract the above five pieces of information from the network layer and transport layer headers and concatenate them in a fixed order to ensure the uniqueness and completeness of the extracted results. For example, if the IP address of a PMU device is 192.168.1.10, the receiving IP of the dispatch center is 10.0.0.1, and the UDP protocol (protocol number 17) is used with source port 5000 and destination port 6000, then the corresponding five-tuple information is (192.168.1.10, 10.0.0.1, 17, 5000, 6000).

[0092] It should be noted that the intermediate hash value It is a fixed-length value obtained by performing a hash operation on the 5-tuple information, and its calculation formula is: ,in This indicates a data concatenation operation. This uses deterministic hash algorithms (such as CRC32, SHA-1, etc.). The method involves taking the concatenated 5-tuple information as input and substituting it into the selected hash algorithm for calculation. This ensures that identical 5-tuple information always outputs the same intermediate hash value, while different 5-tuple information outputs different hash values ​​(the probability of hash collisions is negligible). For example, using the CRC32 algorithm to calculate a fixed 5-tuple yields a 32-bit binary intermediate hash value.

[0093] It should be noted that multi-way sharding index The calculation formula is , where is the modulo operation, and the value range is . This is used to logically bind business message logic to a specific remainder track in the sequence space. It is obtained by analyzing the intermediate hash value. With the number of multi-source aggregations Perform a modulo operation, leveraging its range constraint property to map the hash value to a preset index range. For example, if the intermediate hash value is a relatively large integer, the number of multi-source aggregations... At that time, after the modulo operation It can only be an integer between 0 and 7, ensuring that each packet corresponds to a unique fragmentation index. Multi-path fragmentation index. It is an identifier that enables discrete time slot scheduling of messages and channel-specific verification at the receiving end, ensuring that messages of the same service flow are always mapped to the same index, and that different service flows are evenly distributed to different indices.

[0094] It should be noted that hash algorithms It is used to generate intermediate hash values. A deterministic algorithm should possess the characteristics of the same output for the same input, a high probability of different outputs for different inputs, and high computational efficiency. It should be selected from commonly used deterministic hash algorithms or cyclic redundancy check algorithms, with mature algorithms such as CRC32, CRC64, or SHA-1 being preferred.

[0095] It should be noted that monotonic timestamps It is a business message Upon arrival at the sending gateway, the timestamp is a continuously increasing time value generated by the gateway's local clock, typically in seconds (s) or milliseconds (ms). This is achieved by the sending gateway using a local high-precision clock module to collect the message arrival time data in real time, ensuring the timestamp has a monotonically increasing characteristic and will not roll back or jump due to clock calibration, system scheduling, or other factors. Ideally, the clock accuracy should be at the millisecond level or higher, for example, using a local clock that supports NTP or PTP protocol synchronization to ensure the accuracy and continuity of the timestamp.

[0096] It should be noted that periodic indexes The calculation formula is ,in This is a floor function used to precisely locate service messages. The complete synchronization sampling period to which it belongs. For example, if the monotonic timestamp of a message falls within the 3rd synchronization period (i.e., ... ), rounded down, periodic index This parameter is used to locate the periodic position of the message on the timeline, providing a periodic start reference for the target transmission time and ensuring that messages of different periods do not have overlapping time slot allocations.

[0097] It should be noted that the target sending time The calculation formula is This refers to scheduling service messages to a preset time point at the center of a specific discrete time slot within the synchronous sampling period. The acquisition method is based on a pre-calculated period index. Multi-way sharding index and discrete transmission time slot width This was derived through algebraic operations. Target transmission time. It is the core of achieving sequence whitening, which avoids the clustering of sequence numbers by distributing messages concentrated at the period boundary to the center of each time slot.

[0098] It should be noted that the phase constant It is used to adjust the target transmission time. The fixed position value serves the core purpose of precisely aligning the message's transmission time point to the center of discrete transmission time slots, rather than the slot edges. Phase constant The value selection logic is based on avoiding message transmission conflicts at different time slot boundaries, while reducing the impact of time jitter at time slot edges on sequence number advancement. For example, when the discrete transmission time slot width is... hour, Ensure that the message is sent exactly at the [time point]. The middle position of each time slot ensures that the transmission time of each message is sufficiently spaced from the messages in adjacent time slots, thus improving the stability of timing scheduling.

[0099] It should be noted that releasing the gating variable The calculation formula is ,in For unit step indicator function, This is the gateway's current system time, used to control when service packets are released. It is obtained by comparing the current system time in real-time. Sending time with target The unit step indicator function outputs a binary result (1 or 0). Output 1 when triggering message release; when Output 0 when the message is ready, and hold the message until it is received.

[0100] It should be noted that the current system time It is the real-time updated time value of the local clock at the sending gateway, and the monotonic timestamp. Same origin, ensuring consistency of time base, units and Maintain consistency (seconds or milliseconds). The acquisition method involves the gateway reading the current time from the local clock module in real time, supporting real-time monitoring with millisecond-level precision and above, ensuring timely capture of the target's transmission time.

[0101] It should be noted that the unit step indicator function It is a binary function whose core logic is: when the input parameter is greater than or equal to 0, the function outputs 1; when the input parameter is less than 0, the function outputs 0. In the scheme, it is mainly used to transform time relationship judgments (the difference between the current system time and the target transmission time, the difference between the encapsulation sequence number and the lower bound of the effective window, etc.) into deterministic binary results, avoiding branch judgments in the process. For example, in releasing the gating variable, the input is... This function directly outputs the control signal for release or waiting; in the generation of anti-replay reception weights, the input is the difference between the encapsulation sequence number and the lower bound of the effective window, and the output is the weight value for verification success or failure.

[0102] It should be noted that local scheduling allows for jitter. This refers to the difference between the actual packet release time and the target transmission time caused by factors such as system scheduling and hardware latency during the time slot scheduling process performed by the sending gateway. The maximum deviation value, in milliseconds (ms), is determined by testing the gateway's scheduling performance. The largest release time deviation from multiple tests is taken as a conservative value, preferably within the range of 0.1~1ms. For example, if a gateway's maximum scheduling jitter is tested to be 0.5ms, then... 0.5ms is acceptable.

[0103] It should be noted that the upper bound of the smoothed sequence lag is... The calculation formula is This is used to quantify the maximum hysteresis range that may occur after the serial number has been whitened. The acquisition method is based on a predetermined... , , and Through algebraic operations and rounding up, the upper bound is ensured to fully cover the worst-case sequence lag (caused by the superposition of network redundancy delay and local scheduling jitter). For example, if the maximum network redundancy delay, the allowable local scheduling jitter, the synchronization sampling period, and the number of multi-source aggregations are determined, and the result calculated by the formula is 24.3, then after rounding up... .

[0104] It should be noted that the parallel anti-replay window width The calculation formula is This is used to define the coverage range of the anti-replay window within each remainder channel, ensuring that it can absorb the smoothed sequence number drift within that channel. It is obtained by hysteresis the smoothed sequence with an upper bound. With the number of multi-source aggregations After performing the division operation, the data is rounded up to ensure that the width of each child window can evenly distribute the total lag.

[0105] It should be noted that the rounding up operation... This is a mathematical operation that rounds the input real number up to the nearest integer. Its purpose is to ensure that the calculation result covers the worst-case scenario and avoids insufficient range due to the decimal part. It is mainly used to calculate the maximum cross-cycle delay order. Upper bound of smoothed sequence lag and parallel anti-replay window width For example, when the calculation result is 3.1, it is rounded up to 4; when the result is 5.9, it is rounded up to 6.

[0106] It should be noted that the largest historical serial number It is a state variable maintained by the receiving gateway for each remainder channel, recording the maximum encapsulation sequence number of the messages that have been successfully received and verified within that channel. The acquisition method involves the receiving gateway setting an initial value (e.g., 0) during the initialization of each remainder channel. This is then dynamically iterated through the channel's anti-replay verification state update process. Only when a packet passes the anti-replay verification is the sequence number updated to the larger of the current packet sequence number and the historical value. For example, in a certain channel... The sequence number of the newly received message And if the verification passes, then Updated to 105; if And the verification was successful. Keep it unchanged at 100.

[0107] It should be noted that the package serial number This is a monotonically increasing integer assigned to each outbound packet by the sending gateway during IPsec security encapsulation. It uniquely identifies the packet within each encrypted tunnel and is the core identifier for replay protection. The sending gateway maintains an independent sequence number counter for each IPsec SA (Security Association), incrementing the counter by 1 for each encapsulated packet, ensuring strictly monotonically increasing and non-repeating sequence numbers. The sequence number length conforms to the IPsec protocol specification, typically 32 bits or 64 bits, ensuring a sufficiently large value range to avoid overflow.

[0108] It should be noted that the lower bound of the effective window is the critical value for replay verification of each remainder sub-channel at the receiving end, used to define the range of sequence numbers of legitimate packets within the current channel. It is obtained by reading the current sub-channel's sequence number in real time. and Dynamic calculation is performed through subtraction, for example, for a certain sub-channel. , If the effective window lower bound is 196, it means that messages with sequence numbers in the range of 196 to 200 are valid candidate messages.

[0109] It should be noted that the anti-replay reception weight The calculation formula is This is a binary variable (taking a value of 0 or 1) generated by a unit step indicator function, used to identify whether the received message has passed the channel-specific anti-replay verification. It is obtained by calculating the encapsulation sequence number of the received message. The difference between the value and the lower bound of the effective window is substituted into the unit step indicator function. If the difference is ≥ 0 (i.e., ...), the result is positive. (within a valid window), then (Verification passed); if the difference is <0 (i.e.) (outside the legal window), then (Verification failed).

[0110] It should be noted that the maximum value function Used to select the larger value from two input values, it is mainly used in the scheme to update the historical maximum sequence number of each remainder channel. Its function is to ensure Always maintain the sequence number of the largest received message within this channel to avoid subsequent received messages having smaller sequence numbers. Go back, for example, the input is and When the time is right, the output is 160; the input is... and When the time is right, the output is 150.

[0111] It should be noted that the encrypted payload This is the encrypted data block obtained by the sending gateway after encrypting the plaintext payload, padding fields, and next-layer header information of the service message. It is the core data part of IPsec encapsulation. It is obtained by the sending gateway using a preset encryption algorithm (such as SM4 or AES) and an encryption key. The encrypted data is generated by performing encryption operations on the plaintext data, and the encryption process follows the IPsec ESP protocol specification. The length of the ciphertext payload is determined by the plaintext length, padding length, and block length of the encryption algorithm, ensuring the confidentiality of data transmission and preventing it from being stolen or cracked during transmission.

[0112] It should be noted that the integrity check value is calculated locally. The calculation formula is ,in For authentication key Message authentication code algorithm, This is a security parameter index used to verify the integrity and authenticity of received messages. It is obtained by the receiving gateway extracting the received data. Serial number and encrypted payload After splicing, it passes through the same interface as the sending end. Algorithm and authentication key Calculated generation.

[0113] It should be noted that the integrity check value carried in the received message It is the sending gateway that performs IPsec encapsulation based on Serial number and encrypted payload The generated message authentication code is calculated and transmitted to the receiving end along with the encrypted tunnel packet. It is obtained by the receiving gateway parsing and extracting it from the received IPsec tunnel packet; its length is the same as that used during generation. Algorithm-related (e.g., HMAC-SHA256 generates 32 bytes) ).

[0114] It should be noted that the message authentication code algorithm Based on authentication key This hash-based algorithm possesses keyed integrity verification capabilities. Its core function is to ensure the integrity and authenticity of data, preventing data tampering or forgery. The algorithm is obtained by selecting from mature message authentication code algorithms, ensuring consistency with the sending end, such as the Chinese national cryptographic standard SM3-HMAC, HMAC-SHA1, and HMAC-SHA256, to ensure compatibility and security.

[0115] It should be noted that the authentication key It is used for Algorithm calculation The key, and the encryption key Together, these key pairs form the IPsec secure encapsulation, ensuring the integrity and authenticity of data transmission. They are obtained through secure negotiation between the sender and receiver using an IPsec key exchange protocol (such as IKE). The negotiation process adheres to security specifications for key exchange, ensuring the key is not leaked. The key length must conform to the selected... Security requirements for algorithms, such as the recommended key length for HMAC-SHA256, should not be less than 32 bytes.

[0116] It should be noted that the security parameter index It is a 32-bit integer used to uniquely identify an IPsec SA (Security Association) between the sender and receiver, specifying the encryption and authentication algorithms and keys corresponding to the message. It is obtained through negotiation during the IPsec tunnel establishment process, encapsulated in the tunnel packet header by the sender, and parsed by the receiver. Quickly locate the corresponding SA configuration. Each SA has a unique configuration. This ensures that safety parameters for different tunnels or different directions within the same tunnel are not confused.

[0117] It should be noted that the difference distance It is used to quantify the integrity check value of local computation. With the received message carried The method of measuring the degree of difference is essentially a consistency check between two fixed-length byte strings. This is achieved through a byte-by-byte comparison. and If all bytes are identical, the difference distance is 0; if any bytes are different, the difference distance is a non-zero value (the specific value can be defined by the number of byte differences, Hamming distance, etc.).

[0118] It should be noted that the saturation function It maps any non-negative input value to The core logic of this monotonically non-decreasing function over an interval is: when the input value is 0, the output is 0; when the input value is greater than 0, the output is 1; when the input value is between 0 and 1, the output is equal to the input value (primarily used for binary mapping in this scheme). It is used in the scheme to represent the difference distance. The mapping is either 0 or 1, for example, when the difference distance is 0. When the difference distance is non-zero, .

[0119] It should be noted that the integrity verification weight The calculation formula is `<value>` is a binary variable (taking the value 0 or 1) that indicates whether the received message has passed the integrity check. It is obtained by subtracting the result from 1 after substituting the difference distance into the saturation function. If the difference distance is 0 (the message has not been tampered with), then... , (Verification passed); if the difference distance is non-zero (the message has been tampered with), then , (Verification failed).

[0120] It should be noted that the final delivery weight The calculation formula is This is a binary variable (taking a value of 0 or 1) that combines the anti-replay verification result and the integrity verification result, used to determine whether the received message is ultimately delivered. It is obtained by adjusting the anti-replay reception weight. Weights for integrity verification Multiplication is performed only when... (Anti-replay verification passed) and When (integrity verification passes), (Delivery permitted); otherwise (Delivery refused).

[0121] It should be noted that the decrypted plaintext message It is the receiving gateway's handling of the encrypted payload. The original service message obtained after decryption contains service data, relevant header information, etc., and is consistent with the content of the inbound service message sent by the sender (ignoring IPsec encapsulation fields). It is obtained by the receiving gateway based on... Locate the corresponding SA configuration and use the same encryption algorithm and encryption key as the sender. For encrypted payload After performing the decryption operation and removing the padding fields, the decrypted plaintext message is obtained. This is the target data for the final delivery; only when the final delivery weight... Data is only output at specific times to ensure that the data delivered to upper-level business operations is legitimate, unaltered, and unreplayed.

[0122] It should be noted that the delivery data The calculation formula is This is the data stream that the receiving gateway ultimately outputs to the upper-layer services. It is obtained by determining the final delivery weight. With the decrypted plaintext message Performing a multiplication operation (logically a weighted gating output), when At that time, output a complete plaintext message. ;when At this time, all zero silent data is output (i.e., no valid business data is output).

[0123] It should be noted that the random cross-period arrival delay This delay is caused by the network layer multipath transmission structure (such as PRP / HSR protocol, primary / backup link switching). The difference between the actual arrival time and the expected arrival time of the message at the receiving end is the main cause of sequence number lag. Its value is a random non-negative real number, and its distribution range is determined by the characteristics of network redundancy switching; the maximum possible value does not exceed the maximum delay of network redundancy. For example, a message expected to arrive at the end of the second cycle may actually arrive at the beginning of the fourth cycle due to link switching, resulting in a cross-cycle delay. It is the sum of the length of two cycles and the remaining time within each cycle.

[0124] It should be noted that the original serial number lag... It is the encapsulation sequence number of a legitimate message when sequence number whitening is not performed. The distribution characteristics of the difference between the current maximum sequence number at the receiving end and the current maximum sequence number are as follows: Presented as a number of multi-source aggregations This refers to the lattice-based aggregation of the step size. The method for obtaining this information is the same as when this scheme is not used, obtained by statistically analyzing the difference between the received message sequence number and the maximum sequence number, for example, across-cycle delays. The lag of the original sequence number when spanning two complete cycles Approximately .

[0125] It should be noted that the sub-sequence number lag... The calculation formula is This is the sequence number lag of packets within each remainder sub-channel after performing sequence number whitening and remainder decomposition anti-replay verification. It only reflects the sequence drift within the corresponding channel. It is obtained by using the historical maximum sequence number of each remainder sub-channel at the receiving end. Subtract the encapsulation sequence number of the currently received message. For example, a certain sub-channel , ,but Lag from the original serial number The lattice-like aggregations are different. The range of values ​​is determined by the width of the parallel anti-replay window. The constraints result in smooth and controllable drift characteristics.

[0126] It should be noted that the floor function... It is a mathematical operation that rounds the input real number down to the nearest integer, and its function is to quantify cross-cycle delay. The number of complete synchronous sampling cycles spanned. Primarily used in the scheme to calculate the lag of the original sequence number. Approximate value, for example when When the value is 2 after rounding down, it means the delay spans two complete cycles; when When the time is rounded down to 3, it spans 3 complete cycles.

[0127] It should be noted that the modulo operation is a mathematical operation that divides one integer by another and takes the remainder. Its core function is to constrain the input value within a fixed range. In this scheme, it is mainly used to generate multi-way sharding indexes. ( Matching the remainder channel with the receiver ( For example, the intermediate hash value is 100. hour, ; Package serial number , hour, This operation ensures a one-to-one correspondence between sharding indexes and channel shards, enabling uniform distribution and precise routing of service flows.

[0128] like Figure 2 As shown, Figure 2 The system presents the overall architecture and data flow of a multi-source power data security transmission and encryption analysis system, including station-side business sources, sending-end gateways, redundant transmission paths, IPsec encrypted tunnels, receiving-end gateways, and dispatch-side business systems, and relies on the wired power communication backbone network to achieve data transmission. The station deploys multiple service sources with output periodic streams (such as PMU synchronization phasor devices, SCADA terminals, etc.). These service sources achieve time synchronization based on a unified time source, forming a multi-source phase-locked loop (PLL) fan-in traffic pattern, which converges to the sending gateway. The sending gateway, as the data processing and encryption entry point, receives all station periodic streams, performs sequence number timing smoothing and IPsec security encapsulation, and then transmits the data through two parallel redundant paths (primary path and backup path). The redundant paths are constructed by parallel redundancy protocols or high-availability seamless redundancy protocols to ensure high reliability of power communication and avoid service interruption due to single point of failure. Data is transmitted end-to-end with encryption at the network layer through an IPsec tunnel. The tunnel encapsulation includes information such as the ESP sequence number, encrypted payload, and integrity check value. The receiving gateway parses the received encrypted data and performs channel-specific verification through a multi-channel parallel anti-replay window with the same number of sources as the aggregation. After eliminating the risk of clustered data loss, the legitimate plaintext data is delivered to the dispatching-side business system, ultimately achieving secure, continuous, and reliable transmission of critical power business data.

[0129] like Figure 3 As shown, Figure 3The illustration shows a comparison of traffic patterns and verification results before and after the implementation of this invention: the whitened portion on the left reveals the technical problem, showing that due to the multi-source phase-locked loop fan-in characteristics of power services, messages arrive in highly dense clusters during each synchronization sampling period. This burst of lattice lag impacts the boundary of the anti-replay window, leading to a structural risk of periodic packet loss. The whitened portion on the right demonstrates the technical solution, which uses discrete time slot scheduling to force the originally clustered messages to be evenly distributed into discrete transmission time slots (i.e., sequence number whitening), transforming the traffic pattern into smooth drift. This is combined with the parallel anti-replay window (i.e., remainder decomposition) built by the receiver based on the remainder channel for independent verification, thereby fundamentally eliminating the packet loss risk caused by traffic bursts and window boundary conflicts.

[0130] It is important to note that all input data described in this solution is acquired in real-time through legal and compliant hardware interfaces with the user's full knowledge, explicit consent, and active cooperation. The preset parameters, prior constants, and statistical means are all derived from publicly available scientific literature data, de-identified general research datasets, or calibration data from laboratory environments, and do not contain any unauthorized sensitive third-party information. The system's data processing is limited to local or volatile memory computation transmitted via encrypted channels. There is no illegal collection, theft, or retention of user biometric data or infringement of user privacy without the user's knowledge. All parameter calls and generation comply with the principles of data minimization, legality, legitimacy, and necessity.

[0131] The embodiments of this example have been described above. However, this example is not limited to the specific implementation methods described above. The specific implementation methods described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms based on the guidance of this example, and all of them are within the protection scope of this example.

Claims

1. A power multi-source data secure transmission and encrypted analysis system, characterized in that, Including the sending gateway and the receiving gateway: The sending gateway is configured to preset the number of multi-source aggregations and the synchronous sampling period parameters at the network layer, generate a multi-path fragmentation index for inbound service packets through deterministic mapping, schedule the packets to the corresponding discrete transmission time slots within the synchronous sampling period according to the multi-path fragmentation index, and perform secure encapsulation after completing the sequence number timing smoothing process. The receiving gateway is configured to establish a number of parallel anti-replay windows that are consistent with the number of multi-source aggregations, parse and encapsulate the sequence number of the received message and determine the fragment channel to which it belongs, and index it to the corresponding parallel anti-replay window to perform independent sub-channel anti-replay verification. The system degrades the aggregated congestion of sequence number lag through discrete time slot scheduling at the transmitting end, and eliminates the risk of periodic packet loss for the verification window through parallel anti-replay window at the receiving end.

2. The power multi-source data secure transmission and encryption analysis system according to claim 1, characterized in that, The network layer preset parameters in the sending gateway include: The number of multi-source aggregations is the number of concurrent periodic streams within the corresponding encrypted tunnel; The synchronous sampling period is the nominal reporting period of the corresponding business data; The width of the discrete transmission time slot is equal to the ratio obtained by dividing the synchronous sampling period by the number of multi-source aggregations; The maximum cross-cycle delay order is the rounded-up result of the ratio of the maximum network redundancy delay introduced by network redundancy switching to the synchronous sampling period.

3. The power multi-source data secure transmission and encryption analysis system according to claim 1, characterized in that, The mapping algorithm for generating multi-path fragmentation indexes by the sending gateway includes: Extract the five-tuple information of the inbound service message, wherein the five-tuple information includes the source Internet Protocol address, the destination Internet Protocol address, the transport layer protocol number, the source port, and the destination port; The quintuple information is concatenated and a cyclic hash operation is performed to obtain an intermediate hash value; Perform a modulo operation on the intermediate hash value with the number of multi-source aggregations, and use the remainder as the multi-path sharding index; wherein, the multi-path sharding index is used to logically bind the corresponding service message to a specific remainder track in the sequence space.

4. The power multi-source data secure transmission and encryption analysis system according to claim 3, characterized in that, The specific timing smoothing process by which the sending gateway schedules packets to discrete transmission time slots includes: Obtain the monotonic timestamp of the inbound service message arriving at the gateway; Calculate the quotient of the monotonic timestamp and the synchronous sampling period, and round the quotient down to obtain the period index; The phase offset is calculated by adding the multi-path fragmentation index to the value 0.5 and multiplying the sum by the width of the discrete transmission time slot. The product of the period index and the synchronous sampling period is added to the phase offset to determine the target transmission time of the corresponding service message; wherein, the target transmission time is used to align the transmission time of the service message to the center of a specific phase slot within the synchronous sampling period.

5. The power multi-source data secure transmission and encryption analysis system according to claim 4, characterized in that, The gating release mechanism for time slot scheduling performed by the sending gateway includes: A release gate variable is constructed, which is defined by a unit step indicator function, wherein the independent variable of the unit step indicator function is the difference between the current system time and the target transmission time; Real-time monitoring of the current system time; When the current system time is greater than or equal to the target transmission time, the release gate variable outputs a valid level, triggering the service message to enter the secure encapsulation process; When the current system time is less than the target transmission time, the release gate variable outputs an invalid level, keeping the service packet waiting in the queue.

6. The power multi-source data secure transmission and encryption analysis system according to claim 1, characterized in that, The method for calculating the window width of the parallel anti-replay window in the receiving gateway includes: Obtain the maximum latency of network redundancy introduced by network redundancy switching and the local scheduling jitter allowed by the sending gateway; Calculate the sum of the maximum network redundancy delay and the local scheduling jitter allowable, divide the sum by the synchronization sampling period, multiply the resulting quotient by the number of multi-source aggregations, and perform an up-rounding operation on the calculation result to obtain the smoothed sequence lag upper bound. Divide the smoothed sequence hysteresis upper bound by the number of multi-source aggregations, and perform an up-rounding operation on the result to determine the window width of the parallel anti-replay window; wherein, the window width is used to absorb the sequence number drift after smoothing degradation in the corresponding remainder sub-channel.

7. The power multi-source data secure transmission and encryption analysis system according to claim 1, characterized in that, The receiving gateway performs a state update process for channel-specific anti-replay verification, including: Read the historical maximum sequence number and the width of the current parallel anti-replay window; Calculate the difference between the encapsulation sequence number of the received message and the lower bound of the effective window, where the lower bound of the effective window is equal to the historical maximum sequence number minus the width of the parallel anti-replay window; Substitute the difference into the unit step indicator function to generate a binary anti-replay reception weight; Using the anti-replay reception weight, the larger of the historical maximum sequence number and the encapsulation sequence number, as well as the original value of the historical maximum sequence number, are weighted and summed to update the historical maximum sequence number.

8. The power multi-source data secure transmission and encryption analysis system according to claim 7, characterized in that, The delivery decision process, which incorporates integrity verification weights, includes: Message authentication code is calculated on the encrypted payload of the received message to obtain the locally calculated integrity check value; Calculate the difference distance between the locally calculated integrity check value and the integrity check value carried in the received message, and use a saturation function to map this difference distance into a binary integrity check weight; The integrity verification weight and the anti-replay reception weight are multiplied to generate the final delivery weight; Perform a multiplication operation between the final delivery weight and the decrypted plaintext message. When the final delivery weight is one, output the delivery data; when the final delivery weight is zero, output all-zero silent data.

9. The power multi-source data secure transmission and encryption analysis system according to claim 1, characterized in that, The network layer environment and message sequence characteristics of the system include: The network layer environment has a multipath transmission structure, which causes random cross-cycle arrival delays in received messages; wherein, the multipath transmission structure is introduced by at least one of a parallel redundancy protocol or a high-availability seamless redundancy protocol. The message sequence characteristics are as follows: before the sequence number whitening is performed, due to the multi-source phase-locked fan-in convergence within the synchronous sampling period, the sequence number lag of the legitimate message in the sequence space exhibits a lattice-like clustered distribution with the number of multi-source aggregations as the step size. The system uses the lattice-aware sequence number whitening and the remainder decomposition anti-replay verification to reshape the distribution of the sequence number hysteresis from lattice-based aggregation to a smooth and controllable drift within each remainder sub-window.

Images