TWI396149B - Method and apparatus for stream cryptography with multilayer diffusion - Google Patents

Description

Multi-layer diffusion stream encryption and decryption method and device

The invention belongs to a stream encryption and decryption method and device. More particularly, the present invention relates to a diffusion mechanism that performs on stream bit encryption and decryption, unlike a particular polynomial and shift operation of the prior art, which is combined by a series of elastically variable diffusion functions, and A diffusion medium that can be manipulated within the diffusion function.

The patent application filed by the applicant is referred to the previous invention application: "Multilayer diffusion encryption and decryption method", application number 98108364, submitted on March 16, 1998, the reference case is a repeated implementation of a positional diffusion function A ( k ₁ , k ₂ ,..., k _K ) ' = A ⊕ Ad _{1 k} ⊕ Ad _{2 k} ⊕...⊕ Ad _Kk ⊕ S , and the encryption and decryption of the position is completed via a complete cycle period T , where T = 2 ^U+1 , U = [log ₂ u ], and u is determined by the size of the dimension, u = max( d ₁ , d ₂ ,..., d _K ).

The invention is applied to stream encryption and decryption, emphasizing that a plurality of diffusion functions form a maximum cycle period, and the corresponding multiple positions are p ₁ , p ₂ , ... p _k , and the symbols are A F( p ₁ , p ₂ ,... p _k ), and the diffusion function of a position is represented by A F( i ₁ , i ₂ ,... i _m ), and further, it will be described as A more delicately. A diffusion function F( i ₁ , i ₂ ,... i _m ).

The invention is applied to a diffusion mechanism, that is, embedding a diffusion medium with a plurality of diffusion functions to generate a maximum cycle period and a nonlinear complexity; and, in the execution process, a serial process with a simple design is used, and further, Time-saving parallel processing, even with hardware devices, for faster computing speeds. The steps of the encryption and decryption are as follows: (a) selecting a diffusion mechanism, a diffusion region and a diffusion medium; (b) the diffusion region is set to an initial value via an input password; (c) performing the diffusion mechanism to obtain a new one. Diffusion region value; (d) sequentially input a plaintext/ciphertext stream bit; (e) output a ciphertext/plaintext stream bit, that is, the plaintext/ciphertext stream bit XOR of the diffusion region value One bit; (f) return to step (c) until the encryption and decryption is completed.

The first figure shows a schematic flow diagram of the present invention, which includes the steps of: selecting a diffusion region, a diffusion medium, and a diffusion mechanism 100 ; initializing the diffusion region 200 via an input password; and performing the diffusion mechanism to obtain the diffusion region The new value 300 ; sequentially input a plaintext/ciphertext stream bit 400 ; output a ciphertext/plain text stream bit, that is, the plaintext/ciphertext stream bit XOR a bit of the diffusion region value 500 Continue until the encryption and decryption 600 is completed.

In addition, the second figure (ie, the first figure 200) shows a flow diagram for initializing the diffusion area via an input password, which includes the following steps: inputting the password bit 210 in sequence; and selecting whether the password bit controls the diffusion medium 220 If yes, the diffusion mechanism is executed, and the addition or exclusion of the diffusion medium is determined by the password bit value (0 or 1) to obtain the initial value 240 of the diffusion region. Otherwise, the input password is directly written to The diffusion region 230 ; continues until initialization 250 is completed.

Serial processing:

In the first graph 300, a new value is obtained. In the serial processing, a plurality of diffusion functions A F( p ₁ , p ₂ , . . . , p _k ) are repeatedly executed, providing a simpler design, but in a more time-consuming manner. In addition, in a diffusion region of the second figure, if the cryptographic bit is the first value, A F( i ₁ , i ₂ , . . . , i _m )= A ⊕ Ad _{1 i} ⊕ Ad _{2 i} ⊕...⊕ Ad _mi ⊕ S , if it is the second value, then A F( i ₁ , i ₂ ,..., i _m )= A ⊕ Ad _{1 i} ⊕ Ad _{2 i} ⊕...⊕ Ad _mi . The encryption and decryption process includes the following steps:

1. Select a diffusion region A , a diffusion mechanism ;

2. Enter a password to get the initial value A ^{0 of} A ; set t ₂ =1;

3. Execution Get A new value ;

4. Enter a plaintext/ciphertext stream bit in sequence;

5. Output the ciphertext/plaintext stream bit in sequence, where the new value is equal to the plaintext/ciphertext stream bit XOR Specified bit;

6. Go back to step 3 until the encryption and decryption is complete.

Symbols and definitions:

● A : a diffusion region, the A contains an initial value A ⁰ , and is an m- dimensional bit matrix of d ₁ × d ₂ ×...× d _m whose position is indicated by 1 to n , and its bit value is a ₁ to a _n , the location indications are as follows:

