A data security transmission system and method for use in a task supervision system

Abstract

A data security transmission system and method for a task supervision system, belonging to the field of digital communication technology. In the system, a segmentation module is configured to segment the data to be transmitted into two... K Bit data is gradually decomposed into 2 K‑N Group 2 N Bit data group, for 2 N The bit data group is reordered according to the encryption rules to generate 2 N Bit-encrypted data sequence; cyclic encryption rotation factor generation module generates N encryption rotation factors; calculation module includes N levels of calculation sub-modules, the nth level calculation sub-module includes 2 N‑n Two basic encryption units, the first level computation submodule has 2. N‑n Input 2 basic encryption units N The bit-encrypted data sequence uses the output of the basic encryption unit of the (n-1)th level computational submodule as the input of the basic encryption unit of the nth level computational submodule. Encryption operations are performed sequentially using encryption rotation factors until the Nth level computational submodule serially outputs the ciphertext data sequence. This invention effectively reduces the total number of transformation units used and avoids the complexity of cross-connections.

Description

Technical Field

[0001] This invention relates to a data security transmission system and method for a task supervision system, belonging to the field of digital communication technology. Background Technology

[0002] Chinese invention patent CN115622685B discloses a method, apparatus, and system for homomorphic encryption of privacy data. The method includes: acquiring privacy data to be encrypted; determining an encryption key and a target multiplier corresponding to the encryption key; performing parallel FFTs on the encryption key and the target multiplier based on a streaming multiprocessor in a graphics processing unit (GPU) to obtain a first transformation result and a second transformation result; determining a target product result of the encryption key and the target multiplier based on candidate product results of the first and second transformation results; and performing homomorphic encryption on the privacy data based on the encryption key and the target product result. The first transformation result is based on the following steps... The following steps are obtained: Based on the number of bits in the encryption key and the number of bits in the target multiplier, the number of FFT points and the number of rounds of butterfly transform operations in the FFT are determined; the encryption key is represented as a polynomial, and each polynomial coefficient of the encryption key is assigned to a streaming multiprocessor; for any round, based on any round, the number of FFT points, and the position of the polynomial coefficients assigned to each streaming multiprocessor in the polynomial, the twitch factor of each butterfly transform operation in any round is determined, and multiple streaming multiprocessors are selected; based on the twitch factor of each butterfly transform operation in any round and the multiple streaming multiprocessors, each butterfly transform operation in any round is executed in parallel.

[0003] The aforementioned invention patent has the following disadvantages:

[0004] It uses the most dish-type transformation units. When N is large (e.g., N=1024), there will be 5120 dish-type transformation units, which is difficult to use under the constraints of computing resources. Another drawback is that even without considering the huge resources consumed by the dish-type transformation units themselves, the connection between the dish-type transformation units is very complex. The cross connection makes the layout and routing of this scheme very difficult, or even impossible, in hardware implementations such as ASIC chips. The larger the scale (the larger N is), the greater the complexity. Summary of the Invention

[0005] To overcome the shortcomings of existing technologies, the present invention aims to provide a data security transmission system and method for task supervision systems, which can effectively reduce the total number of transformation units used, simplify the interconnection between transformation units, avoid the complexity of cross-connections, and not increase wiring complexity due to scale expansion.

[0006] To achieve the aforementioned objective, this invention provides a data security transmission system for a task supervision system, characterized by comprising a segmentation module, a cyclic encryption rotation factor generation module, and a calculation module, wherein...

[0007] The segmentation module is configured to transmit 2 K Bit data is gradually decomposed into 2 K-N Group 2 N Bit data group, for 2 N The bit data group is reordered according to the self-defined encryption rules to generate 2 N Bit-encrypted data sequence K is an integer greater than or equal to N. =0, 1, 2, ..., 2 N -1;

[0008] The cyclic encryption rotation factor generation module is configured to generate N encryption rotation factors sequentially. , n=1,2,…,N; p=0,1,2,…,2 N -1;

[0009] The calculation module consists of N levels of calculation sub-modules, and the nth level calculation sub-module consists of 2 N-n There are 2 basic encryption units, each consisting of two inputs and one output; the first-level computational submodule has 2 N-n Two basic encryption units are input in parallel. N Bit-encrypted data sequence The output of the basic encryption unit of the (n-1)th level computational submodule is used as the input of the basic encryption unit of the nth level computational submodule, and the encryption rotation factor is used sequentially. Encryption operations are performed until the Nth level computation submodule serially outputs the ciphertext data sequence to be transmitted. .

[0010] Preferably, each basic encryption unit includes a delay unit, a multiplier, and an adder. The signal input to the first input terminal of the basic encryption unit is provided to the first input terminal of the adder via the delay unit. The signal input to the second input terminal of the basic encryption unit is multiplied by the encryption rotation factor and then provided to the second input terminal of the adder. The output terminal of the adder provides an input signal or serves as ciphertext data to be transmitted to the basic encryption unit of the next-level calculation submodule.

