**Peer Review Journal ** DOI on demand of Author (Charges Apply) ** Fast Review and Publicaton Process ** Free E-Certificate to Each Author

Current Issues
     2026:7/2

International Journal of Multidisciplinary Research and Growth Evaluation

ISSN: (Print) | 2582-7138 (Online) | Impact Factor: 9.54 | Open Access

Vertices random selection for vector map data in encryption process

Full Text (PDF)

Open Access - Free to Download

Download Full Article (PDF)

Abstract

Nowadays, a large volume of valuable vector map dataset has been distributed illegally by pirates, hackers, or unauthorized users. Thus, the problem focuses on how to protect the copyright of vector map data for storage and transmission. This paper presents an encryption algorithm for vector data. In proposed algorithm, vector map is separated to select polyline/polygon layer. We use three simplification algorithms to define the feature points in each object. After that, we select randomly vertices of objects based on the ratio of the feature points and encrypt them with key values. Experimental results show the high efficiency visualization by low complexity, high security performance and cryptography. In addition, experiments also show unique performance, decryption error approximate zero and computation time is better than the exist algorithms.

How to Cite This Article

Giao N Pham (2021). Vertices random selection for vector map data in encryption process. International Journal of Multidisciplinary Research and Growth Evaluation (IJMRGE), 2(4), 823-826.

Share This Article: