Xiaopeng Wei

A novel image encryption algorithm based on DNA subsequence operation.

We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret keys space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack.

An image encryption algorithm based on DNA sequence addition operation

A new image encryption algorithm based on DNA sequence addition operation is presented. First, a DNA sequence matrix is obtained by encoding the original image. Second, divide the DNA sequence matrix into some equal blocks and use DNA sequence addition operation to add these blocks. Thirdly, carry out DNA sequence complement operation for the result of added matrix by using two Logistic maps. At last, decoding the DNA sequence matrix from the third step, we will get the encrypted image. The simulation experimental results and security analysis show that our algorithm not only can get good encryption effect, but also can resist exhaustive attack, statistical attack and differential attack.

DNA Word Set Design Based on Minimum Free Energy

The problem of data and information encoding on DNA bears an increasing interest for both biological and nonbiological applications of biomolecular computing. Recent experimental and theoretical advances have produced and tested to obtain large code sets of oligonucleotides to support virtually any kind of application. In this paper, we have developed an algorithm to design DNA short-word sets based on minimum free energy (MFE) criteria. The MFE constraint is the minimum value among free energies of all the possible structures and the effective approach to control the generation of unexpected secondary structure of DNA sequences may cause error. The algorithm is constructive and directly produces the actual DNA words of the sets, unlike other academic and statistical numbers. According to the previous values, our experimental results can succeed in generating better DNA word sets based on MFE constraint. More importantly, using our results could decrease the emergence of false hybridization reaction, and improve the reliability and the scale of DNA computing.

Image Encryption Algorithm Based on DNA Sequences for the Big Image

With the fast development of Internet technology and informationprocessing technology, the image is commonly transmitted via theInternet. People enjoy the convenience and shortcut, but people haveto face to the obsession that the important image information intransmission is easily intercepted by unknown persons or hackers. Inorder to enhance the image information security, image encryptionbecomes an important research direction. An image encryptionalgorithm based on DNA sequences for the big image is presented inthis paper. The main purpose of this algorithm is to reduce the bigimage encryption time. This algorithm is implemented by using thenatural DNA sequences as main keys. The first part is the process ofpixel scrambling. The original image is confused in the light of thescrambling sequence is generated by the DNA sequence. The secondpart is the process of pixel replacement. The pixel gray values ofthe new image and the one of the three encryption templates aregenerated by the other DNA sequence are XORed bit-by-bit in turn.The experimental result demonstrates that the image encryptionalgorithm is feasible and simple. Through performance analysis, thisalgorithm is robust against all kinds of attacks and owns highersecurity.

Improved hybrid optimization algorithm for 3D protein structure prediction

A new improved hybrid optimization algorithm - PGATS algorithm, which is based on toy off-lattice model, is presented for dealing with three-dimensional protein structure prediction problems. The algorithm combines the particle swarm optimization (PSO), genetic algorithm (GA), and tabu search (TS) algorithms. Otherwise, we also take some different improved strategies. The factor of stochastic disturbance is joined in the particle swarm optimization to improve the search ability; the operations of crossover and mutation that are in the genetic algorithm are changed to a kind of random liner method; at last tabu search algorithm is improved by appending a mutation operator. Through the combination of a variety of strategies and algorithms, the protein structure prediction (PSP) in a 3D off-lattice model is achieved. The PSP problem is an NP-hard problem, but the problem can be attributed to a global optimization problem of multi-extremum and multi-parameters. This is the theoretical principle of the hybrid optimization algorithm that is proposed in this paper. The algorithm combines local search and global search, which overcomes the shortcoming of a single algorithm, giving full play to the advantage of each algorithm. In the current universal standard sequences, Fibonacci sequences and real protein sequences are certified. Experiments show that the proposed new method outperforms single algorithms on the accuracy of calculating the protein sequence energy value, which is proved to be an effective way to predict the structure of proteins.

A Summarization on Image Encryption