[0011] Preferably,

[0012] N=3,

[0013] The calculation module consists of 3 levels of calculation sub-modules, and the nth level calculation sub-module consists of 2... N-nThere are three basic encryption units, n=1, 2, 3;

[0014] The first-level computing submodule includes a first basic encryption unit, a second basic encryption unit, a third basic encryption unit, and a fourth basic encryption unit. The first input terminal of the first basic encryption unit receives... , The input is passed through the first delay unit to the first input terminal of the first adder; the input is passed through the second input terminal of the first basic encryption unit. , With encryption rotation factor The components are multiplied in the first multiplier and then input into the first adder;

[0015] The first input terminal of the second basic encryption unit is input , The input is passed through the second delay unit to the first input terminal of the second adder; the input is passed through the second input terminal of the first basic encryption unit. , With encryption rotation factor The products are multiplied in the second multiplier and then fed into the second adder;

[0016] The first input terminal of the third basic encryption unit is input , The input is passed through the third delay unit to the first input terminal of the third adder; the input is passed through the second input terminal of the third basic encryption unit. , With encryption rotation factor The products are multiplied in the third multiplier and then fed into the third adder;

[0017] The first input terminal of the fourth basic encryption unit is input. , The input is passed through the fourth delay unit to the first input terminal of the fourth adder; the input is passed through the second input terminal of the fourth basic encryption unit. , With encryption rotation factor The components are multiplied in the fourth multiplier and then fed into the fourth adder.

[0018] The second-level computation submodule includes a fifth basic encryption unit and a sixth basic encryption unit. The first input terminal of the fifth basic encryption unit receives the output signal of the first adder. , The signal is input to the first input terminal of the fifth adder via the fifth delay unit; the output signal of the second adder is input to the second input terminal of the fifth basic encryption unit. , With encryption rotation factor The signal is multiplied in the fifth multiplier and then input into the fifth adder; the first input of the sixth basic encryption unit receives the output signal of the third adder. , The signal is input to the first input terminal of the sixth adder via the sixth delay unit; the output signal of the fourth adder is input to the second input terminal of the sixth basic encryption unit. , With encryption rotation factor Multiply in the sixth multiplier and then input into the sixth adder;

[0019] The third-level computation submodule includes a seventh basic encryption unit, whose first input terminal receives the output signal of the fifth adder. , The signal is input to the first input terminal of the seventh adder via the seventh delay unit; the output signal of the sixth adder is input to the second input terminal of the seventh basic encryption unit. , With encryption rotation factor In multiplier M 31 The data is multiplied and then fed into the seventh adder, which outputs the ciphertext data to be transmitted. .

[0020] To achieve the aforementioned objective, the present invention also provides a method for secure data transmission in a task supervision system, characterized by comprising the following steps:

[0021] 2 to be transmitted K Bit data is gradually decomposed into 2 K-N Group 2 N Bit data, for 2 N The bit data is reordered according to the encryption rules to generate 2 N Bit-encrypted data sequence K is an integer greater than or equal to N. =0, 1, 2, ..., 2 N -1;

[0022] Generate N encrypted rotation factors n=1,2,…,N; =0, 1, 2, ..., 2 N -1

[0023] 2 N Bit-encrypted data sequence Parallel input of the first-level computation submodule 2 N-n Each basic encryption unit takes the output of the basic encryption unit of the (n-1)th level computational submodule as the input of the basic encryption unit of the nth level computational submodule, and then uses the encryption rotation factor sequentially. Encryption operations are performed until the Nth level computation submodule serially outputs the ciphertext data sequence to be transmitted. .

[0024] Preferably, the basic encryption unit includes a delay unit, a multiplier, and an adder. The signal input to the first input terminal of the basic encryption unit is provided to the first input terminal of the adder via the delay unit. The signal input to the second input terminal of the basic encryption unit is multiplied by the encryption rotation factor and then provided to the second input terminal of the adder. The output terminal of the adder provides an input signal to the basic encryption unit of the next-level calculation submodule.

[0025] Preferably,

[0026] N=3,

[0027] The following processing is performed through the calculation module:

[0028] S01: Input a set of encrypted data sequences ;

[0029] S02: p←0

[0030] S03: Will The input is given to the first input terminal of the first basic encryption unit. The first input is fed into the first input terminal of the first adder of the first basic encryption unit after passing through the first delay unit; The input is given to the second input terminal of the first basic encryption unit. With encryption rotation factor The components are multiplied in the first multiplier and then input into the first adder;

[0031] Will The input is given to the first input terminal of the second basic encryption unit. The input is fed to the first input terminal of the second adder via the second delay circuit; The input is given to the second input terminal of the second basic encryption unit. With encryption rotation factor The products are multiplied in the second multiplier and then fed into the second adder;