(a) m =1, one dimension A

(b) m = 2, two-dimensional A

● S : a diffusion medium, the S is an m- dimensional bit matrix containing an anchor point .

• A F( p ): This A performs a spread function F( p ), where the position p is converted into m- dimensional coordinates ( i ₁ , i ₂ , . . . , i _m ), and A F( i ₁ , i ₂ ,..., i _m )= A ⊕ Ad _{1 i} ⊕ Ad _{2 i} ⊕...⊕ Ad _mi ⊕ S ; see application number 98108364, multi-layer single point spread .

● A F( p ₁ , p ₂ ,..., p _k ): This A performs a complex number of diffusion functions F( p ₁ , p ₂ ,..., p _k ) whose specified positions are respectively p ₁ , p ₂ ,..., p _k .

● : The A performs a diffusion mechanism , which is Abbreviation, which means that F( p ₁ , p ₂ ,..., p _k ) is repeatedly executed t ₁ times.

In order to simply understand the new values of the diffusion region that repeatedly perform a diffusion mechanism, all the examples below are set to their initial values A. ⁰ =0, plaintext bit=0, diffusion medium S=1 and placed at the anchor point.

Preferred Embodiment I: a 1 x 16 diffusion region A , a diffusion mechanism F ¹

Suppose ^{F 1 = F (13,14,15,16,1, ...} , 13), the first time the encrypted t ₂ = 1, the new value of A is A ^{1 × 1 = A 0 F 1} , derivation process comprising The permutation function operation of each position is sequential, and the symbolic representations of the continuous positions here and here are replaced by No.p:No.q, just like 13:15 represents 13,14,15, and further, 13: 1 is represented as 13, 14, 15, 16, 1, etc., and the steps are as follows ( S =1, here and in the following are indicated in bold):

A ⁰ F( p )= A ⁰ ⊕ A ⁰ y _p ⊕ S ; A ⁰ F(13)=[0000000000000000]⊕[0000000000000000]⊕[000000000000 1 000]; A ⁰ F(13:14)=[0000000000001000] ⊕[0000000000010000]⊕[0000000000000 1 00]; A ⁰ F(13:15)=[0000000000011100]⊕[0000000000111000]⊕[00000000000000 1 0]; A ⁰ F(13:16)=[0000000000100110]⊕[0000000001001100] ⊕[000000000000000 1 ]; A ⁰ F(13:1)=[0000000001101011]⊕[0000000000110101]⊕[ 1 000000000000000]; A ⁰ F(13:2)=[1000000001011110]⊕[0000000000101111]⊕[0 1 00000000000000] A ⁰ F(13:3)=[1100000001110001]⊕[1000000000111000]⊕[00 1 0000000000000]; A ⁰ F(13:4)=[0110000001001001]⊕[1100000000100100]⊕[000 1 000000000000]; A ⁰ F (13:5)=[1011000001101101]⊕[0110000000110110]⊕[0000 1 00000000000]; A ⁰ F(13:6)=[1101100001011011]⊕[1011000000101101]⊕[00000 1 0000000000]; A ⁰ F(13:7 )=[0110110001110110]⊕[1101100000111011]⊕[000000 1 000000000]; A ⁰ F(13:8)=[1011011001001101]⊕[0110110000100110]⊕[0000000 1 00000000]; A ⁰ F(13:9)=[1101101101101011 ]⊕[1011011000110101] ⊕[00000000 1 0000000]; A ⁰ F(13:10)=[0110110111011110]⊕[1101101110101111]⊕[000000000 1 000000]; A ⁰ F(13:11)=[1011011000110001]⊕[0110110001011000]⊕[0000000000 1 00000]; A ⁰ F(13:12)=[1101101001001001]⊕[1011010010000100]⊕[00000000000 1 0000]; A ⁰ F(13:13)=[0110111011011101]⊕[1101110110110110]⊕[000000000000 1 000].

After A ⁰ F (13:13) via, therefore, the new value of the A, A ^{1 × 1} = ^{[1011001101100011]} Thereafter, assuming A is taken with a one yuan a ₁₆ bit plaintext the XOR, encryption bit to obtain Output. Next, t ₂ = _2, the new value of A is ^{A 1 × 2 = A 1 x} 1 F 1, in the derivation, A ^{1 × 1} directly in place of A ^1, the following steps:

A ¹ F( p )= A ¹ ⊕ A ¹ y _p ⊕ S ; A ¹ F(13)=[1011001101100011]⊕[0110011011000001]⊕[000000000000 1 000]; A ¹ F(13:14)=[1101010110101010] ⊕[1010101101010001]⊕[0000000000000 1 00]; A ¹ F(13:15)=[0111111011111111]⊕[1111110111111101]⊕[00000000000000 1 0]; A ¹ F(13:16)=[1000001100000000]⊕[0000011000000000] ⊕[000000000000000 1 ]; A ¹ F(13:1)=[1000010100000001]⊕[0100001010000000]⊕[ 1 000000000000000]; A ¹ F(13:2)=[0100011110000001]⊕[1010001111000000]⊕[0 1 00000000000000] ; A ¹ F(13:3)=[1010010001000001]⊕[0101001000100000]⊕[00 1 0000000000000]; A ¹ F(13:4)=[1101011001100001]⊕[1010101100110000]⊕[000 1 000000000000]; A ¹ F (13:5)=[0110110101010001]⊕[1101011010101000]⊕[0000 1 00000000000]; A ¹ F(13:6)=[1011001111111001]⊕[0110000111111100]⊕[00000 1 0000000000]; A ¹ F(13:7 )=[1101011000000101]⊕[1010110100000010]⊕[000000 1 000000000]; A ¹ F(13:8)=[0111100100000111]⊕[1111001010000011]⊕[0000000 1 00000000]; A ¹ F(13:9)=[1000101010000100 ]⊕[0001010101000010] ⊕ [00000000 1 0000000]; A 1 F (13:10) = [1001111101000110] ⊕ [0011111010100011] ⊕ [000000000 1 000000]; A 1 F (13:11) = [1010000110100101] ⊕ [0100001101010010] ⊕ [0000000000 1 00000]; A ¹ F(13:12)=[1110001011010111]⊕[1100010110101011]⊕[00000000000 1 0000]; A ¹ F(13:13)=[0010011101101100]⊕[0100111011010110]⊕[000000000000 1 000].

A second new value of the ^{A 1 × 2 = [0110100110110010]} ; then, outputs the encrypted bits also other attendant. Due to the cycle of the F ¹ , meaning , is 2 ¹⁶ -1 times, therefore, in a cycle, the diffusion mechanism is continuously operated, and the encrypted data is randomly distributed to avoid the hacker's encryption analysis. The following shows the output of 64 encrypted bits, divided into four parts. :

1011011100111011 ( t ₂ =1 to 16), 0000100100010111 ( t ₂ = 17 to 32), 0100000011010100 ( t ₂ = 33 to 48), 1011011111111110 ( t ₂ = 49 to 64).

Preferred Embodiment II: a 1 x 16 diffusion region A , a diffusion mechanism F ²

Hypothesis The diffusion mechanism is equal to F ¹ of Example I embodiment is performed twice, i.e., the encrypted output bit will be output at intervals equal to the Example I embodiment; encrypted at a first time t ₂ = 1, the new value of A A ^{2 × 1} = A ⁰ F ² , and the derivation process is equal to A ^{1 × 1} and A ^{1 × 2 of the} embodiment ¹ . Next, t ₂ = _2, the new value of A is A ^{2 × 2 = A 2 x 1} F 2, in the derivation, A ^{2 × 1} A ² can be directly replaced, and then find the A ^3, A ⁴ and finally deriving i.e. The new value A ^{2 × 2} , in order to let the skilled people get more understanding, the steps to list A ⁴ are as follows ( A ³ = [1000010001101011]):

A ³ F( p )= A ³ ⊕ A ³ y _p ⊕ S ; A ³ F(13)=[1000010001101011]⊕[0000100011010101]⊕[000000000000 1 000]; A ³ F(13:14)=[1000110010110110] ⊕[0001100101101011]⊕[0000000000000 1 00]; A ³ F(13:15)=[1001010111011001]⊕[0010101110110000]⊕[00000000000000 1 0]; A ³ F(13:16)=[1011111001101011]⊕[0111110011010110] ⊕[000000000000000 1 ]; A ³ F(13:1)=[1100001010111100]⊕[0110000101011110]⊕[ 1 000000000000000]; A ³ F(13:2)=[0010001111100010]⊕[0001000111110001]⊕[0 1 00000000000000] ; A ³ F(13:3)=[0111001000010011]⊕[1101100100001001]⊕[00 1 0000000000000]; A ³ F(13:4)=[1000101100011010]⊕[0000010110001101]⊕[000 1 000000000000]; A ³ F (13:5)=[1001111010010111]⊕[0011011101001011]⊕[0000 1 00000000000]; A ³ F(13:6)=[1010000111011100]⊕[0100000011101110]⊕[00000 1 0000000000]; A ³ F(13:7 )=[1110010100110010]⊕[1100100010011001]⊕[000000 1 000000000]; A ³ F(13:8)=[0010111110101011]⊕[0101111011010101]⊕[0000000 1 00000000]; A ³ F(13:9)=[0111000001111110 ]⊕[1110000000111111] ⊕[00000000 1 0000000]; A ³ F(13:10)=[1001000011000001]⊕[0010000110100000]⊕[000000000 1 000000]; A ³ F(13:11)=[1011000100100001]⊕[0110001001010000]⊕[0000000000 1 00000]; A ³ F(13:12)=[1101001101010001]⊕[1010011010101000]⊕[00000000000 1 0000]; A ³ F(13:13)=[0111010111101001]⊕[1110101111010100]⊕[000000000000 1 000].

A new value of the A ^{2 × 2} = ^{[1001111000110101],} because of its access number ² F 2, the number is a prime number, and therefore, the cycle F ^{2 216-1} is twice Furthermore, in order results control Example I embodiment, a is also assumed to take one yuan a plaintext and a _16-bit encryption, the display 64 outputs the encrypted bits, divided into four parts:

0111010100010111 ( t ₂ =1 to 16), 1000111001111110 ( t ₂ = 17 to 32), 1000010100011110 ( t ₂ = 33 to 48), 1101011100000100 ( t ₂ = 49 to 64).

Preferred Embodiment III: a 4 x 4 diffusion region A , a diffusion mechanism F ¹

Suppose ^{F 1 = F (8: 8} ), t 2 = 1 the first time the encrypted new value A of the A ^{1 × 1 = A 0 F 1} ; since the region A is a two dimensional matrix, and therefore, The position p of a diffusion function F( p ) shall be converted into a two-dimensional coordinate ( i , j ), and the derivation process is as follows ( Ax (0), Ay (0), here and in the following, also in bold):

A new value of the A ^{1 × 1} = ^{[1010001000100100],} in which F ¹ due to the two dimensions of the operating area, for example, I and II as the control result embodiment, A is also assumed to take one yuan a plaintext and a ₁₆ bits Encryption, the following shows the output of 64 encrypted bits, divided into four parts:

0111000100100111 ( t ₂ =1 to 16), 0000001100001011 ( t ₂ = 17 to 32), 1110101001111110 ( t ₂ = 33 to 48), 0011000001101100 ( t ₂ = 49 to 64).

Parallel processing:

In the first graph 300, a new value is obtained. , applied to parallel processing, will convert the above serial processing into In other words, convert to a diffusion table With a dielectric constant The operation, which provides a more complex design, but a faster way of computing. In addition, in a diffusion region of the second figure, if the password bit is the first value, then If it is the second value, then . The encryption and decryption process includes the following steps:

1. Select a diffusion region A to generate a diffusion table ;

2. Select a dielectric area B to generate a dielectric constant ;

3. Enter a password, to obtain an initial value A ⁰ A; set t ₂ = 1;

4. Execution Get A new value ;

5. Enter a plaintext/ciphertext stream bit in sequence;

6. Output the ciphertext/plaintext stream bit in sequence, where the new value is equal to the plaintext/ciphertext stream bit XOR Specified bit;

7. Go back to step 4 until the encryption and decryption is complete.

Symbols and definitions:

● A : a diffusion region, the A contains an initial value A ⁰ , and is an m- dimensional bit matrix of d ₁ × d ₂ ×...× d _m whose position is indicated by 1 to n , and its bit value is a ₁ to a _n .

● S : a diffusion medium, the S is an m- dimensional bit matrix containing an anchor point .

● B : a medium region, where B is an m- dimensional zero matrix of d ₁ × d ₂ ×...× d _m , the position of which is indicated by 1 to n .

● : a dielectric constant, wherein the B performs a diffusion mechanism once , which is Abbreviation, which means that F( p ₁ , p ₂ ,..., p _k ) is repeatedly executed t ₁ times.

● : The A executes a form ,among them, , the operation is performed once, which includes:

■ F is a zero matrix with a d ₁ × d ₂ ×...× d _m and a dimension of d ₁ × d ₂ ×...× d _m representing the number of layers; and the value 1 is placed in the first i-th position of the i-layer, for example as follows:

When performing an operation, a 1x4 A uses a 4x4 F , a 2x2 A uses a 2x2x4 F , and a 4x4 A uses a 4x4x16 F , and the like.

■ F F( p ₁ , p ₂ ,..., p _k ): F performs a plurality of diffusion functions F( p ₁ , p ₂ ,..., p _k ) whose specified m- dimensional positions are respectively p ₁ , p ₂ ,..., p _k ; In more detail, A (1x4) of a dimension uses a two-dimensional F (4x4), which is specified as a dimension of p , ie F F( p )= F ⊕ Fy _p , to F F(1:4) is taken as an example, as follows ( Fy (0), here and after it is marked in bold):

