加密
争先恐后
计算机科学
算法
随机排列
数据挖掘
理论计算机科学
计算机网络
数学
几何学
块(置换群论)
作者
Qingbo Yan,Haowen Yan,Liming Zhang,Xiaolong Wang,P. Li,Xiaojing Yan
标识
DOI:10.1007/s12145-023-01034-3
摘要
With the rapid development of digitalization and networking, copying and sharing vector map data has become convenient, but it also brings security risks such as data interception and tampering. Current encryption methods focus on partially encrypting objects, which may leave some sensitive and confidential objects unencrypted. Additionally, the encryption effect for the point layers is not satisfactory. This paper proposes an algorithm for encrypting vector maps based on DNA dynamic encoding. Initially, global scrambling is performed on all object coordinates using double random position permutation, and a four-dimensional hyperchaotic system is selected to ensure the complexity of the chaotic sequence. Next, DNA dynamic coding operations are applied to whole layers of the vector map to encrypt all data. Finally, the encrypted data can be decrypted and restored according to the DNA coding rules and the double random position permutation mapping relationship, with the decrypted data being consistent with the original. Experimental results indicate that the proposed algorithm can be applied to the encryption protection of various vector map elements, especially to improve the performance on encrypting point layer data compared with existing encryption algorithms. It improves the security of vector data in the process of storage and transmission, and has potential application value in the protection of vector map.
科研通智能强力驱动
Strongly Powered by AbleSci AI