[0032] Will The input is given to the first input terminal of the third basic encryption unit. The input is passed through the third delay circuit to the first input terminal of the third adder; The input is given to the second input terminal of the third basic encryption unit. With encryption rotation factor The products are multiplied in the third multiplier and then fed into the third adder;

[0033] Will The input is given to the first input terminal of the fourth basic encryption unit. The input is passed through the fourth delay unit to the first input terminal of the fourth adder; The input is given to the second input terminal of the fourth basic encryption unit. With encryption rotation factor The components are multiplied in the fourth multiplier and then fed into the fourth adder.

[0034] S04: Convert the output signal of the first adder The first input to the fifth basic encryption unit, The signal is input to the first input terminal of the fifth adder via the fifth delay circuit; the output signal of the second adder is then processed. The input is given to the second input terminal of the fifth basic encryption unit. With encryption rotation factor Multiply in the fifth multiplier and then input into the fifth adder;

[0035] The output signal of the third adder Input to the first input terminal of the sixth basic encryption unit, The signal is input to the first input terminal of the sixth adder via the sixth delay unit; the output signal of the fourth adder is then processed. The input is given to the second input terminal of the sixth basic encryption unit. With encryption rotation factor Multiply in the sixth multiplier and then input into the sixth adder;

[0036] S05: Output signal of the fifth adder Input to the first input terminal of the seventh basic encryption unit, The signal is input to the first input terminal of the seventh adder via the seventh delay unit; the output signal of the sixth adder is then processed. The input is given to the second input terminal of the seventh basic encryption unit. With encryption rotation factor The data is multiplied in the seventh multiplier and then input into the seventh adder, which outputs the ciphertext data to be transmitted. ;

[0037] S06: p←p+1, and determine if p equals 2. N If not, return to step S03; if p equals 2 N If the condition is met, return to step S01 and input the next set of encrypted data sequences.

[0038] Compared with the prior art, the data confidential transmission system and method for task supervision provided by the present invention have the following beneficial effects:

[0039] It effectively reduces the total number of computing units used, and the interconnection between encryption units is simple, avoiding the complexity of cross-connection and not increasing wiring complexity due to scale expansion; if a cascaded pipeline processing method is adopted, the size of storage units between each level can be effectively reduced; regardless of whether array processing or cascaded processing is used, there is no need to store the final calculation result, but it is directly output serially, which can save coefficient storage units and simplify the output design. Attached Figure Description

[0040] Figure 1 This is a block diagram of the data confidential transmission system in the task supervision system provided in the first embodiment of the present invention.

[0041] Figure 2 This is a block diagram of a data confidential transmission system for a task supervision system provided in the second embodiment of the present invention.

[0042] Figure 3 This is a block diagram of a data confidential transmission system for a task supervision system provided in the third embodiment of the present invention. Detailed Implementation

[0043] To make the technical problems to be solved, the technical solutions, and the beneficial effects of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present invention and are not intended to limit the present invention.

[0044] First Embodiment

[0045] Figure 1 This is a block diagram of the data confidential transmission system in the task supervision system provided in the first embodiment of the present invention, as shown below. Figure 1 As shown, the data confidential transmission system for a task supervision system provided in the first embodiment of the present invention includes a segmentation module, a cyclic encryption rotation factor generation module, and a calculation module. The segmentation module is configured to segment the data to be transmitted into a data transmission module. K Bit data is gradually decomposed into 2 K-N Group 2 N Bit data, for 2 N The bit data is reordered according to the encryption rules to generate a 2-bit encrypted data sequence. N=1, K is an integer greater than or equal to N. =0,1;

[0046] The cyclic encryption rotation factor generation module is configured to generate one encryption rotation factor. , =0,1

[0047] The computation module includes a primary computation submodule, which contains one basic encryption unit. This basic encryption unit has two inputs and one output, comprising a delay unit, a multiplier, and an adder. The signal input to the first input of the basic encryption unit is provided to the first input of the adder via the delay unit. The signal input to the second input of the basic encryption unit is multiplied by an encryption rotation factor and then provided to the second input of the adder. The output of the adder is the ciphertext data sequence to be transmitted. .

[0048] In the first embodiment, ;

[0049] Basic encryption unit C 11 First input terminal , via delay D 11 Input to adder P 11 The first input terminal; the first basic encryption unit C 11 The second input terminal input , With encryption rotation factor In multiplier M 11 The two parts are multiplied and then input into the adder P. 11 The adder outputs the ciphertext data sequence to be transmitted. .

[0050] The present invention also provides a method for secure data transmission in a task supervision system, comprising the following steps:

[0051] 2 to be transmitted K Bit data is gradually decomposed into 2 K-N Group 2 N Bit data, for 2 N The bit data is reordered according to the encryption rules to generate 2 N Bit-encrypted data sequence N=1, K is an integer greater than or equal to N. =0,1;

[0052] Generate 1 encryption rotation factor , =0, 1;