Next, AF ^{1 is} explained, assuming that the diffusion table F ¹ = F F(1:4), then, according to the above derivation, the new value a ₁ = a ₁ ⊕ a ₂ ⊕ a ₃ , which refers to the first position of each layer There is a number of layers of the number 1, and the ith layer represents the original value a _i ; therefore, referring to the second position of each layer, the new value a ₂ = a ₁ ⊕ a _{2 is obtained} , and then a ₃ = a ₂ ⊕ a ₄ Finally, a ₄ = a ₁ ⊕ a ₂ ⊕ a ₃ ⊕ a ₄ .

Further, A (2x2) such as two-dimensionality adopts three-dimensional F (2x2x4), which is specified as two-dimensional p , that is, F F( p )= F ⊕ Fx _i ⊕ Fy _j , and then F F(1: 4) As an example, the description is as follows ( Fx (0), here and in the following is also indicated in bold):

Reapply to AF ¹ because , And the layer of the first (1st) to the fourth layer represents (4th) original value a ₁ to a _4, therefore, the first position by the respective layers, to give a new value _{a 1 = a 2 ⊕ a 3} ⊕ a 4; layers In the second position, a new value a ₂ = a ₁ ⊕ a ₂ ⊕ a _{4 is obtained} ; and from the third position of each layer, a new value a ₃ = a ₁ ⊕ a ₃ ⊕ a _{4 is obtained} ; finally, the fourth position of each layer , get the new value a ₄ = a ₁ ⊕ a ₂ ⊕ a ₃ .

Diffusion mechanism of parallel processing: IV than Example Best embodiment

In the case of embodiment I , , F ¹ =F(13:13), converted to parallel processing Wherein, a dielectric constant B F ^{1 is} first generated and a diffusion table F ¹ ; the B F ¹ = B F(13:13)=[1011001101100011], and the derivation process is produced as the A ^{1 of the} embodiment I, The finding of F ¹ = F F(13:13), where F F( p )= F ⊕ Fy _p , can be referred to the entire derivation process of the two-dimensional F F(1:4) and applied to the current F In other words, as in a 16x16 two-dimensional unit matrix, a one-dimensional diffusion function is performed, and the specified position is from 13 to 16, and then from 1 to 13. The diffusion function operation at each position is shown in Table 1. And all the bits of the final result are shown in Table 2, and the relationship between the new value a _i and the original value a _i found in Table 2 is listed in Table 3.

According to Table 3, the new values generated are as follows: when t ₂ =1, A ^1×1 = A ⁰ F ¹ ⊕ B F ¹ = [0000000000000000] ⊕ [1011001101100011]; the result is the same as A ^{1 of the} embodiment I .

When t ₂ = 2, A ^{1 × 2} = A ^{1 × 1} F ¹ ⊕ B F ¹ = [1101101011010001] ⊕ [1011001101100011] = [0110100110110010]; the result is the same as A ^{2 of the} embodiment I, as follows: The new value a ₁ = a ₁ ⊕ a ₇ ⊕ a ₉ ⊕ a ₁₁ = ₁ ⊕ ₁ ⊕ ₀ ⊕ ₁ = 1; a ₂ = a ₁ ⊕ a ₂ ⊕ a ₅ ⊕ a ₈ ⊕ a ₁₀ ⊕ a ₁₂ = 1⊕0⊕0⊕1⊕1⊕0=1;...; a ₁₆ = a ₃ ⊕ a ₄ ⊕ a ₁₃ ⊕ a ₁₅ =1⊕1⊕0⊕1=1. The same is true, when t ₂ = 3, , A ^{1 × 3} = A ^{1 × 2} F ¹ ⊕ B F ¹ = [0011011100001000] ⊕ [1011001101100011] = [1000010001101011]; the result is similar to A ^{3 of the} embodiment II.

When t ₂ = 4, A ^{1 × 4} = A ^{1 × 3} F ¹ ⊕ B F ¹ = [0010110101010110] ⊕ [1011001101100011] = [1001111000110101]; the result is as A ^{4 of the} embodiment II.

In the case of embodiment II , , , converted to parallel processing Where B F ² =[ B F(13:13)]F(13:13), the derivation process is as produced by A ^{2 of} Example I, which is equal to [0110100110110010]; It is equal to F F (13:13) of Table 2 to execute a plurality of diffusion functions F(13:13), which is performed as shown in Table 1, and the diffusion table F ^{2 is} shown in Table 4.

When t ₂ =1, A ^{2 × 1} = A ⁰ F ² ⊕ B F ² = [0000000000000000] ⊕ [0110100110110010]; the result is as A ^{2 of the} embodiment I.

