Research on symmetric encryption and decryption algorithm of shared data based on chaotic mapping and permutation

This paper mainly focuses on the symmetric encryption and decryption of shared data. In the traditional symmetric encryption technology, sharing an identical key is safe for both communication parties, which is not flexible enough for large-scale data exchange though. The symmetric encryption and decryption of shared data means that multiple users can use the same key to encrypt or decrypt data, so as to achieve data security protection and improve transmission efficiency. At present, the research of symmetric encryption and decryption of shared data has made some progress, but there are still some challenging problems. For example, problems like how to avoid key leakage and how to ensure the efficiency of decryption process need to be further addressed. In this study, chaotic mapping and substitution methods are used to solve these problems. First, we transform the original data into a new random sequence by way of chaotic mapping, and then convert it back to the original. This method can effectively prevent key leakage and improve the decryption speed without affecting the data transmission. Secondly, we use the idea of permutation to design a new decryption algorithm, which can complete the decryption task through simple computational operations without slowing down the decryption speed.