[0053] The following processing is performed through the calculation module:

[0054] S01: Input a set of encrypted data sequences ;

[0055] S02: p←0

[0056] S03: Encrypt the 2-bit data sequence The basic encryption unit input into the computation submodule utilizes the encryption rotation factor. Encryption operations are performed to obtain the data sequence to be transmitted. ;

[0057] S04: p←p+1, and determine if p equals 2. N If not, return to step S03; if p equals 2 N If the condition is met, return to step S01 and input the next set of data sequences to be encrypted.

[0058] The data security transmission system for a task supervision system provided in the first embodiment of the present invention directly outputs data serially, which can save coefficient storage units and simplify the output design.

[0059] Second Embodiment

[0060] Figure 2 This is a block diagram of the data confidential transmission system in the task supervision system provided in the second embodiment of the present invention, as shown below. Figure 2 As shown, the data confidential transmission system for a task supervision system provided in the second embodiment of the present invention includes: a segmentation module, a cyclic encryption rotation factor generation module, and a calculation module, wherein,

[0061] The segmentation module is configured to transmit 2 K Bit data is gradually decomposed into 2 K-N Group 2 N Bit data, for 2 N The bit data is reordered according to the encryption rules to generate 2 2 Bit-encrypted data sequence N=2, and K is an integer greater than or equal to N. =0, 1, 2, 3;

[0062] The cyclic encryption rotation factor generation module is configured to generate N encryption rotation factors. n=1,2, =0, 1, 2, 3;

[0063] The calculation module includes two levels of calculation submodules, and the nth level calculation submodule includes 2 N-n There are 2 basic encryption units, each consisting of two inputs and one output; the first-level computational submodule has 2 N-n Input 2 basic encryption units N Bit-encrypted data sequence The output of the basic encryption unit of the (n-1)th level computational submodule is used as the input of the basic encryption unit of the nth level computational submodule, and the encryption rotation factor is used sequentially. Encryption operations are performed until the Nth-level computation submodule outputs the ciphertext data sequence. .

[0064] In the second embodiment, each basic encryption unit includes a delay unit, a multiplier, and an adder. The signal input to the first input terminal of the basic encryption unit is provided to the first input terminal of the adder via the delay unit. The signal input to the second input terminal of the basic encryption unit is multiplied by the encryption rotation factor and then provided to the second input terminal of the adder. The output terminal of the adder provides an input signal to the basic encryption unit of the next-level calculation submodule.

[0065] In the second embodiment,

[0066] N=2,

[0067] The calculation module includes two levels of calculation submodules, and the nth level calculation submodule includes 2 N-n There are 1, 2 basic encryption units;

[0068] The first-level computational submodule includes a first basic encryption unit and a second basic encryption unit. The first input terminal of the first basic encryption unit receives... , via delay D 11 Input to adder P 11 The first input terminal; the second input terminal of the first basic encryption unit. , With encryption rotation factor In multiplier M 11 The two parts are multiplied and then input into the adder P. 11 ;

[0069] The first input terminal of the second basic encryption unit is input , via delay D 12 Input to adder P 12 The first input terminal; the second input terminal of the second basic encryption unit. , With encryption rotation factor In multiplier M 12 The two parts are multiplied and then input into the adder P. 12 ;

[0070] The second-level computation submodule includes a third basic encryption unit, whose first input terminal is input to adder P. 11 output signal , via delay D 21 Input to adder P 21The first input terminal; the second input terminal of the third basic encryption unit. , With encryption rotation factor In multiplier M 21 The two parts are multiplied and then input into the adder P. 21 Adder P 21 The output terminal receives the encrypted data to be transmitted. .

[0071] The second embodiment of the present invention also provides a method for secure data transmission in a task supervision system, which includes the following steps:

[0072] 2 to be transmitted K Bit data is gradually decomposed into 2 K-N Group 2 N Bit data, for 2 N The bit data is reordered according to the encryption rules to generate 2 N Bit-encrypted data sequence N=2, and K is an integer greater than or equal to N. =0, 1, 2, 3

[0073] Generate N encrypted rotation factors n=1,2, =0,1,2,3;

[0074] 2 N Bit-encrypted data sequence Parallel input to the first-level computation submodule 2 N-n Each basic encryption unit takes the output of the basic encryption unit of the (n-1)th level computational submodule as the input of the basic encryption unit of the nth level computational submodule, and then uses the encryption rotation factor sequentially. Encryption operations are performed until the Nth-level computation submodule outputs the ciphertext data sequence. .

[0075] In the second embodiment, the basic encryption unit includes a delay unit, a multiplier, and an adder. The signal input to the first input terminal of the basic encryption unit is provided to the first input terminal of the adder via the delay unit. The signal input to the second input terminal of the basic encryption unit is multiplied by the encryption rotation factor and then provided to the second input terminal of the adder. The output terminal of the adder provides an input signal to the basic encryption unit of the next-level calculation submodule.

