scholarly journals Vector Map Encryption Algorithm Based on Double Random Position Permutation Strategy

2021 ◽  
Vol 10 (5) ◽  
pp. 311
Author(s):  
Xiaolong Wang ◽  
Haowen Yan ◽  
Liming Zhang
Keyword(s):  
Encryption Algorithm ◽  
Hyperchaotic System ◽  
Secret Key ◽  
Vector Map ◽  
Coordinate Position ◽  
Random Position ◽  
One To One ◽  
Map Objects ◽  
Geographic Information Sciences ◽  
The Relationship

Encryption of vector maps, used for copyright protection, is of importance in the community of geographic information sciences. However, some studies adopt one-to-one mapping to scramble vertices and permutate the coordinates one by one according to the coordinate position in a plain map. An attacker can easily obtain the key values by analyzing the relationship between the cipher vector map and the plain vector map, which will lead to the ineffectiveness of the scrambling operation. To solve the problem, a vector map encryption algorithm based on a double random position permutation strategy is proposed in this paper. First, the secret key sequence is generated using a four-dimensional quadratic autonomous hyperchaotic system. Then, all coordinates of the vector map are encrypted using the strategy of double random position permutation. Lastly, the encrypted coordinates are reorganized according to the vector map structure to obtain the cipher map. Experimental results show that: (1) one-to-one mapping between the plain vector map and cipher vector map is prevented from happening; (2) scrambling encryption between different map objects is achieved; (3) hackers cannot obtain the permutation key value by analyzing the pairs of the plain map and cipher map.

scholarly journals Vector Map Random Encryption Algorithm Based on Multi-Scale Simplification and Gaussian Distribution

2019 ◽  
Vol 9 (22) ◽  
pp. 4889 ◽  
Author(s):  
Pham ◽  
Ngo ◽  
Bui ◽  
Tran ◽  
Lee ◽  
...  
Keyword(s):  
Gaussian Distribution ◽  
Computation Time ◽  
Geographical Information ◽  
Encryption Algorithm ◽  
Secret Key ◽  
Multi Scale ◽  
Vector Map ◽  
Vector Maps ◽  
Illegal Copying ◽  
Map Data

In recent years, GIS (Geographical Information System) vector maps are widely used in everyday life, science, and the military. However, the production process of vector maps is expensive, and a large volume of vector map data is easily stolen and illegally distributed. Therefore, original providers desire an encryption solution to encrypt GIS vector map data before being stored and transmitted in order to prevent pirate attacks and to ensure secure transmission. In this paper, we propose an encryption algorithm for GIS vector map data for preventing illegal copying, and ensuring secured storage and transmission. Polyline/polygon data of GIS vector maps are extracted to compute a backbone object. The backbone object is then selectively simplified by the multi-scale simplification algorithm in order to determine the feature vertices of the backbone object. The feature vertices of the backbone object are encrypted by the advanced encryption standard and the secret key. Finally, all vertices of the backbone object are randomized by the random Gaussian distribution algorithm to obtain the encrypted GIS vector map. Experimental results show that the entire map is altered completely after the encryption process. The proposed method is responsive to the various GIS vector map data formats, and also provides better security than previous methods. The computation time of the proposed method is also significantly shorter than that of previous methods.

scholarly journals Image Blocking Encryption Algorithm Based on Laser Chaos Synchronization

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Shu-Ying Wang ◽  
Jian-Feng Zhao ◽  
Xian-Feng Li ◽  
Li-Tao Zhang
Keyword(s):  
Chaos Synchronization ◽  
Image Transmission ◽  
Encryption Algorithm ◽  
Encryption Scheme ◽  
Secret Key ◽  
Response System ◽  
Plain Image ◽  
Arnold Transformation ◽  
The Relationship ◽  
Synchronization Accuracy

In view of the digital image transmission security, based on laser chaos synchronization and Arnold cat map, a novel image encryption scheme is proposed. Based on pixel values of plain image a parameter is generated to influence the secret key. Sequences of the drive system and response system are pretreated by the same method and make image blocking encryption scheme for plain image. Finally, pixels position are scrambled by general Arnold transformation. In decryption process, the chaotic synchronization accuracy is fully considered and the relationship between the effect of synchronization and decryption is analyzed, which has characteristics of high precision, higher efficiency, simplicity, flexibility, and better controllability. The experimental results show that the encryption algorithm image has high security and good antijamming performance.

scholarly journals Image Encryption Algorithm Based on a Novel Six-Dimensional Hyper- Chaotic System

2020 ◽  
Vol 31 (1) ◽  
pp. 54
Author(s):  
Sadiq A. Mehdi ◽  
Zaydon Latif Ali
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Data Security ◽  
Initial Conditions ◽  
Multimedia Data ◽  
Encryption Algorithm ◽  
Hyperchaotic System ◽  
Secret Key ◽  
Promising Alternative ◽  
Multimedia Data Security

