## 2 Related Work
On the contrary, a private-key encryption algorithm can only open a file with the corresponding private key. An asymmetric encryption algorithm means the same person does not perform the encryption and decryption processes; the \"public key\" and \"private key\" are different. At present, many scholars have proposed many solutions for information security technologies, such as digital watermarking technology, authentication technology, and access control technology [22; 23; 24; 25; 26; 27; 28; 29; 30]. However, these technologies all have one thing in common, which is that they need to modify the whole system or redevelop a new system to realize its functions; this, in turn, leads to problems such as high costs or long cycle times. Although these methods can protect the information in the resource platform, all of them have some shortcomings in one way or another. The commonly used information encryption and decryption algorithms have problems related to key distribution, which may cause indelible losses if the key is leaked or the system is accessed by lifting rights in an open and complex network architecture [31; 32; 33; 34; 35]. In some scenarios with high-security-factor requirements, multiple DES is usually used, which further increases the algorithm's complexity by multiple iterations and improves the security of encrypted data to some extent. However, the complexity of its decryption will inevitably consume too many of the system's arithmetic resources [36]. Among the asymmetric encryption algorithms, RSA still has a tedious public key generation process due to the limitation of large prime number generation technology, which struggles to meet the requirement of \"one key at a time\" in distributed and open-network environments. Therefore, asymmetric encryption is difficult to use in open and temporary environments. In order to overcome the shortcomings of the above traditional algorithms, this paper proposes a new algorithm, the chunking disorder algorithm. The main idea of this algorithm is to break up the plaintext into several small segments, then rearrange and combine them into ciphertext, and finally use the corresponding algorithm to complete the decryption work. This algorithm dramatically reduces the computational effort required and avoids the problem of key distribution. At the same time, it does not require additional hardware support but only requires the integration the relevant algorithm on the server side to run. The algorithm has good pervasiveness and can be applied to systems and platforms of any size to provide error-free encryption and decryption services. The proposed chunking disorder algorithm is executed by user-selected iterations, N. The original data are chunked according to a specific chunk size, and the chunked data are randomly selected for execution by one set of location-swapping algorithms. The data after completing one encryption generate a sharing code according to the logic at the time of encryption and then iterate N times to stitch the sharing code and take the MD5 value of the original data and the encrypted data, respectively. The algorithm then combines the MD5 value, the ciphertext, and the sharing code difference to complete the encryption of the plaintext. Due to the uncertainty of the number of iterations, n, and, thus, the length of the sharing code, the encryption mechanism of this algorithm is superior to that of the DES algorithm under the same conditions. This algorithm solves the security problem caused by key distribution, which must ensure that the client and server cannot be decompiled. In this paper, based on the current research results, we adopt a simple and effective method of deploying the chunked disorderly algorithm to the back-end separately and then combine it to complete the design and implementation of the whole system for a specific project requirement. This method can reduce not only the system's complexity but also improve the scalability of the system and the ease of maintaining and upgrading it.