[0076] In the second embodiment, N=2,

[0077] The following processing is performed through the calculation module:

[0078] S01: Input a set of encrypted data sequences ;

[0079] S02: p←0

[0080] S03: Will The input is given to the first input terminal of the first basic encryption unit. via delay D 11 The adder P input to the first basic encryption unit 11 The first input terminal; The input is given to the second input terminal of the first basic encryption unit. With encryption rotation factor In multiplier M 11 The two parts are multiplied and then input into the adder P. 11 ;

[0081] Will The input is given to the first input terminal of the second basic encryption unit. via delay D 12 Input to adder P 12 The first input terminal; The input is given to the second input terminal of the second basic encryption unit. With encryption rotation factor In multiplier M 12 The two parts are multiplied and then input into the adder P. 12 ;

[0082] S04: Add the adder P 11 output signal The first input to the third basic encryption unit, via delay D 21 Input to adder P 21 The first input terminal; will add P 12 output signal The input is given to the second input terminal of the third basic encryption unit. With encryption rotation factor In multiplier M 21 The two parts are multiplied and then input into the adder P. 21 Adder P 21 The output terminal takes the encrypted data to be transmitted as input. ;

[0083] S05: p←p+1, and determine if p equals 2. N If not, return to step S03; if p equals 2 N If the condition is met, return to step S01 and input the next encrypted data sequence.

[0084] The data confidential transmission system and method for task supervision provided in the second embodiment of the present invention effectively reduces the total number of computing units used. The interconnection between encryption units is simple, avoiding the complexity of cross-connection, and the wiring complexity does not increase with the expansion of scale. If a cascaded pipeline processing method is adopted, the size of the storage units between each level can be effectively reduced. There is no need to store the final calculation result, but it is directly output serially, which can save coefficient storage units and simplify the output design.

[0085] Third Embodiment

[0086] Figure 3 This is a block diagram of the data confidential transmission system in the task supervision system provided in the third embodiment of the present invention, as shown below. Figure 3 As shown, the data security transmission system used in the task supervision system includes a segmentation module, a cyclic encryption rotation factor generation module, and a calculation module.

[0087] The segmentation module is configured to transmit 2 K Bit data is gradually decomposed into 2 K-N Group 2 N Bit data, for 2 N The bit data is reordered according to the encryption rules to generate 2 N Bit-encrypted data sequence N=3, K is an integer greater than or equal to N. =1, 1, 2, ..., 2 N ;

[0088] The cyclic encryption rotation factor generation module is configured to generate N encryption rotation factors. , n=1,2,…,N; p=0,1,2,…,2 N -1;

[0089] The calculation module consists of N levels of calculation sub-modules, and the nth level calculation sub-module consists of 2 N-n There are 2 basic encryption units, each consisting of two inputs and one output; the first-level computational submodule has 2 N-n Two basic encryption units are input in parallel. N Bit-encrypted data sequence The output of the basic encryption unit of the (n-1)th level computational submodule is used as the input of the basic encryption unit of the nth level computational submodule, and the encryption rotation factor is used sequentially. Encryption operations are performed until the Nth level computation submodule serially outputs the ciphertext data sequence to be transmitted. .

[0090] In the third embodiment, each basic encryption unit includes a delay unit, a multiplier, and an adder. The signal input to the first input terminal of the basic encryption unit is provided to the first input terminal of the adder via the delay unit. The signal input to the second input terminal of the basic encryption unit is multiplied by the encryption rotation factor and then provided to the second input terminal of the adder. The output terminal of the adder provides an input signal to the basic encryption unit of the next-level calculation submodule.

[0091] N=3,

[0092] The calculation module consists of 3 levels of calculation sub-modules, and the nth level calculation sub-module consists of 2... N-n There are three basic encryption units, n=1, 2, 3;

[0093] The first-level computational submodule includes the first to fourth basic encryption units, with the first input terminal of the first basic encryption unit receiving... , via delay D 11 Input to adder P 11 The first input terminal; the second input terminal of the first basic encryption unit. , With encryption rotation factor In multiplier M 11 The two parts are multiplied and then input into the adder P. 11 ;

[0094] The first input terminal of the second basic encryption unit is input , via delay D 12 Input to adder P 12 The first input terminal; the second input terminal of the second basic encryption unit. , With encryption rotation factor In multiplier M 12 The two parts are multiplied and then input into the adder P. 12 ;

[0095] The first input terminal of the third basic encryption unit is input , via delay D 13 Input to adder P 13 The first input terminal; the second input terminal of the third basic encryption unit. , With encryption rotation factor In multiplier M 13 The two parts are multiplied and then input into the adder P. 13 ;

[0096] The first input terminal of the fourth basic encryption unit is input. , via delay D 14 Input to adder P 14 The first input terminal; the second input terminal of the fourth basic encryption unit. , With encryption rotation factor In multiplier M 14 The two parts are multiplied and then input into the adder P. 14 ;