Abstract With the fast development of the computer technology and information processing technology, the problem of information security is becoming more and more important. Information hiding is usually used to protect the important information from disclosing when it is transmitting over an insecure channel. Digital image encryption is one of the most important methods of image information hiding and camouflage. The image encryption techniques mainly include compression methodology, modern cryptography mechanism, chaos techniques, DNA techniques, and so on. In this paper, we summarize the main encryption algorithms and classify them based on the means. In particular, chaos-based and DNA cryptography-based image encryption algorithms are illustrated and analyzed in detail. Finally, the future direction in this field is discussed.

Parallel DNA Arithmetic Operation With One Error Detection Based on 3-Moduli Set

The redundant residue number system is introduced into DNA computing in order to overcome the negative effect caused by the instability of the biochemical reactions and the error hybridizations. Based on the Adleman-Lipton model and a special 3-moduli set, the DNA encoding scheme for redundant residue numbers is presented and the DNA algorithm of one-digit error detection is proposed. The parallel DNA arithmetic operation can be realized in redundant residue number system with error detection, and which can improve the reliability of DNA computing and simplify the DNA encoding scheme.

Enhanced hybrid search algorithm for protein structure prediction using the 3D-HP lattice model

The problem of protein structure prediction in the hydrophobic-polar (HP) lattice model is the prediction of protein tertiary structure. This problem is usually referred to as the protein folding problem. This paper presents a method for the application of an enhanced hybrid search algorithm to the problem of protein folding prediction, using the three dimensional (3D) HP lattice model. The enhanced hybrid search algorithm is a combination of the particle swarm optimizer (PSO) and tabu search (TS) algorithms. Since the PSO algorithm entraps local minimum in later evolution extremely easily, we combined PSO with the TS algorithm, which has properties of global optimization. Since the technologies of crossover and mutation are applied many times to PSO and TS algorithms, so enhanced hybrid search algorithm is called the MCMPSO-TS (multiple crossover and mutation PSO-TS) algorithm. Experimental results show that the MCMPSO-TS algorithm can find the best solutions so far for the listed benchmarks, which will help comparison with any future paper approach. Moreover, real protein sequences and Fibonacci sequences are verified in the 3D HP lattice model for the first time. Compared with the previous evolutionary algorithms, the new hybrid search algorithm is novel, and can be used effectively to predict 3D protein folding structure. With continuous development and changes in amino acids sequences, the new algorithm will also make a contribution to the study of new protein sequences.

An image encryption algorithm based on DNA self-assembly technology

DNA self-assembly that is fast developed in the fields of DNA computing and nano technology has become the focus of scientific fields. DNA self-assembly is a method that uses the characteristics of base-pair to form polyhedron or super molecular structure. This is a complex progress from disordered to well-ordered, from simple to complicated. This paper mainly introduces that the DNA self-assembly technology is applied into the image encryption. In this paper, we proposed a complete design scheme of DNA tiles that is suitable for the image encryption. The DNA tiles mainly include five types, namely DNA tiles of the plaintext, DNA tiles of the encryption, DNA tiles of the cipertext, DNA tiles of the key and DNA tiles of the decryption. Through a simulate example, the effect of the image encryption algorithm is shown.

IMAGE ENCRYPTION BASED ON CHAOTIC MAP AND REVERSIBLE INTEGER WAVELET TRANSFORM

Abstract In recent years, there has been growing interesting in image encryption based on chaotic maps and wavelet transform. In this paper, a novel scheme for image encryption based on chaotic maps and reversible integer wavelet transform is proposed. Firstly, the cipher key which is related to plain-image is used to generate different parameters and initial values of chaotic maps. Then the plain-image is permuted by the order from chaotic maps, and processed by integer wavelet transform. A part of transform coefficient is diffused by the orbits of chaotic maps. Finally, the cipher image is obtained by inverse integer wavelet transform based on the diffused coefficient. Numerical experimental results and comparing with previous works show that the proposed scheme possesses higher security than previous works, which is suitable for protecting the image information.