## 9 Conclusions and System Evaluation  
In summary, this paper proposes a novel symmetric encryption algorithm that addresses the long-standing challenge of key distribution by eliminating the need for pre-distributed keys. Our algorithm achieves data encryption through multiple iterations of data, with the user specifying the number of iterations to increase the algorithm's difficulty in breaking. Additionally, each iteration generates a sharing code that builds an exclusive encryption algorithm, which is randomized to avoid the analysis of behavioral tendencies. Since the correspondence between the length of the sharing code and the specific messy encrypted message is not known in the transmitted ciphertext message, the speculation of the encryption logic through network-sniffing malicious attacks [40; 41; 42] is also avoided to some extent. Experimental simulations demonstrate the algorithm's superiority and scalability as the sharing code's length increases exponentially with the number of iterations, substantially enhancing the algorithm's security. Our proposed algorithm is deployable on both the client and server sides, which must be secured to further improve its security. Our findings provide a practical solution for secure data encryption without the need for pre-shared keys, which can have significant implications for the field of cybersecurity. However, there are still many shortcomings and improvements that can be made. For example, the chunking algorithm's security depends on the chunks' size and the chunking algorithm's choice. It can be easily broken if not chosen correctly, leading to data leakage and loss. Therefore, we must carefully select the appropriate chunk size and scrambling algorithm and design the algorithm with security in mind. Secondly, chunking disorder algorithms may be incompatible with other encryption algorithms and protocols, leading to difficulties in integration and application. Therefore, in practical applications, we need to consider compatibility issues with different encryption algorithms and protocols to apply the chunking disorder algorithm better. In future work, we will continue to improve the chunking disorder algorithm by increasing its performance, improving the chunking and disorder strategies, and optimizing the algorithm execution logic to enhance operational efficiency and security. Additionally, we will consider how to efficiently apply the chunking disorder algorithm in a distributed environment, as the current algorithm is well-suited for standalone environments. We will also work on improving the algorithm's scalability to meet the needs of large-scale data processing. Conceptualization, D.Z. and J.C.; Data curation, D.Z., J.C., C.D., Y.H. and J.L. ; Formal analysis, J.C., Y.H., X.L., X.C. and J.L. ; Funding acquisition, D.Z. ; Investigation, D.Z., X.L. and X.C. ; Methodology, J.C., Y.H., X.L., X.C., C.D. and J.L. ; Project administration, D.Z. and Y.H. ; Resources, D.Z., Y.H., and J.L. ; Software, D.Z. and J.L. ; Validation, D.Z., Y.H. and X.L. ; Visualization, J.C. and J.L. ; Writing--original draft, J.C., Y.H. and J.L. ; Writing--review & editing, D.Z. All authors have read and agreed to the published version of the manuscript. This research was funded by the Sichuan Province Department of Education (Grant No. JG2021-464) and the Ya'an Digital Agricultural Engineering Technology Research Center. Not applicable. The data in this study are available on request from the corresponding author. We are very grateful to the Sichuan Province 2021-2023 Higher Education Talent Training Quality and Teaching Reform Project. The authors declare no conflict of interest. Appendix A Explanationof related words. DES: Data Encryption Standard. Vue: It is a set of progressive boxes for building user interfaces. MD5: A widely used cryptographic hash function that generates a 128-bit (16-byte) hash value to ensure that messages are transmitted consistently. This article uses the 16-bit lowercase format of MD5.