[0097] The second-level computation submodule includes the fifth and sixth basic encryption units. The first input of the fifth basic encryption unit is input to the adder P. 11 output signal , via delay D 21 Input to adder P 21 The first input terminal; the second input terminal of the fifth basic encryption unit is input to the adder P. 21 output signal , With encryption rotation factor In multiplier M 21 The two parts are multiplied and then input into the adder P. 21 ;

[0098] The first input terminal of the sixth basic encryption unit is input to the adder P. 13 output signal , via delay D 22 Input to adder P 22 The first input terminal; the sixth basic encryption unit C 22 The second input terminal is used to input the adder P. 14 output signal , With encryption rotation factor In multiplier M 22 The two parts are multiplied and then input into the adder P. 22 ;

[0099] The third-level computation submodule includes the seventh basic encryption unit, whose first input terminal is input to adder P. 21 output signal , via delay D 31 Input to adder P 31 The first input terminal; the second input terminal of the seventh basic encryption unit is input to the adder P. 22 output signal , With encryption rotation factor In multiplier M 31The two parts are multiplied and then input into the adder P. 31 Adder P 31 Output the encrypted signal to be transmitted .

[0100] The third embodiment of the invention also provides a method for secure data transmission in a task supervision system, which includes the following steps:

[0101] 2 to be transmitted K Bit data is gradually decomposed into 2 K-N Group 2 N Bit data, for 2 N The bit data is reordered according to the encryption rules to generate 2 N Bit-encrypted data sequence N=3, K is an integer greater than or equal to N. =1,2,…,2 N ;

[0102] Generate N encrypted rotation factors , n=1,2,…,N; p=0,1,2,…,2 N -1

[0103] 2 N Bit-encrypted data sequence Parallel input of the first-level computation submodule 2 N-n Each basic encryption unit takes the output of the basic encryption unit of the (n-1)th level computational submodule as the input of the basic encryption unit of the nth level computational submodule, and then uses the encryption rotation factor sequentially. The encryption operation continues until the Nth level computation submodule serially outputs the ciphertext data sequence to be transmitted. This allows us to obtain the encrypted information to be transmitted.

[0104] In the third embodiment, the basic encryption unit includes a delay unit, a multiplier, and an adder. The signal input to the first input terminal of the basic encryption unit is provided to the first input terminal of the adder via the delay unit. The signal input to the second input terminal of the basic encryption unit is multiplied by the encryption rotation factor and then provided to the second input terminal of the adder. The output terminal of the adder provides an input signal to the basic encryption unit of the next-level calculation submodule.

[0105] In the third embodiment, N=3,

[0106] The following processing is performed through the calculation module:

[0107] S01: Input a set of encrypted data sequences

[0108] S02: First, let p ← 0;

[0109] S03: Will The input is given to the first input terminal of the first basic encryption unit. via delay D 11 The adder P input to the first basic encryption unit 11 The first input terminal; The input is given to the second input terminal of the first basic encryption unit. With encryption rotation factor In multiplier M 11 The two parts are multiplied and then input into the adder P. 11 ;

[0110] Will The input is given to the first input terminal of the second basic encryption unit. via delay D 12 Input to adder P 12 The first input terminal; The input is given to the second input terminal of the second basic encryption unit. With encryption rotation factor In multiplier M 12 The two parts are multiplied and then input into the adder P. 12 ;

[0111] Will The input is given to the first input terminal of the third basic encryption unit. via delay D 13 Input to adder P 13 The first input terminal; Input to the third basic encryption unit C 13 The second input terminal, With encryption rotation factor In multiplier M 13 The two parts are multiplied and then input into the adder P. 13 ;

[0112] Will The input is given to the first input terminal of the fourth basic encryption unit. via delay D 14 Input to adder P 14 The first input terminal; The input is given to the second input terminal of the fourth basic encryption unit. With encryption rotation factor In multiplier M 14 The two parts are multiplied and then input into the adder P. 14 ;

[0113] S04: Add the adder P 11 output signal The first input to the fifth basic encryption unit, via delay D 21 Input to adder P 21 The first input terminal; will add P 21 output signal The input is given to the second input terminal of the fifth basic encryption unit. With encryption rotation factor In multiplier M 21 The two parts are multiplied and then input into the adder P. 21 ;

[0114] Adder P 13 output signal Input to the first input terminal of the sixth basic encryption unit, via delay D 22 Input to adder P 22 The first input terminal; will add P 14 output signal The input is given to the second input terminal of the sixth basic encryption unit. With encryption rotation factor In multiplier M 22 The two parts are multiplied and then input into the adder P. 22 ;