When t ₂ = 2, A ^{2 × 2} = A ^{2 × 1} F ² ⊕ B F ² = [1111011110000111] ⊕ [0110100110110010] = [1001111000110101]; the result is the same as A ^{4 of the} embodiment I, as follows: The new value a ₁ = a ₁ ⊕ a ₃ ⊕ a ₅ ⊕ a ₇ ⊕ a ₉ ⊕ a ₁₃ =0⊕1⊕1⊕0⊕1⊕0=1; a ₂ = a ₁ ⊕ a ₂ ⊕ a ₄ ⊕ a ₆ ⊕ a ₇ ⊕ a ₈ ⊕ a ₉ ⊕ a ₁₁ ⊕ a ₁₁ ⊕ a ₁₃ ⊕ a ₁₄ ⊕ a ₁₅ =0⊕1⊕0⊕0⊕0⊕1⊕1⊕0⊕1⊕0⊕0⊕ 1=1;...; a ₁₆ = a ₂ ⊕ a ₅ ⊕ a ₆ ⊕ a ₈ ⊕ a ₉ ⊕ a ₁₀ ⊕ a ₁₁ ⊕ a ₁₂ ⊕ a ₁₃ ⊕ a ₁₅ ⊕ a ₁₆ =1⊕1⊕0⊕1⊕ 1⊕0⊕1⊕1⊕0⊕1⊕0=1.

In the case of embodiment III , , F ¹ =F(8:8), converted to parallel processing Where B F ¹ = B F(8:8) = [1010001000100100], the derivation process is as produced by A ^{1 of} Example III, and the F ¹ = F F (8:8) is obtained, wherein Since A is a 4x4 matrix, F is a 4x4x16 zero matrix, and the value 1 is placed at the i -th position of the i - th layer, and the diffusion function uses a two-dimensional operation F ( p )= F ⊕ Fx _i ⊕ Fy _j , can refer to the entire derivation process of the three-dimensional F F (1:4), and apply to the current F , the relationship of the new value a _i is shown in Table 5.

Hardware device:

In the first graph 300, a new value is obtained. , applied to the hardware device, will be the above parallel processing Converted into an electronic circuit, as shown in the third figure, comprising: a register R1 providing storage of an input value 310 ; a diffuser DF, providing receiving R1 Value through a diffusion table Reorganization Generate and transmit an output value 320 ; a memory M1, providing a storage medium constant 330 ; an XOR unit providing reception and reception DF Value with M1 Value, perform bit XOR operation and pass an output value 340 ; a register R2, providing a receiving XOR unit The value is buffered and then passed back to R1 350 .

In addition, the second figure shows that the diffusion area is initialized via an input password, and when the input bit is the first value, execution is performed. , that is, the device of the third figure; if it is the second value, it is executed As shown in the fourth figure, another device that can be regarded as the first figure 300 includes: a register R1 that provides storage of an input value. 310 ; a diffuser DF, providing receiving R1 Value through a diffusion table Reorganization Generate and transmit an output value 320 ; a register R2, providing receiving DF The value is buffered and then passed back to R1 350 .

The fifth figure shows the entire apparatus for performing stream encryption and decryption, comprising: a main component, namely a third diagram and a fourth diagram, providing a diffusion mechanism 300 for performing the first diagram 300 ; a switch SW providing provision for performing the first diagram Initialization of 200, wherein the received cryptographic bit is the first value, then R2 receives The value comes from DF, if it is the second value, it comes from the XOR unit 200 ; a multiplexer MUX provides the receiving R2 Value, and specify and transfer a bit 360 ; a register R3, the input is marked as IN, provide the implementation of the first map 400, sequentially store a plaintext / ciphertext stream bit, and sequentially transmit a Bit 400 ; an XOR gate, the output is labeled OUT, provides an output bit that provides execution of the first diagram 500, the output bit of the receive MUX, and R3, performs an XOR operation, and transmits an output bit 500 .

Preferred Embodiment V: Diffusion mechanism of hardware device

In the parallel processing of the embodiment I , the dielectric constant B F ¹ = B F (13:13) = [1011001101100011] and the diffusion table F ¹ = F F (13: 13) must be generated first, therefore, see Table 3; From the hardware device, B F ¹ can be written to the memory M1, and F ^{1 is} changed to a diffuser DF combined with a plurality of XOR gates, as shown in the sixth figure, thereby achieving faster processing of stream encryption and decryption. Similarly, in Example II , Write to M1, and Refer to Table 4 and change to DF. In Example III , B F ¹ = B F(8:8)=[1010001000100100] is written to M1, and F ¹ = F F(8:8), see Table V. Change to DF.

