Binary stream hash modulus encryption and decryption method

A binary stream hash modulus encryption and decryption device, comprising:

• a first processing unit, configured to create a clear-text set M according to a clear-text file, wherein the clear-text file is any parsable file;
• a second processing unit, configured to take the clear-text set M as an initial set and perform several times of byte order iterative encryption on a reference string to obtain a cipher-text set C, wherein a key set P and an algorithm set A are combined during the iterative encryption,
• the iterative encryption comprises acquiring arbitrary values of the clear-text set M, the cipher-text set C and the key set P as initial values and pointers corresponding to the initial values and performing iterative encryption on the clear-text set M to obtain the cipher-text set C by virture of the pointers and an encryption algorithm of the algorithm set A;
• and
• a third processing unit, configured to call the key set P for the cipher-text set C to perform several times of byte decrpytion on the reference string, wherein the key set P and the algorithm set A are jointly used during the encryption, and the key set P and the algorithm set A are shared during the encryption and decryption;
• the decrpytion comprises retrieving the initial values during the iterative encryption, creating bit pointers corresponding to the initial values to combine the C referenece string and the encryption algorithm of the algorithm set A to perform several times of byte decrpytion of the reference string for the cipher-text set C so as to obtain the clear-text set M, and converting the clear-text set M into a clear-text file,
• wherein the number of bytes of the reference string is 2m, m≥1 and is a positive integer;
• the clear-text set M, the cipher-text set C and the key set P take bits of the sets as circular linked lists;
• wherein the creating the clear-text set M according to the clear-text file comprises:
• the clear-text file is read to obtain the number n of bytes of the clear-text file;
• and
• a clear-text set M is created serving as an ordered set, wherein M={X0X1. . . Xn-1}={x0x1. . . x8n-1}, xi={0,1}, Xi is a clear text-byte, xi is a clear text-bit, the Xi correspondingly comprises i (0≤i≤n−1) in a byte set, the xi correspondingly comprises i (0≥i≥8n−1) in a bit set, and the bits in the M serve as a circular linked list, so that a succeeding bit of the x8n-1 is x0.