[0115] S05: Adder P 21 output signal Input to the first input terminal of the seventh basic encryption unit, via delay D 31 Input to adder P 31 The first input terminal; will add P 22 output signal The input is given to the second input terminal of the seventh basic encryption unit. With encryption rotation factor In multiplier M 31 The two parts are multiplied and then input into the adder P. 31 Adder P 31 Output the ciphertext data to be transmitted ;

[0116] S06: p←p+1, and determine if p equals 2. N If not, return to step S03; if p equals 2 N If the condition is met, return to step S01 and input the next set of encrypted data sequences.

[0117] The data confidential transmission system and method for task supervision provided in the third embodiment of the present invention effectively reduces the total number of computing units used. The interconnection between encryption units is simple, avoiding the complexity of cross-connection, and the wiring complexity does not increase with the expansion of scale. If a cascaded pipeline processing method is adopted, the size of the storage units between each level can be effectively reduced. There is no need to store the final calculation result, but it is directly output serially, which can save coefficient storage units and simplify the output design.

[0118] Although this invention is illustrated using N=1, 2, 3 as examples, it is not limited to level 1 encryption, level 2 encryption, and level 3 encryption; it can be any level, meaning N can be any value.

[0119] The present invention also provides a computer program product, which uses a computer language to compile the encryption method provided by the present invention into computer-readable program code, which can be stored in a storage medium and can be executed by one or more processors.

[0120] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this invention, "a plurality of" means two or more, unless otherwise explicitly specified.

[0121] The foregoing has shown and described the basic principles, main features, and advantages of the present invention. Those skilled in the art should understand that the present invention is not limited to the above embodiments. The embodiments and descriptions in the specification are merely illustrative of the principles of the invention. Various changes and modifications can be made to the invention without departing from its spirit and scope, and all such changes and modifications fall within the scope of the present invention as claimed. The scope of protection of this invention is defined by the appended claims and their equivalents.

Claims

1. A data security transmission system for use in a task supervision system, characterized in that, It includes a segmentation module, a cyclic encryption rotation factor generation module, and a calculation module, among which, The segmentation module is configured to transmit 2 K Bit data is gradually decomposed into 2 K-N Group 2 N Bit data group, for 2 N The bit data group is reordered according to the self-defined encryption rules to generate 2 N Bit-encrypted data sequence K is an integer greater than or equal to N, where k = 0, 1, 2, ..., 2 N -1; The cyclic encryption rotation factor generation module is configured to generate N encryption rotation factors sequentially. ,n=1,2,…,N;p=0,1,2,…,2 N -1; The calculation module consists of N levels of calculation sub-modules, and the nth level calculation sub-module consists of 2 N-n There are 2 basic encryption units, each consisting of two inputs and one output; the first-level computational submodule has 2 N-n Two basic encryption units are input in parallel. N Bit-encrypted data sequence The output of the basic encryption unit of the (n-1)th level computational submodule is used as the input of the basic encryption unit of the nth level computational submodule, and the encryption rotation factor is used sequentially. Encryption operations are performed until the Nth level computation submodule serially outputs the ciphertext data sequence to be transmitted. ; Each basic encryption unit includes a delay unit, a multiplier, and an adder. The signal input to the first input terminal of the basic encryption unit is provided to the first input terminal of the adder via the delay unit. The signal input to the second input terminal of the basic encryption unit is multiplied by the encryption rotation factor and then provided to the second input terminal of the adder. The output terminal of the adder provides an input signal to the basic encryption unit of the next-level calculation submodule or serves as ciphertext data to be transmitted.

2. The data secure transmission system for a task supervision system according to claim 1, characterized in that, N=3, The calculation module includes three levels of calculation sub-modules, and the nth level calculation sub-module includes 2... N-n There are three basic encryption units, n=1, 2, 3; The first-level computing submodule includes a first basic encryption unit, a second basic encryption unit, a third basic encryption unit, and a fourth basic encryption unit. The first input terminal of the first basic encryption unit receives... , The input is passed through the first delay unit to the first input terminal of the first adder; the input is passed through the second input terminal of the first basic encryption unit. , With encryption rotation factor The components are multiplied in the first multiplier and then input into the first adder; The first input terminal of the second basic encryption unit is input , The input is passed through the second delay unit to the first input terminal of the second adder; the input is passed through the second input terminal of the first basic encryption unit. , With encryption rotation factor The products are multiplied in the second multiplier and then fed into the second adder; The first input terminal of the third basic encryption unit is input , The input is passed through the third delay unit to the first input terminal of the third adder; the input is passed through the second input terminal of the third basic encryption unit. , With encryption rotation factor The products are multiplied in the third multiplier and then fed into the third adder; The first input terminal of the fourth basic encryption unit is input. , The input is passed through the fourth delay unit to the first input terminal of the fourth adder; the input is passed through the second input terminal of the fourth basic encryption unit. , With encryption rotation factor The components are multiplied in the fourth multiplier and then fed into the fourth adder. The second-level computation submodule includes a fifth basic encryption unit and a sixth basic encryption unit. The first input terminal of the fifth basic encryption unit receives the output signal of the first adder. , The signal is input to the first input terminal of the fifth adder via the fifth delay unit; the output signal of the second adder is input to the second input terminal of the fifth basic encryption unit. , With encryption rotation factor The signal is multiplied in the fifth multiplier and then input into the fifth adder; the first input of the sixth basic encryption unit receives the output signal of the third adder. , The signal is input to the first input terminal of the sixth adder via the sixth delay unit; the output signal of the fourth adder is input to the second input terminal of the sixth basic encryption unit. , With encryption rotation factor Multiply in the sixth multiplier and then input into the sixth adder; The third-level computation submodule includes a seventh basic encryption unit, whose first input terminal receives the output signal of the fifth adder. , The signal is input to the first input terminal of the seventh adder via the seventh delay unit; the output signal of the sixth adder is input to the second input terminal of the seventh basic encryption unit. , With encryption rotation factor The data is multiplied in the seventh multiplier and then input into the seventh adder, which outputs the ciphertext data to be transmitted. .