The devices of all embodiments can be used not only separately but also in parallel, a password is simultaneously input to all devices SW, and then a plaintext/ciphertext stream region is scored, and a segment is segmented. Input to a device IN, each device OUT is reached and the ciphertext/clear text stream bit is simultaneously output, as shown in the seventh figure. Furthermore, in a series connection, as shown in the eighth figure, the method includes: inputting a password to the first device SW, and the first device OUT is connected to the second device SW, and the second device OUT is connected to the third device SW. a plaintext/ciphertext stream area score segment, and a segment is input to a device IN to achieve each device OUT simultaneously outputting the ciphertext/clear text stream bit, or, in consideration of security, a plaintext The ciphertext stream is input only to the third device IN, and the ciphertext/cleartext stream bit is output by the third device OUT.

Although the present case is illustrated by several preferred embodiments, those skilled in the art can make various forms of changes without departing from the spirit and scope of the case. The above embodiments are only used to illustrate the present case and are not intended to limit the scope of the present invention. All kinds of modifications or changes that are not in violation of the spirit of the case are the scope of patent application in this case.

The first figure is a schematic flow chart of the multi-layer diffusion stream encryption and decryption method and apparatus of the present invention; the second figure is a schematic diagram of the initialization process of the first picture (200) of the present invention by password input; the third picture is the first picture of the present invention ( 300) a schematic diagram of a hardware device, the diffusion mechanism of the hardware device includes a dielectric constant; the fourth diagram is a schematic diagram of a hardware device of the first diagram (300) of the present invention, the diffusion mechanism of the hardware device does not include a dielectric constant; The schematic diagram of the hardware device of the first figure of the present invention, wherein the third figure and the fourth figure are included, and a switch SW is added for use as the password input of the second figure; the sixth figure is the preferred embodiment I of the present invention. A schematic diagram of a hardware device of a diffusion table; a seventh diagram is a schematic diagram of a parallel connection of the hardware devices of the preferred embodiments I, II, and III of the present invention; and an eighth diagram is a schematic diagram of a series connection of the hardware devices of the preferred embodiments I, II, and III of the present invention. ;

Claims (12)

