The algorithm shows above will processing about number of 259−n attacks, the probity of successful for one unit is 2−n。It should be noted that even if a single packet has a net load of 2745 bits, you can get more than 2, 745 bits if you can get the plaintext of multiple packages. The next step in all of the required attacks is how to know the initial setup of the second layer of dense flow generator for any Packet (Packet). If you can get multiple packages and try them one by one, you can successfully find the initial setting of any package. N Basic Search time Ave requirements/bits Ave search time
5 214.7 159 283.7
10 223.9 1 146 282.9
15 222.9 33 x 210 281.9
20 221.7 1 x 220 280.7
25 220.3 32 x 1020 278.0
30 219.0 1 x 1030 278
FIGURE 12 RELATIONSHIP ABPUT …show more content…
The two rounds of Rijndael provide the following meaning of "full diffusion". Each state bit is dependent on all of the state bits before the two rounds, or a change in a state bit may have an impact on half of the state bits after the two rounds. Adding four rounds can be seen as adding a "full diffusion step" at the beginning and end of the password. The high expansion of Rijndael wheel transform is attributed to its uniform structure on all state bits. For the so-called "Feistel" password, no wheel is only used for half of the state bits, and the full diffusion can be achieved only after three rounds. In practice, this code generally takes four or more.
2. In order to attack the NTH +1 or n+2 rounds of the password, believe the password analysis, the difference cipher analysis and the truncation analysis attack usually adopt a propagation path up to n wheel. The same is true of infiltration attacks, which use a four-wheel communication structure to attack six rounds. In this respect, we increase the four wheel in fact to double the number of rounds that are traversing the track.
For the Rijndael version with a longer key, the number of the password keys increases by 32 bits. Here's
5 214.7 159 283.7
10 223.9 1 146 282.9
15 222.9 33 x 210 281.9
20 221.7 1 x 220 280.7
25 220.3 32 x 1020 278.0
30 219.0 1 x 1030 278
FIGURE 12 RELATIONSHIP ABPUT …show more content…
The two rounds of Rijndael provide the following meaning of "full diffusion". Each state bit is dependent on all of the state bits before the two rounds, or a change in a state bit may have an impact on half of the state bits after the two rounds. Adding four rounds can be seen as adding a "full diffusion step" at the beginning and end of the password. The high expansion of Rijndael wheel transform is attributed to its uniform structure on all state bits. For the so-called "Feistel" password, no wheel is only used for half of the state bits, and the full diffusion can be achieved only after three rounds. In practice, this code generally takes four or more.
2. In order to attack the NTH +1 or n+2 rounds of the password, believe the password analysis, the difference cipher analysis and the truncation analysis attack usually adopt a propagation path up to n wheel. The same is true of infiltration attacks, which use a four-wheel communication structure to attack six rounds. In this respect, we increase the four wheel in fact to double the number of rounds that are traversing the track.
For the Rijndael version with a longer key, the number of the password keys increases by 32 bits. Here's