A Practical Group Random Encryption and Decryption Method

Abstract

The invention discloses a practical group random encryption and decryption method, the length of the message group is n bits, and the key WK=(K 0 , K 1 )∈(F 2 n ) 2 , each input a plaintext packet X i ∈(F 2 ) n , after the encryption operation, the corresponding output ciphertext group vector (C1 i ,C2 i ,C3 i )∈(F 2 n ) 3 . The block random encryption design of the present invention: 1) can effectively avoid various password attack problems caused by the round iteration structure of the traditional block cipher; 2) can effectively reduce the encryption delay problem caused by the multi-round iterative operation of the traditional block cipher; 3) can Effectively solve the problem of rapid reconstruction of the cryptographic algorithm itself (only need to replace the RD data table of the random database), and improve the flexibility of cryptographic applications. The present invention only needs to preset a small-scale random database scale (such as 1G bits), and a given key can securely encrypt large-scale message plaintext without changing the random database. In addition, the random database data preset in the invention can be released and managed uniformly by the password management system or the message encryptor, which is beneficial to the segmented application of the encryption system user groups.

Description

technical field [0001] The invention relates to a practical packet random encryption and decryption method. Background technique [0002] A block cipher is an n-bit permutation of input and output with a key. The currently widely used block cipher algorithms are all iterative ciphers, which have the following characteristics: each block encryption process needs to go through several rounds of iterative operations; given a key and an initial vector, inputting the same plaintext for each encryption always outputs the same cipher arts. In order to conceal the statistical characteristics of plaintext, the encryption application method of "initial vector" + "working mode" is usually adopted (for example, CBC, OFB, CTR, etc. working modes are usually used) and an additional password initialization process is added, or a small amount is filled in the encrypted input or output. Random factor or twist factor, so as to obtain the application effect of "one-time pad" under certain se...

AI Technical Summary

Problems solved by technology

Although the MUM scheme solves the problem of secure transmission of long keys equal to the message plaintext in the Vernam scheme, the encryption security mechanism is limited by the size of the preset random bit sequence, and it still cannot cope with large-scale data encryption applications.

Images