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 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 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.

scholarly journals Double image multi-encryption algorithm based on fractional chaotic time series

2015 ◽  
Vol 13 (1) ◽  
Author(s):  
Zhenghong Guo ◽  
Jie Yang ◽  
Yang Zhao
Keyword(s):  
Time Series ◽  
Chaotic Time Series ◽  
Encryption Algorithm ◽  
Brute Force ◽  
Double Image ◽  
Key Space ◽  
Plain Image ◽  
Image Pixels ◽  
Brute Force Attack ◽  
The Relationship

AbstractIn this paper, we introduce a new image encryption scheme based on fractional chaotic time series, in which shuffling the positions blocks of plain-image and changing the grey values of image pixels are combined to confuse the relationship between the plain-image and the cipher-image. Also, the experimental results demonstrate that the key space is large enough to resist the brute-force attack and the distribution of grey values of the encrypted image has a random-like behavior.

scholarly journals BREAKING AN IMAGE ENCRYPTION ALGORITHM BASED ON CHAOS

2011 ◽  
Vol 21 (07) ◽  
pp. 2067-2076 ◽  
Author(s):  
CHENGQING LI ◽  
MICHAEL Z. Q. CHEN ◽  
KWOK-TUNG LO
Keyword(s):  
Image Encryption ◽  
Experimental Results ◽  
Encryption Algorithm ◽  
Secret Key ◽  
Differential Attack ◽  
Plain Image ◽  
Image Encryption Algorithm

Recently, a chaos-based image encryption algorithm called MCKBA (Modified Chaotic-Key Based Algorithm) was proposed. This paper analyzes the security of MCKBA and finds that it can be broken with a differential attack, which requires only four chosen plain-images. Performance of the attack is verified by experimental results. In addition, some defects of MCKBA, including insensitivity with respect to changes of plain-image/secret key, are reported.

scholarly journals Adaptive Chaotic Image Encryption Algorithm Based on RNA and Pixel Depth

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1770
Author(s):  
Xiaoqiang Zhang ◽  
Xuangang Yan
Keyword(s):  
Image Encryption ◽  
Three Dimensional ◽  
Encryption Algorithm ◽  
Current Time ◽  
Plain Image ◽  
Scope Of Application ◽  
Selective Diffusion ◽  
Chaotic Image Encryption ◽  
And Diffusion ◽  
Image Encryption Algorithm

To prevent the leakage of image content, image encryption technology has received increasing attention. Most current algorithms are only suitable for the images of certain types and cannot update keys in a timely manner. To tackle such problems, we propose an adaptive chaotic image encryption algorithm based on RNA and pixel depth. Firstly, a novel chaotic system, two-dimensional improved Logistic-adjusted-Sine map is designed. Then, we propose a three-dimensional adaptive Arnold transform for scrambling. Secondly, keys are generated by the hash values of the plain image and current time to achieve one-image, one-key, and one-time pad simultaneously. Thirdly, we build a pre-permuted RNA cube for 3D adaptive scrambling by pixel depth, chaotic sequences, and adaptive RNA coding. Finally, selective diffusion combined with pixel depth and RNA operations is performed, in which the RNA operators are determined by the chemical structure and properties of amino acids. Pixel depth is integrated into the whole procedure of parameter generation, scrambling, and diffusion. Experiments and algorithm analyses show that our algorithm has strong security, desirable performance, and a broader scope of application.

scholarly journals Multi-Omic Meta-Analysis of Transcriptomes and the Bibliome Uncovers Novel Hypoxia-Inducible Genes

Biomedicines ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 582
Author(s):  
Yoko Ono ◽  
Hidemasa Bono
Keyword(s):  
Meta Analysis ◽  
Hypoxia Inducible Factor ◽  
Data Driven ◽  
Similarity Coefficients ◽  
Hypoxia Inducible Factor 1 ◽  
Response System ◽  
Inducible Genes ◽  
The Relationship ◽  
G Protein Coupled ◽  
Sufficient Oxygen