Due to the rapid evaluation in the field of communications and multimedia and the increasing use of the Internet, multimedia data security has become very urgent. of the best alternative way to achieve multimedia data security is encryption, which prevents unauthorized entities from accessing confidential data. In recent years, the chaotic system of image encryption becomes an efficient way to encrypt images due to its high security. It has certain special properties like sensitivity to initial conditions, and control parameters, pseudorandom, ergodicity, and non-convergence, etc. chaotic dynamics systems became a promising alternative to traditional encryption algorithms. In this paper, This paper presents a new algorithm for the image encryption/decryption scheme depended on a  novel six-dimensional hyper-chaotic system to achieve a high level of security, the chaotic sequence generated from system employ for permutation and diffusion the original image to create an encrypted image.  The performance of  the algorithm has been analyzed through analyzes statistical such  as  Histogram  Analysis,  Correlation  Coefficient  Analysis,  Information  Entropy Analysis, Key Space Analysis, Key Sensitivity Analysis, Number of Pixels Change Rate (NPCR), Unified Average Changing Intensity (UACI), Peak Signal to Noise Ratio, The experimental results show that the algorithm has good encryption performance, large keyspace equals to  and the high sensitivity  for  small  changes  in  secret key  which makes  the  algorithm  immune  to Brute  force  attacks,  and  it  can  resist  the  statistical  attacks, therefore,  the presented  encryption  algorithm depends on a novel hyperchaotic system is more secure against the statistical and differential attacks.

scholarly journals Quantum Dual Signature with Coherent States Based on Chained Phase-Controlled Operations

2020 ◽  
Vol 10 (4) ◽  
pp. 1353 ◽  
Author(s):  
Jinjing Shi ◽  
Shuhui Chen ◽  
Jiali Liu ◽  
Fangfang Li ◽  
Yanyan Feng ◽  
...  
Keyword(s):  
Coherent States ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
High Fidelity ◽  
Signature Scheme ◽  
Secret Key ◽  
Simulation Experiments ◽  
Quantum Devices ◽  
Shared Secret ◽  
Cnot Operation

A novel encryption algorithm called the chained phase-controlled operation (CPCO) is presented in this paper, inspired by CNOT operation, which indicates a stronger correlation among message states and each message state depending on not only its corresponding key but also other message states and their associated keys. Thus, it can prevent forgery effectively. According to the encryption algorithm CPCO and the classical dual signature protocols, a quantum dual signature scheme based on coherent states is proposed in this paper. It involves three participants, the customer Alice, the merchant Bob and the bank Trent. Alice expects to send her order message and payment message to Bob and Trent, respectively. It is required that the two messages must be linked to guarantee the payment is paid for the corresponding order. Thus, Alice can generate a quantum dual signature to achieve the goal. In detail, Alice firstly signs her two messages with the shared secret key. Then She connects the two signatures into a quantum dual signature. Finally, Bob and Trent severally verify the signatures of the order message and the payment message. Security analysis shows that our scheme can ensure its security against forgery, repudiation and denial. In addition, simulation experiments based on the Strawberry Fields platform are performed to valid the feasibility of CPCO. Experimental results demonstrate that CPCO is viable and the expected coherent states can be acquired with high fidelity, which indicates that the encryption algorithm of the scheme can be implemented on quantum devices effectively.

scholarly journals MODEL STRUCTURES ON TRIANGULATED CATEGORIES

2014 ◽  
Vol 57 (2) ◽  
pp. 263-284 ◽  
Author(s):  
XIAOYAN YANG
Keyword(s):  
Proper Class ◽  
Triangulated Category ◽  
Triangulated Categories ◽  
General Study ◽  
Proper Class Of Triangles ◽  
Cotorsion Pairs ◽  
One To One ◽  
The Relationship ◽  
Model Structures

AbstractWe define model structures on a triangulated category with respect to some proper classes of triangles and give a general study of triangulated model structures. We look at the relationship between these model structures and cotorsion pairs with respect to a proper class of triangles on the triangulated category. In particular, we get Hovey's one-to-one correspondence between triangulated model structures and complete cotorsion pairs with respect to a proper class of triangles. Some applications are given.

scholarly journals System to Safeguard the Identity of Persons in Photographs through Cryptography and Steganography Techniques Using Chaos

2018 ◽  
Vol 2018 ◽  
pp. 1-16
Author(s):  
Octavio Flores Siordia ◽  
Juan Carlos Estrada Gutiérrez ◽  
Carlos Eduardo Padilla Leyferman ◽  
Jorge Aguilar Santiago ◽  
Maricela Jiménez Rodríguez
Keyword(s):  
High Sensitivity ◽  
Encryption Algorithm ◽  
Coding System ◽  
Secret Key ◽  
Least Significant Bit ◽  
Large Space ◽  
Plain Text ◽  
Chaotic Orbits ◽  
Diffusion Technique ◽  
Plain Image

Safeguarding the identity of people in photographs or videos published through social networks or television is of great importance to those who do not wish to be recognized. In this paper, a face detecting and coding system is designed with the goal of solving this problem. Mathematical models to generate chaotic orbits are deployed. One of them applies the diffusion technique to scramble the pixels of each face while another implements the confusion technique to alter the relation between plain text and ciphered text. Afterward, another two orbits are utilized for the steganography technique to modify the least significant bit (LSB) to conceal data that would allow authorized users to decipher the faces. To verify the robustness of the proposed encryption algorithm, different tests are performed with the Lena standard image, such as correlation diagrams, histograms, and entropy. In addition, occlusion, noise, and plain image attacks are performed. The results are compared with those of other works, and the proposed system provided high sensitivity at secret key and a large space for the encryption keys, good speed for ciphering, disorder in the cryptogram, security, data integrity, and robustness against different attacks.

Sign in / Sign up

Export Citation Format

Share Document