3. A method for secure data transmission in a task supervision system, characterized in that, The steps include: transferring the 2... K Bit data is gradually decomposed into 2 K-N Group 2 N Bit data, for 2 N The bit data is reordered according to the encryption rules to generate 2 N Bit-encrypted data sequence K is an integer greater than or equal to N, where k = 0, 1, 2, ..., 2 N -1; Generate N encrypted rotation factors ,n=1,2,…,N;=0,1,2,…,2 N -1; 2 N Bit-encrypted data sequence Parallel input of the first-level computation submodule 2 N-n Each basic encryption unit takes the output of the basic encryption unit of the (n-1)th level computational submodule as the input of the basic encryption unit of the nth level computational submodule, and then uses the encryption rotation factor sequentially. Encryption operations are performed until the Nth level computation submodule serially outputs the ciphertext data sequence to be transmitted. ; The basic encryption unit includes a delay unit, a multiplier, and an adder. The signal input to the first input terminal of the basic encryption unit is provided to the first input terminal of the adder via the delay unit. The signal input to the second input terminal of the basic encryption unit is multiplied by the encryption rotation factor and then provided to the second input terminal of the adder. The output terminal of the adder provides the input signal to the basic encryption unit of the next-level calculation submodule.

4. The data confidential transmission method for a task supervision system according to claim 3, characterized in that, N=3, The following processing is performed through the calculation module: S01: Input a set of encrypted data sequences ; S02:p←0 S03: Will The input is given to the first input terminal of the first basic encryption unit. The first input is fed into the first input terminal of the first adder of the first basic encryption unit after passing through the first delay unit; The input is given to the second input terminal of the first basic encryption unit. With encryption rotation factor The components are multiplied in the first multiplier and then input into the first adder; Will The input is given to the first input terminal of the second basic encryption unit. The input is fed to the first input terminal of the second adder via the second delay circuit; The input is given to the second input terminal of the second basic encryption unit. With encryption rotation factor The products are multiplied in the second multiplier and then fed into the second adder; Will The input is given to the first input terminal of the third basic encryption unit. The input is passed through the third delay circuit to the first input terminal of the third adder; The input is given to the second input terminal of the third basic encryption unit. With encryption rotation factor The products are multiplied in the third multiplier and then fed into the third adder; Will The input is given to the first input terminal of the fourth basic encryption unit. The input is passed through the fourth delay unit to the first input terminal of the fourth adder; The input is given to the second input terminal of the fourth basic encryption unit. With encryption rotation factor The components are multiplied in the fourth multiplier and then fed into the fourth adder. S04: Convert the output signal of the first adder The first input to the fifth basic encryption unit, The signal is input to the first input terminal of the fifth adder via the fifth delay circuit; the output signal of the second adder is then processed. The input is given to the second input terminal of the fifth basic encryption unit. With encryption rotation factor Multiply in the fifth multiplier and then input into the fifth adder; The output signal of the third adder Input to the first input terminal of the sixth basic encryption unit, The signal is input to the first input terminal of the sixth adder via the sixth delay unit; the output signal of the fourth adder is then processed. The input is given to the second input terminal of the sixth basic encryption unit. With encryption rotation factor Multiply in the sixth multiplier and then input into the sixth adder; S05: Output signal of the fifth adder Input to the first input terminal of the seventh basic encryption unit, The signal is input to the first input terminal of the seventh adder via the seventh delay unit. The output signal of the sixth adder The input is given to the second input terminal of the seventh basic encryption unit. With encryption rotation factor The data is multiplied in the seventh multiplier and then input into the seventh adder, which outputs the ciphertext data to be transmitted. ; S06: p ← p + 1, and determine if p equals 2. N If not, return to step S03; if p equals 2 N If the condition is met, return to step S01 and input the next set of encrypted data sequences.

Images