Data confidential transmission system and method for task supervision system
Through the combination of segmentation module and cyclic encryption rotation factor generation module, the total number of transformation units and interconnection complexity are reduced, and the computing resource and layout complexity of the disc-type transformation units in the prior art is solved, and the calculation resources and layout complexity of the disk-type transformation units are realized. Simplified data encryption and output design.
Patent Information
- Application Number
- CN202410619335.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-05-19
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2044-05-19
AI Technical Summary
In the prior art, disc-type transformation units consume large-scale computing resources and complex layout, making them difficult to implement in hardware, especially on ASIC chips, resulting in increased cross-connection complexity and wiring complexity.
The combination of segmentation module, cyclic encryption rotation factor generation module and calculation module is adopted to decompose data and generate encryption rotation factor parallel encryption operations to reduce the total number of transformation units and interconnection complexity, avoid cross-connection, and simplify wiring design.
It effectively reduces the interconnection complexity between the total number of calculation units and the encryption units, avoids the increase in wiring complexity caused by scale expansion, simplifies output design, and saves coefficient storage units.
Smart Images

Figure CN118900170A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to a data confidentiality transmission system and method used in a task supervision system, belonging to the technical field of digital communication. Background Art
[0002] The Chinese invention patent with announcement number CN115622685B discloses a method, device and system for homomorphic encryption of private data. The method includes obtaining private data to be encrypted; determining an encryption key and a target multiplier corresponding to the encryption key, and performing parallel FFT on the encryption key and the target multiplier respectively based on a streaming multiprocessor in a graphics processor 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 an alternative product result of the first transformation result and the second transformation result; homomorphically encrypting the private data based on the encryption key and the target product result; the first transformation result is based on the following steps: The steps are as follows: based on the number of bits of the encryption key and the number of bits of 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 allocated to a streaming multiprocessor; for any round, based on the any round, the number of FFT points and the position of the polynomial coefficient allocated to each streaming multiprocessor in the polynomial, the rotation factor of each butterfly transform operation in the any round is determined, and multiple streaming multiprocessors are screened out, and based on the rotation factor of each butterfly transform operation in the any round and the multiple streaming multiprocessors, each butterfly transform operation in the any round is executed in parallel.
[0003] The above invention patent has the following disadvantages: The most disk-shaped transformation units are used. When N is large (for example, N=1024), there will be 5120 disk-shaped transformation units, which is difficult to use due to the limitation of computing resources. Another shortcoming is that even if the huge resources consumed by the disk-shaped transformation units themselves are not taken into account, the connection between the disk-shaped transformation units is also very complicated. The cross-connection makes the layout and routing of this solution very difficult or even difficult to implement in hardware implementation such as ASIC chips. The larger the scale (the larger N), the greater the complexity. Summary of the invention
[0004] In order to overcome the shortcomings of the prior art, the purpose of the present invention is to provide a data confidentiality transmission system and method for a task supervision system, which can effectively reduce the total number of conversion units used, and the interconnection between the conversion units is simple, avoiding the complexity of cross-connection, and does not increase the wiring complexity due to the expansion of scale.
[0005] To achieve the above-mentioned purpose, the present invention provides a data security transmission system for a task supervision system, which is characterized by comprising a segmentation module, a cyclic encryption rotation factor generation module and a calculation module, wherein: The segmentation module is configured to separate the 2 K The bit data is gradually decomposed into 2 K-N Group 2 N Bit data group, pair 2 N The bit data groups are reordered according to the self-set 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; The cyclic encryption rotation factor generation module is configured to sequentially generate N encryption rotation factors , n=1,2,…,N; p=0,1,2,…,2 N -1; The computing module includes N-level computing submodules, and the n-th level computing submodule includes 2 N-n Basic encryption units, each of which includes two input terminals and one output terminal; 2 of the first-level computing submodule N-n Basic encryption unit parallel input 2 N Bit encrypted data sequence The output of the basic encryption unit of the computing submodule of the n-1th level is used as the input of the basic encryption unit of the computing submodule of the nth level, and the encryption rotation factors are used in turn. Perform encryption operations until the Nth level computing submodule serially outputs the ciphertext data sequence to be transmitted .
[0006] Preferably, each basic encryption unit includes a delay device, a multiplier and an adder, wherein 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 device, 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, and the output terminal of the adder provides the input signal to the basic encryption unit of the next-level computing submodule or as the ciphertext data to be transmitted.
[0007] Preferably, N=3, The calculation module includes 3 levels of calculation submodules, and the nth level calculation submodule includes 2 N-n 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 inputs , The first input terminal of the first adder is input through the first delay device; the second input terminal of the first basic encryption unit is input , With the encryption twiddle factor The signals are multiplied in a first multiplier and then input to a first adder; The first input terminal of the second basic encryption unit inputs , The second input terminal of the first basic encryption unit inputs , With the encryption twiddle factor Multiplied in the second multiplier and then input to the second adder; The first input terminal of the third basic encryption unit inputs , The first input terminal of the third adder is input through the third delay device; the second input terminal of the third basic encryption unit is input , With the encryption twiddle factor Multiplied in a third multiplier and then input to a third adder; The first input terminal of the fourth basic encryption unit inputs , The fourth delay device is input to the first input terminal of the fourth adder; the second input terminal of the fourth basic encryption unit is input , With the encryption twiddle factor Multiplied in a fourth multiplier and then input to a fourth adder; The second-level calculation submodule includes a fifth basic encryption unit and a sixth basic encryption unit, wherein the first input end of the fifth basic encryption unit inputs the output signal of the first adder , The output signal of the second adder is input to the second input terminal of the fifth basic encryption unit. , With the encryption twiddle factor The first input terminal of the sixth basic encryption unit inputs the output signal of the third adder. , The output signal of the fourth adder is input to the second input end of the sixth basic encryption unit. , With the encryption twiddle factor The multiplication is performed in a sixth multiplier and then input into a sixth adder; The third-level calculation submodule includes a seventh basic encryption unit, and the first input end of the seventh basic encryption unit inputs the output signal of the fifth adder , The output signal of the sixth adder is input to the second input end of the seventh basic encryption unit. , With the encryption twiddle factor In the multiplier M 31 The ciphertext data is multiplied and then input to the seventh adder, and the seventh adder outputs the ciphertext data to be transmitted. .
[0008] To achieve the above-mentioned purpose, the present invention also provides a data confidentiality transmission method for a task supervision system, which is characterized by comprising the following steps: 2 to be transmitted K The bit data is gradually decomposed into 2 K-N Group 2 N Bit data, pair 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; Generate N encrypted rotation factors , n=1,2,…,N; =0, 1, 2, …, 2 N -1 2 N Bit encrypted data sequence 2 parallel inputs to the 1st level computing submodule N-n The output of the basic encryption unit of the computing submodule of the n-1th level is used as the input of the basic encryption unit of the computing submodule of the nth level, and the encryption rotation factors are used in sequence. Perform encryption operations until the Nth level computing submodule serially outputs the ciphertext data sequence to be transmitted .
[0009] Preferably, the basic encryption unit includes a delay device, a multiplier and an adder, wherein 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 device, 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, and the output terminal of the adder provides the input signal to the basic encryption unit of the next-level computing submodule.
[0010] Preferably, N=3, The calculation module performs the following processing: S01: Input a set of encrypted data sequence ; S02: p←0 S03: input to the first input terminal of the first basic encryption unit, The first input terminal of the first adder of the first basic encryption unit is input through the first delay device; input to the second input terminal of the first basic encryption unit, With the encryption twiddle factor The signals are multiplied in a first multiplier and then input to a first adder; Will input to the first input terminal of the second basic encryption unit, Input to the first input terminal of the second adder through the second delay device; input to the second input terminal of the second basic encryption unit, With the encryption twiddle factor Multiplied in the second multiplier and then input to the second adder; Will input to the first input terminal of the third basic encryption unit, Input to the first input terminal of the third adder through the third delay device; input to the second input terminal of the third basic encryption unit, With the encryption twiddle factor Multiplied in a third multiplier and then input to a third adder; Will input to the first input terminal of the fourth basic encryption unit, Input to the first input terminal of the fourth adder through the fourth delay device; input to the second input terminal of the fourth basic encryption unit, With the encryption twiddle factor Multiplied in a fourth multiplier and then input to a fourth adder; S04: The output signal of the first adder The first input to the fifth basic encryption unit, The output signal of the second adder is input to the first input terminal of the fifth adder through the fifth delay device; Input to the second input terminal of the fifth basic encryption unit, With the encryption twiddle factor The multiplication is performed in a fifth multiplier and then input into a fifth adder; The output signal of the third adder Input to the first input terminal of the sixth basic encryption unit, The output signal of the fourth adder is input to the first input terminal of the sixth adder through the sixth delay device; input to the second input terminal of the sixth basic encryption unit, With the encryption twiddle factor The multiplication is performed in a sixth multiplier and then input into a sixth adder; S05: Output signal of the fifth adder Input to the first input terminal of the seventh basic encryption unit, The output signal of the sixth adder is input to the first input terminal of the seventh adder through the seventh delay device; Input to the second input terminal of the seventh basic encryption unit, With the encryption twiddle factor The data are multiplied in the seventh multiplier and then input to the seventh adder, which outputs the ciphertext data to be transmitted. ; S06: p←p+1, and determine whether p is equal to 2 N If not, return to step S03; if p is equal to 2 N , then return to step S01 and input the next set of encrypted data sequence.
[0011] Compared with the prior art, the data confidentiality transmission system and method provided by the present invention in the task supervision system has the following beneficial effects: The total number of computing units used is effectively reduced. The interconnection between encryption units is simple, avoiding the complexity of cross-connection and not increasing the wiring complexity due to the expansion of scale. If a cascade pipeline processing method is adopted, the scale of storage units between each level can be effectively reduced. Whether array processing or cascade processing is used, there is no need to store the final calculation results, but direct serial output, which can save coefficient storage units and simplify the output design. BRIEF DESCRIPTION OF THE DRAWINGS
[0012] Figure 1 It is a block diagram of the composition of the data confidentiality transmission system in the task supervision system provided by the first embodiment of the present invention.
[0013] Figure 2 It is a block diagram of the composition of a data security transmission system in a task supervision system provided by the second embodiment of the present invention.
[0014] Figure 3 It is a block diagram of the composition of a data security transmission system in a task supervision system provided by the third embodiment of the present invention. DETAILED DESCRIPTION
[0015] In order to make the technical problems, technical solutions and beneficial effects to be solved by the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention. First embodiment
[0016] Figure 1 is a block diagram of a data security transmission system for a task supervision system provided by a first embodiment of the present invention, such as Figure 1 As shown, the data security transmission system for task supervision system provided by the first embodiment of the present invention includes a segmentation module, a cyclic encryption rotation factor generation module and a calculation module, wherein the segmentation module is configured to transmit 2 K The bit data is gradually decomposed into 2 K-N Group 2 N Bit data, pair 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; The cyclic encryption twiddle factor generation module is configured to generate 1 encryption twiddle factor , =0,1 The calculation module includes a primary calculation submodule, the calculation submodule has a basic encryption unit, the basic encryption unit includes two input terminals and one output terminal, and includes a delay device, a multiplier and an adder, wherein the signal input to the first input terminal of the basic encryption unit is provided to the first input terminal of the adder through the delay device, 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, and the output of the adder is the ciphertext data sequence to be transmitted. .
[0017] In the first embodiment, ; Basic encryption unit C 11 The first input terminal input , Through the delay device D 11 Input to adder P 11The first input terminal of the first basic encryption unit C 11 The second input terminal input , With the encryption twiddle factor In the multiplier M 11 The multiplication is then input to the adder P 11 , the output of the adder outputs the ciphertext data sequence to be transmitted .
[0018] The present invention also provides a data confidentiality transmission method for a task supervision system, which comprises the following steps: 2 to be transmitted K The bit data is gradually decomposed into 2 K-N Group 2 N Bit data, pair 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; Generate an encrypted rotation factor , =0,1; The calculation module performs the following processing: S01: Input a set of encrypted data sequence ; S02: p←0 S03: encrypt the 2-bit data sequence Input to the basic encryption unit of the calculation submodule, using the encryption rotation factor Perform encryption operations to obtain the data sequence to be transmitted ; S04: p←p+1, and determine whether p is equal to 2 N If not, return to step S03; if p is equal to 2 N , then return to step S01 and input the next set of data sequence to be encrypted.
[0019] The first embodiment of the present invention provides a data security transmission system for a task supervision system, which has direct serial output, can save coefficient storage units and simplify output design. Second embodiment
[0020] Figure 2 is a block diagram of a data security transmission system for a task supervision system provided by a second embodiment of the present invention, such as Figure 2As shown, the data security transmission system for the task supervision system provided by the second embodiment of the present invention includes: a segmentation module, a cyclic encryption rotation factor generation module and a calculation module, wherein: The segmentation module is configured to separate the 2 K The bit data is gradually decomposed into 2 K-N Group 2 N Bit data, pair 2 N The bit data is reordered according to the encryption rules to generate 2 2 Bit encrypted data sequence , N=2, K is an integer greater than or equal to N, =0, 1, 2, 3; The cyclic encryption twiddle factor generation module is configured to generate N encryption twiddle factors ,n=1,2, =0,1,2,3; The calculation module includes 2 levels of calculation submodules, and the nth level calculation submodule includes 2 N-n Basic encryption units, each of which includes two input terminals and one output terminal; 2 of the first-level computing submodule N-n Basic encryption unit input 2 N Bit encrypted data sequence The output of the basic encryption unit of the computing submodule of the n-1th level is used as the input of the basic encryption unit of the computing submodule of the nth level, and the encryption rotation factors are used in turn. Perform encryption operations until the Nth level computing submodule outputs the ciphertext data sequence .
[0021] In the second embodiment, each basic encryption unit includes a delay device, a multiplier and an adder, wherein a 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 device, a 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, and an output terminal of the adder provides an input signal to the basic encryption unit of the next-level computing submodule.
[0022] In the second embodiment, N=2, The calculation module includes 2 levels of calculation submodules, and the nth level calculation submodule includes 2 N-n Basic encryption units, n=1, 2; The first-level computing submodule includes a first basic encryption unit and a second basic encryption unit. The first input terminal of the first basic encryption unit inputs , Through the delay device D 11 Input to adder P11 The first input terminal of the first basic encryption unit is input at the second input terminal , With the encryption twiddle factor In the multiplier M 11 The multiplication is then input to the adder P 11 ; The first input terminal of the second basic encryption unit inputs , Through the delay device D 12 Input to adder P 12 The first input terminal of the second basic encryption unit is input , With the encryption twiddle factor In the multiplier M 12 The multiplication is then input to the adder P 12 ; The second-level calculation submodule includes a third basic encryption unit, a first input end of the third basic encryption unit inputs an adder P 11 Output signal , Through the delay device D 21 Input to adder P 21 The first input terminal; The second input terminal of the third basic encryption unit input , With the encryption twiddle factor In the multiplier M 21 The multiplication is then input to the adder P 21 , adder P 21 The output terminal inputs the encrypted data to be transmitted .
[0023] The second embodiment of the present invention also provides a data confidentiality transmission method for a task supervision system, which comprises the following steps: 2 to be transmitted K The bit data is gradually decomposed into 2 K-N Group 2 N Bit data, pair 2 N The bit data is reordered according to the encryption rules to generate 2 N Bit encrypted data sequence , N=2, K is an integer greater than or equal to N, =0,1,2,3 Generate N encrypted rotation factors ,n=1,2, =0,1,2,3; 2 N Bit encrypted data sequence 2 parallel inputs to the 1st level computing submodule N-n The output of the basic encryption unit of the computing submodule of the n-1th level is used as the input of the basic encryption unit of the computing submodule of the nth level, and the encryption rotation factors are used in sequence. Perform encryption operations until the Nth level computing submodule outputs the ciphertext data sequence .
[0024] In the second embodiment, the basic encryption unit includes a delay device, a multiplier and an adder, wherein 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 device, 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, and the output terminal of the adder provides the input signal to the basic encryption unit of the next-level computing submodule.
[0025] In the second embodiment, N=2, The calculation module performs the following processing: S01: Input a set of encrypted data sequence ; S02: p←0 S03: input to the first input terminal of the first basic encryption unit, Through the delay device D 11 Input to the adder P of the first basic encryption unit 11 The first input terminal of input to the second input terminal of the first basic encryption unit, With the encryption twiddle factor In the multiplier M 11 The multiplication is then input to the adder P 11 ; Will input to the first input terminal of the second basic encryption unit, Through the delay device D 12 Input to adder P 12 The first input terminal of input to the second input terminal of the second basic encryption unit, With the encryption twiddle factor In the multiplier M 12 The multiplication is then input to the adder P 12 ; S04: Add the adder P 11 Output signal The first input to the third basic encryption unit, Through the delay device D 21 Input to adder P 21The first input terminal of the adder P 12 Output signal input to the second input terminal of the third basic encryption unit, With the encryption twiddle factor In the multiplier M 21 The multiplication is then input to the adder P 21 , adder P 21 The output end inputs the ciphertext data to be transmitted ; S05: p←p+1, and determine whether p is equal to 2 N If not, return to step S03; if p is equal to 2 N , then return to step S01 and input the next encrypted data sequence.
[0026] The data confidentiality transmission system and method provided in the second embodiment of the present invention for the task supervision system effectively reduces the total number of computing units used, and the interconnection between the encryption units is simple, avoiding the complexity of cross-connection, and does not increase the wiring complexity due to the expansion of scale; if a cascade pipeline processing method is adopted, the scale of the storage units between each stage can be effectively reduced; there is no need to store the final calculation results, but directly output them in serial, which can save coefficient storage units and simplify the output design. Third embodiment
[0027] Figure 3 FIG. 3 is a block diagram of a data security transmission system for a task supervision system provided by a third embodiment of the present invention. Figure 3 As shown, the data confidentiality transmission system used in the task supervision system includes a segmentation module, a cyclic encryption rotation factor generation module and a calculation module, wherein: The segmentation module is configured to separate the 2 K The bit data is gradually decomposed into 2 K-N Group 2 N Bit data, pair 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 ; The cyclic encryption twiddle factor generation module is configured to generate N encryption twiddle factors , n=1,2,…,N; p=0,1,2,…,2 N -1; The computing module includes N-level computing submodules, and the n-th level computing submodule includes 2 N-nBasic encryption units, each of which includes two input terminals and one output terminal; 2 of the first-level computing submodule N-n Basic encryption unit parallel input 2 N Bit encrypted data sequence The output of the basic encryption unit of the computing submodule of the n-1th level is used as the input of the basic encryption unit of the computing submodule of the nth level, and the encryption rotation factors are used in turn. Perform encryption operations until the Nth level computing submodule serially outputs the ciphertext data sequence to be transmitted .
[0028] In the third embodiment, each basic encryption unit includes a delay device, a multiplier and an adder, wherein a 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 device, a 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, and an output terminal of the adder provides an input signal to the basic encryption unit of the next-level computing submodule.
[0029] N=3, The calculation module includes 3 levels of calculation submodules, and the nth level calculation submodule includes 2 N-n Basic encryption units, n=1, 2, 3; The first level computing submodule includes first to fourth basic encryption units, the first input end of the first basic encryption unit inputs , Through the delay device D 11 Input to adder P 11 The first input terminal of the first basic encryption unit is input at the second input terminal of the first basic encryption unit. , With the encryption twiddle factor In the multiplier M 11 The multiplication is then input to the adder P 11 ; The first input terminal of the second basic encryption unit inputs , Through the delay device D 12 Input to adder P 12 The first input terminal of the second basic encryption unit is input; the second input terminal of the second basic encryption unit is input , With the encryption twiddle factor In the multiplier M 12 The multiplication is then input to the adder P 12 ; The first input terminal of the third basic encryption unit inputs , Through the delay device D 13Input to adder P 13 The first input terminal of the third basic encryption unit is input at the second input terminal of the third basic encryption unit. , With the encryption twiddle factor In the multiplier M 13 The multiplication is then input to the adder P 13 ; The first input terminal of the fourth basic encryption unit inputs , Through the delay device D 14 Input to adder P 14 The first input terminal of the fourth basic encryption unit is input at the second input terminal of the fourth basic encryption unit. , With the encryption twiddle factor In the multiplier M 14 The multiplication is then input to the adder P 14 ; The second-level calculation submodule includes a fifth and a sixth basic encryption unit. The first input terminal of the fifth basic encryption unit is input to the adder P 11 Output signal , Through the delay device D 21 Input to adder P 21 The first input terminal of the fifth basic encryption unit; the second input terminal of the fifth basic encryption unit input adder P 21 Output signal , With the encryption twiddle factor In the multiplier M 21 The multiplication is then input to the adder P 21 ; The first input terminal of the sixth basic encryption unit is input to the adder P 13 Output signal , Through the delay device D 22 Input to adder P 22 The first input terminal of the sixth basic encryption unit C 22 The second input terminal of the adder P 14 Output signal , With the encryption twiddle factor In the multiplier M 22 The multiplication is then input to the adder P 22 ; The third-level calculation submodule includes a seventh basic encryption unit, a first input terminal of the seventh basic encryption unit inputs an adder P 21 Output signal , Through the delay device D 31Input to adder P 31 The second input terminal of the seventh basic encryption unit inputs the adder P 22 Output signal , With the encryption twiddle factor In the multiplier M 31 The multiplication is then input to the adder P 31 , adder P 31 Output the encrypted signal to be transmitted .
[0030] The third embodiment of the invention also provides a data confidentiality transmission method for a task supervision system, which includes the following steps: 2 to be transmitted K The bit data is gradually decomposed into 2 K-N Group 2 N Bit data, pair 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 ; Generate N encrypted rotation factors , n=1,2,…,N; p=0,1,2,…,2 N -1 2 N Bit encrypted data sequence 2 parallel inputs to the 1st level computing submodule N-n The output of the basic encryption unit of the computing submodule of the n-1th level is used as the input of the basic encryption unit of the computing submodule of the nth level, and the encryption rotation factors are used in sequence. The encryption operation is performed until the Nth level computing submodule serially outputs the ciphertext data sequence to be transmitted. , thereby obtaining the encrypted information to be transmitted.
[0031] In the third embodiment, the basic encryption unit includes a delay device, a multiplier and an adder, wherein 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 device, 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, and the output terminal of the adder provides the input signal to the basic encryption unit of the next-level computing submodule.
[0032] In the third embodiment, N=3, The calculation module performs the following processing: S01: Input a set of encrypted data sequence S02: First, let p←0; S03: input to the first input terminal of the first basic encryption unit, Through the delay device D 11 Input to the adder P of the first basic encryption unit 11 The first input terminal of input to the second input terminal of the first basic encryption unit, With the encryption twiddle factor In the multiplier M 11 The multiplication is then input to the adder P 11 ; Will input to the first input terminal of the second basic encryption unit, Through the delay device D 12 Input to adder P 12 The first input terminal of input to the second input terminal of the second basic encryption unit, With the encryption twiddle factor In the multiplier M 12 The multiplication is then input to the adder P 12 ; Will input to the first input terminal of the third basic encryption unit, Through the delay device D 13 Input to adder P 13 The first input terminal of Input to the third basic encryption unit C 13 The second input terminal, With the encryption twiddle factor In the multiplier M 13 The multiplication is then input to the adder P 13 ; Will input to the first input terminal of the fourth basic encryption unit, Through the delay device D 14 Input to adder P 14 The first input terminal of input to the second input terminal of the fourth basic encryption unit, With the encryption twiddle factor In the multiplier M 14 The multiplication is then input to the adder P 14 ; S04: Add the adder P 11 Output signal The first input to the fifth basic encryption unit, Through the delay device D 21 Input to adder P 21 The first input terminal of the adder P 21 Output signal Input to the second input terminal of the fifth basic encryption unit, With the encryption twiddle factor In the multiplier M 21 The multiplication is then input to the adder P 21 ; Add the adder P 13 Output signal Input to the first input terminal of the sixth basic encryption unit, Through the delay device D 22 Input to adder P 22 The first input terminal of the adder P 14 Output signal input to the second input terminal of the sixth basic encryption unit, With the encryption twiddle factor In the multiplier M 22 The multiplication is then input to the adder P 22 ; S05: Adder P 21 Output signal Input to the first input terminal of the seventh basic encryption unit, Through the delay device D 31 Input to adder P 31 The first input terminal of the adder P 22 Output signal Input to the second input terminal of the seventh basic encryption unit, With the encryption twiddle factor In the multiplier M 31 The multiplication is then input to the adder P 31 , adder P 31 Output the ciphertext data to be transmitted ; S06: p←p+1, and determine whether p is equal to 2 N If not, return to step S03; if p is equal to 2 N , then return to step S01 and input the next set of encrypted data sequence.
[0033] The data confidentiality transmission system and method provided in the third embodiment of the present invention for the task supervision system effectively reduces the total number of computing units used, and the interconnection between the encryption units is simple, avoiding the complexity of cross-connection, and does not increase the wiring complexity due to the expansion of scale; if a cascade pipeline processing method is adopted, the scale of the storage units between each stage can be effectively reduced; there is no need to store the final calculation results, but directly output them in serial, which can save coefficient storage units and simplify the output design.
[0034] Although the present invention is described by taking N=1, 2, 3 as an example, the present invention is not limited to level 1 encryption, level 2 encryption and level 3 encryption, and can be any level, that is, N can be any value.
[0035] The present invention also provides a computer program product, which uses computer language to compile the encryption method provided by the present invention into a program code that can be recognized by a computer, can be stored in a storage medium, and can be called and executed by one or more processors.
[0036] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of the present invention, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.
[0037] The above shows and describes the basic principles and main features of the present invention and the advantages of the present invention. It should be understood by those skilled in the art that the present invention is not limited to the above embodiments. The above embodiments and descriptions are only for explaining the principles of the present invention. Without departing from the spirit and scope of the present invention, the present invention may have various changes and improvements, which fall within the scope of the present invention to be protected. The scope of protection of the present invention is defined by the attached claims and their equivalents.
Claims
1. A data confidentiality transmission system used in a task supervision system, characterized in that: It includes a segmentation module, a cyclic encryption rotation factor generation module and a calculation module, wherein: The segmentation module is configured to separate the 2 K The bit data is gradually decomposed into 2 K-N Group 2 N Bit data group, pair 2 N The bit data groups are reordered according to the self-set 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; The cyclic encryption rotation factor generation module is configured to sequentially generate N encryption rotation factors , n=1,2,…,N; p=0,1,2,…,2 N -1; The computing module includes N-level computing submodules, and the n-th level computing submodule includes 2 N-n Basic encryption units, each of which includes two input terminals and one output terminal; 2 of the first-level computing submodule N-n Basic encryption unit parallel input 2 N Bit encrypted data sequence The output of the basic encryption unit of the computing submodule of the n-1th level is used as the input of the basic encryption unit of the computing submodule of the nth level, and the encryption rotation factors are used in turn. Perform encryption operations until the Nth level computing submodule serially outputs the ciphertext data sequence to be transmitted .
2. The data confidentiality transmission system used in the task supervision system according to claim 1 is characterized in that: Each basic encryption unit includes a delay device, a multiplier and an adder, wherein 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 device, 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, and the output terminal of the adder provides the input signal to the basic encryption unit of the next-level computing submodule or as the ciphertext data to be transmitted.
3. The data confidentiality transmission system used in the task supervision system according to claim 2 is characterized in that: N=3, The computing module includes 3 levels of computing submodules, and the nth level computing submodule includes 2 N-n 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 inputs , The first input terminal of the first adder is input through the first delay device; the second input terminal of the first basic encryption unit is input , With the encryption twiddle factor The signals are multiplied in a first multiplier and then input to a first adder; The first input terminal of the second basic encryption unit inputs , The second input terminal of the first basic encryption unit inputs , With the encryption twiddle factor Multiplied in the second multiplier and then input to the second adder; The first input terminal of the third basic encryption unit inputs , The first input terminal of the third adder is input through the third delay device; the second input terminal of the third basic encryption unit is input , With the encryption twiddle factor Multiplied in a third multiplier and then input to a third adder; The first input terminal of the fourth basic encryption unit inputs , The fourth delay device is input to the first input terminal of the fourth adder; the second input terminal of the fourth basic encryption unit is input , With the encryption twiddle factor Multiplied in a fourth multiplier and then input to a fourth adder; The second-level calculation submodule includes a fifth basic encryption unit and a sixth basic encryption unit, wherein the first input end of the fifth basic encryption unit inputs the output signal of the first adder , The output signal of the second adder is input to the second input terminal of the fifth basic encryption unit. , With the encryption twiddle factor The first input terminal of the sixth basic encryption unit inputs the output signal of the third adder. , The output signal of the fourth adder is input to the second input end of the sixth basic encryption unit. , With the encryption twiddle factor The multiplication is performed in a sixth multiplier and then input into a sixth adder; The third-level calculation submodule includes a seventh basic encryption unit, and the first input end of the seventh basic encryption unit inputs the output signal of the fifth adder , The output signal of the sixth adder is input to the second input end of the seventh basic encryption unit. , With the encryption twiddle factor In the multiplier M 31 The ciphertext data is multiplied and then input to the seventh adder, and the seventh adder outputs the ciphertext data to be transmitted. .
4. A data confidentiality transmission method for a task supervision system, characterized in that: The steps include: 2 to be transmitted K The bit data is gradually decomposed into 2 K-N Group 2 N Bit data, pair 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; Generate N encrypted rotation factors , n=1,2,…,N; =0, 1, 2, …, 2 N -1 2 N Bit encrypted data sequence 2 parallel inputs to the 1st level computing submodule N-n The output of the basic encryption unit of the computing submodule of the n-1th level is used as the input of the basic encryption unit of the computing submodule of the nth level, and the encryption rotation factors are used in sequence. Perform encryption operations until the Nth level computing submodule serially outputs the ciphertext data sequence to be transmitted .
5. The method for confidentiality transmission of data in a task supervision system according to claim 4, characterized in that: The basic encryption unit includes a delay device, a multiplier and an adder, wherein 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 device, 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, and the output terminal of the adder provides the input signal to the basic encryption unit of the next-level computing submodule.
6. The method for confidentiality transmission of data in a task supervision system according to claim 5, characterized in that: N=3, , and the calculation module performs the following processing: S01: Input a set of encrypted data sequence ; S02: p←0 S03: input to the first input terminal of the first basic encryption unit, The first input terminal of the first adder of the first basic encryption unit is input through the first delay device; input to the second input terminal of the first basic encryption unit, With the encryption twiddle factor The signals are multiplied in a first multiplier and then input to a first adder; Will input to the first input terminal of the second basic encryption unit, Input to the first input terminal of the second adder through the second delay device; input to the second input terminal of the second basic encryption unit, With the encryption twiddle factor Multiplied in the second multiplier and then input to the second adder; Will input to the first input terminal of the third basic encryption unit, Input to the first input terminal of the third adder through the third delay device; input to the second input terminal of the third basic encryption unit, With the encryption twiddle factor Multiplied in a third multiplier and then input to a third adder; Will input to the first input terminal of the fourth basic encryption unit, Input to the first input terminal of the fourth adder through the fourth delay device; input to the second input terminal of the fourth basic encryption unit, With the encryption twiddle factor Multiplied in a fourth multiplier and then input to a fourth adder; S04: The output signal of the first adder The first input to the fifth basic encryption unit, The output signal of the second adder is input to the first input terminal of the fifth adder through the fifth delay device; Input to the second input terminal of the fifth basic encryption unit, With the encryption twiddle factor The multiplication is performed in a fifth multiplier and then input into a fifth adder; The output signal of the third adder Input to the first input terminal of the sixth basic encryption unit, The output signal of the fourth adder is input to the first input terminal of the sixth adder through the sixth delay device; input to the second input terminal of the sixth basic encryption unit, With the encryption twiddle factor The multiplication is performed in a sixth multiplier and then input into a sixth adder; S05: Output signal of the fifth adder Input to the first input terminal of the seventh basic encryption unit, The output signal of the sixth adder is input to the first input terminal of the seventh adder through the seventh delay device; Input to the second input terminal of the seventh basic encryption unit, With the encryption twiddle factor The data are multiplied in the seventh multiplier and then input to the seventh adder, which outputs the ciphertext data to be transmitted. ; S06: p←p+1, and determine whether p is equal to 2 N If not, return to step S03; if p is equal to 2 N , then return to step S01 and input the next set of encrypted data sequence.
Citation Information
Patent Citations
FFT (Fast Fourier Transform) implementing device and method
CN104268124A
Configurable 128 point fast Fourier transform (FFT) device
CN105095152A
FFT processor based on radix-2SDF pipeline type and implementation method of FFT processor in ACO-OFDM system
CN112307423A
Number-theory transformation calculation circuit and method and computer equipment
CN113608717A
Methods of operating on data in a fully homomorphic encryption system using in-situ processing-in-memory and related circuits
US20230291541A1
