Data processing method and device thereof
A data processing and parameter technology used in the field of information security
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0109] Example 1: Data Encryption
[0110] This embodiment implements symmetric packet encryption, and the rules for establishing a diffusion network can be found in Figure 9 shown. For path connection methods, see Figure 12-1 , Figure 12-2 , the two connection methods have the same meaning. This embodiment only encrypts a set of plaintexts.
[0111] Processing steps:
[0112] S1. Let N(n) be the packet length. Calculate the logarithm G=log 2 N, and round up G to calculate the perfect length P=2 G , calculate the number of diffusion stages round=G+E required for processing, E>=2, E=2 in this example.
[0113] S2. Take two sets of plaintexts X and Y whose lengths are both n, and i and j are the element indexes of X and Y respectively.
[0114] S3. Take two sets of keys A and B whose length is n, and require that the elements in A and B are not all equal, and a and b are the element indexes of A and B respectively.
[0115] S4. Let the integer r be the index number ...
Embodiment 2
[0156] Example 2: Data decryption
[0157] This embodiment implements symmetric packet decryption, and the network establishment rule is opposite to encryption. This example only decrypts a set of ciphertexts.
[0158] Processing steps:
[0159] S1. Let N(n) be the packet length (N is equal to the encrypted packet length). Calculate the logarithm G=log 2 N, and round up G to calculate the perfect length P=2 G , calculate the number of diffusion stages round=G+E required for processing, E>=2, E=2 in this example.
[0160] S2. Take two groups of ciphertexts X and Y whose length is n, corresponding to the corresponding encrypted output, i and j are the element indexes of X and Y respectively.
[0161] S3. Take two sets of keys A and B whose length is n, corresponding to the key used for encryption, a and b are the element indexes of A and B respectively.
[0162] S4. Let the integer r be the index number of the diffusion stage, and the first stage r=0. Diffusion from Y, A,...
Embodiment 3
[0203] Example 3: Calculating message digests
[0204] The length of the digest used in this embodiment is 128 bits (16 bytes, any length is optional). For the network establishment rules, please refer to Figure 9 , Please refer to Example 1 for diffusion-type formation.
[0205] In order to further increase the reliability of the message summary, a constant (as the first parameter) is specially added to the diffusion formula to form together, and these constants are processed together during the diffusion operation. The diffusion expression is changed to: E+K→R, where E is the original body, K is the constant, and R is the acceptor.
[0206] Processing steps:
[0207] S1. Let N(n) be the packet length (N=8 in this example), and S is the packet used to store the message digest, and its length is 2N=16. For the convenience of description, the first half of S is named S Q , the second half named S H . i is the element index of S, S Q The element index range of is [0,N); S ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