Hypoxia is a condition in which cells, tissues, or organisms are deprived of sufficient oxygen supply. Aerobic organisms have a hypoxic response system, represented by hypoxia-inducible factor 1-α (HIF1A), to adapt to this condition. Due to publication bias, there has been little focus on genes other than well-known signature hypoxia-inducible genes. Therefore, in this study, we performed a meta-analysis to identify novel hypoxia-inducible genes. We searched publicly available transcriptome databases to obtain hypoxia-related experimental data, retrieved the metadata, and manually curated it. We selected the genes that are differentially expressed by hypoxic stimulation, and evaluated their relevance in hypoxia by performing enrichment analyses. Next, we performed a bibliometric analysis using gene2pubmed data to examine genes that have not been well studied in relation to hypoxia. Gene2pubmed data provides information about the relationship between genes and publications. We calculated and evaluated the number of reports and similarity coefficients of each gene to HIF1A, which is a representative gene in hypoxia studies. In this data-driven study, we report that several genes that were not known to be associated with hypoxia, including the G protein-coupled receptor 146 gene, are upregulated by hypoxic stimulation.

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.

CHAOS SYNCHRONIZATION VIA UNIDIRECTIONAL COUPLING AND ITS APPLICATION TO SECURE COMMUNICATION

2009 ◽  
Vol 23 (32) ◽  
pp. 5949-5964 ◽  
Author(s):  
XINGYUAN WANG ◽  
MINGJUN WANG
Keyword(s):  
Secure Communication ◽  
Chaos Synchronization ◽  
Function Method ◽  
The Self ◽  
Largest Lyapunov Exponent ◽  
Global Synchronization ◽  
Unidirectional Coupling ◽  
Response System ◽  
Lyapunov Function Method ◽  
Simulation Results

This paper studies chaos synchronization via unidirectional coupling. The self-synchronization of Lorenz systems, modified coupled dynamos systems and hyperchaotic Chen systems is studied by three methods: the Lyapunov function method, the global synchronization method and the numerical calculation of the largest Lyapunov exponent method. In regard to application to communication, we show that via transmitting single signal the synchronization of the drive system and the response system can be achieved. An example of applying self-synchronization of hyperchaotic Chen systems to chaotic masking secure communication is presented in this paper. Simulation results show the effectiveness of the method.

A CUBIC EL-GAMAL ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE AND ELLIPTIC CURVE

2021 ◽  
Vol 10 (11) ◽  
pp. 3439-3447
Author(s):  
T. J. Wong ◽  
L. F. Koo ◽  
F. H. Naning ◽  
A. F. N. Rasedee ◽  
M. M. Magiman ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Mathematical Problem ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Encryption Scheme ◽  
Secret Key ◽  
Chosen Plaintext Attack ◽  
The Public ◽  
Lucas Sequence

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.

Hiding Data in Plain Sight: Towards Provably Unbreakable Encryption with Short Secret Keys and One-Way Functions

2021 ◽  
Author(s):  
Mircea-Adrian Digulescu
Keyword(s):  
Encryption Scheme ◽  
Secret Key ◽  
Small Probability ◽  
Random Data ◽  
Computing Power ◽  
Plain Text ◽  
Secret Keys ◽  
The One ◽  
One Way Function ◽  
The Cost

It has long been known that cryptographic schemes offering provably unbreakable security exist, namely the One Time Pad (OTP). The OTP, however, comes at the cost of a very long secret key - as long as the plain-text itself. In this paper we propose an encryption scheme which we (boldly) claim offers the same level of security as the OTP, while allowing for much shorter keys, of size polylogarithmic in the computing power available to the adversary. The Scheme requires a large sequence of truly random words, of length polynomial in the both plain-text size and the logarithm of the computing power the adversary has. We claim that it ensures such an attacker cannot discern the cipher output from random data, except with small probability. We also show how it can be adapted to allow for several plain-texts to be encrypted in the same cipher output, with almost independent keys. Also, we describe how it can be used in lieu of a One Way Function.

Sign in / Sign up

Export Citation Format

Share Document