Encryption method capable of processing large data packets

Abstract

The invention relates to an encryption method capable of processing large data packets. The encryption method includes the following steps that: (1) a large packet length parameter t is selected, and the length of a plaintext is 128t bits, and the length of a key is 128t / 2 bits; (2) the plaintext is parsed into 21 128-bit state groups (x1, x2...xl+1...x2l), and the key is parsed into one 128-bit key group(k1<~>,k2<~>...kl<~>), wherein 2l is equal to t; (3) n rounds of cyclic encryption is performed on the state groups of the plaintext, and the input of the i-th round of encryption is the output of the i-1-th round of encryption, and the input of the first round of encryption is the state groups of the plaintext, wherein i and n satisfy an equation that 2<=i<=n, and n is a positive integer. With the encryption method of the invention adopted, a pseudo-random value introduction mode and a round function are improved, so that a safety degree of a large number of rounds can be achieved by a low number of rounds.

Description

technical field [0001] The invention relates to the technical field of information security, in particular to an encryption method capable of processing large packet data. Background technique [0002] The informatization of society is a hot issue in today's era, accompanied by the vigorous development of the information industry. In this context, on the one hand, information assets have gradually become one of the core assets of enterprises; on the other hand, the amount of information that enterprises need to keep is increasing year by year. Ensuring the confidentiality of many important information, which involves the core interests of the enterprise, is a matter of great significance; and the time and machine costs required to process a large amount of information increase the cost of the enterprise. Therefore, while providing sufficient security protection, minimize encryption Overhead is a daunting challenge. [0003] The key to solving the above problems is the symm...

AI Technical Summary

Problems solved by technology

AES has provable security bounds for differential / linear analysis in the single-key case, but weak security under correlated / chosen keys

SMS4 equals to 71.87% of double the number of rounds to be broken by linear analysis theory; in the case of single key PRESENT, about 83.87% of the number of rounds has been broken by the use of linear analysis theory, but in the case of known key weak security

The security of DES, SMS4 and PRESENT in the above schemes are all supported by the follow-up actual analysis conclusions. During the actual analysis, it was found that the complete password scheme could not be broken / practical and efficient attacks could not be given, that is to say, the scheme is relatively safe in actual application. of

However, the usual cryptanalysis cannot fully guarantee the security of the scheme. For example, when AES was designed, special attention was paid to resisting differential and linear attacks, and it was able to give a theoretical proof in the security field; Relatively slow, the security is weak under the condition of related / selected keys, both AES-192 and AES-256 have been theoretically completely broken by related key differential attacks, and 10 rounds of AES-128 have relatively complex known A key differentiator whose role, though unclear, casts doubt on its use as an ideal cipher

Images