A multi-layer diffusion stream encryption and decryption method, comprising the steps of: (a) selecting a diffusion region A , the A comprising an initial value A ⁰ , and being an m dimension of a d ₁ × d ₂ ×...× d _m element matrix, denoted by position 1 to n; (b) selecting a diffusion medium S, the S bit is a matrix of dimension m, the anchor comprising a (c) the A selects a diffusion mechanism , the expression is expressed as ,among them, , which includes the following steps: i. setting t =1; ii. setting s =1; iii. the A performs a diffusion function F( p _s ), A F( p _s )= A ⊕ Ad _{1 i} ⊕ Ad _{2 i} ⊕...⊕ Ad _mi ⊕ S , where, to Fixed to the p _s , forming the S overlaps with the A , and the p _{s is} converted into m- dimensional coordinates ( i ₁ , i ₂ , . . . , i _m ); iv. If s = k , to the next step; , s = s +1, return to step (iii); v. if t ≠ t ₁ , let t = t +1, and return to step (ii); (d) set t ₂ =1, (e) execution , the A produces a new value ; (f) take out the new value a specified bit; (g) if performing stream bit encryption and decryption, it comprises the steps of: i. sequentially inputting a plaintext/ciphertext stream bit; ii. sequentially outputting the ciphertext/clear text stream a bit, where, equal to the plaintext/ciphertext stream bit XOR the new value The specified bit; (h) let t ₂ = t ₂ +1, return to step (e). According to the method of claim 1, wherein the initial value A ⁰ is directly written to the A by a password; or, the bit of a password is sequentially read and executed. Wherein, if the bit is the first value, the S is included; if the bit is the second value, the S is not included, in other words, S =0 is set. The method of claim 1, wherein the designated bit of the step (f) of the method controls another step (e) of the method, wherein the output bit is the first value, The S ; if the bit is the second value, the S is not included, in other words, S =0 is set. A multi-layer diffusion stream encryption and decryption method, comprising the steps of: (a) selecting a diffusion region A , the A comprising an initial value A ⁰ , and being an m dimension of a d ₁ × d ₂ ×...× d _m a meta-matrix whose position is indicated by 1 to n , whose bit value is from a ₁ to a _n ; (b) the A selects a diffusion table , the expression is expressed as , where, the Is a one-dimensional matrix having d ₁ × d ₂ ×...× d _m and an additional dimension of d ₁ × d ₂ ×...× d _m , which can be regarded as Number of layers; Generate a new a _i , Wherein the new a _i is equal to at least one layer of XOR, and the value of the i-th position of the layer is 1, the i-th layer represents the original a _i ; (c) the selection of a dielectric constant , the Is an m- dimensional bit matrix; (d) sets t ₂ =1, (e) execution , the A produces a new value ; (f) take out the new value a specified bit; (g) if performing stream bit encryption and decryption, it comprises the steps of: i. sequentially inputting a plaintext/ciphertext stream bit; ii. sequentially outputting the ciphertext/clear text stream a bit, where, equal to the plaintext/ciphertext stream bit XOR the new value The specified bit; (h) let t ₂ = t ₂ +1, return to step (e). According to the method of claim 4, wherein It can be obtained by the following steps: (a) setting the F to a m +1 dimension zero matrix, and the value of the i- th position of the i - th layer is 1; (b) setting t =1; (c) setting s=1; (d) the F performs a diffusion function F( p _s ), F F( p _s )== F ⊕ Fd _{1 i} ⊕ Fd _{2 i} ⊕...⊕ Fd _mi , , where p _{s is} converted to m-dimensional coordinates ( i ₁ , i ₂ , . . . , i _m ); (e) if s = k to the next step; otherwise, s = s +1, back to step (d (f) If t ≠ t ₁ , let t = t +1 and return to step (c). According to the method of claim 4, wherein Obtained by the following steps, comprising: (a) selecting a diffusion medium S , the S is an m- dimensional bit matrix, including an anchor point (b) setting the B to a d ₁ × d ₂ ×...× d _m zero matrix; (c) setting t =1; (d) setting s =1; (e) the B performing a diffusion function F( p _s ), B F( p _s )= B ⊕ Bd _{1 i} ⊕ Bd _{2 i} ⊕...⊕ Bd _mi ⊕ S , Where the Fixed to the p _s , forming the S overlaps with the B , and the p _{s is} converted into m- dimensional coordinates ( i ₁ , i ₂ , . . . , i _m ); (f) if s = k , to the next step; Conversely, s = s +1, return to step (e); (g) if t ≠ t ₁ , let t = t +1, and return to step (d). The method according to claim 4, wherein the initial value A ⁰ is directly written to the A by a password; or, the bit of a password is sequentially read and executed. Where the bit is the first value and the ; the bit is the second value, it does not contain the In other words, set . The method of claim 4, wherein the designated bit of the step (f) of the method controls another step (e) of the method, wherein the output bit is the first value, The ; the bit is the second value, it does not contain the In other words, set . A multi-layer diffusion stream encryption and decryption device, comprising: (a) a register R1 for receiving an input value Wherein, the method may include directly writing a password to generate an initial value A ⁰ ; (b) a diffuser DF providing the receiving of the R1 Value through a diffusion table Reorganization Generate and transmit an output value (c) a register R2 providing for receiving the DF The value is buffered and then passed back to the R1; (d) a multiplexer MUX providing the R2 receiving Value, and specify and transfer a bit; (e) a register R3, the input is marked as IN, providing a plaintext/ciphertext stream bit in sequence, and sequentially transmitting a bit; (f An XOR gate, the output is labeled OUT, provides an output bit that receives the MUX and an output bit of the R3, performs an XOR operation, and transmits an output bit. The device according to claim 9, wherein the method further comprises: (a) a memory M1, providing a storage medium constant (b) an XOR unit providing access to the DF Value with the M1 Value, perform bit XOR operation and pass an output value (c) the register R2, providing for receiving the XOR unit The value is buffered and then transmitted back to the R1; (d) a switch SW is provided to sequentially receive the password bit to use the diffusion table In the manner of generating the initial value A ⁰ , wherein the bit is the first value, then the R2 receives The value comes from the DF, and if it is the second value, it comes from the XOR unit. The device according to claim 10, comprising a parallel connection with a plurality of other devices, comprising: (a) SWs of all devices, providing a cryptographic bit in sequence; (b) IN of all devices Providing a plaintext/ciphertext stream bit for each specified segment in sequence; (c) OUT of all devices, providing ciphertext/plaintext stream bits for sequentially transmitting the specified segments. The device according to claim 10, comprising a serial connection with a plurality of other devices, comprising: (a) a SW of the first device, providing a cryptographic bit in sequence; (b) all devices The SW (excluding the first one) provides an output bit that receives the OUT of the previous device; (c) the OUT of all devices (except the last one), providing the SW that transmits the output bit to the latter device; d) the IN of the last device, providing a plaintext/ciphertext stream bit in sequence; or the IN of all devices, providing a plaintext/ciphertext stream bit of each specified segment in sequence; e) The OUT of the last device, which provides the ciphertext/plain stream bit in sequence; or the OUT of all devices, which provides the ciphertext/plain stream bit in sequence for each specified segment.