A new DNA cryptogram scheme based on PCR technology.

Yunpeng Zhang; Yasin Hasan; Dongwei Zhou; Liu He; Bochen Fu

No Detail Found!

A new DNA cryptogram scheme based on PCR technology.

Author(s)

Yunpeng Zhang School of Software and Microelectronics, Northwestern Polytechnical University, Xi’an, 710072, China

Yasin Hasan Imperial College London, London, SW3 6NP, UK

Dongwei Zhou School of Software and Microelectronics, Northwestern Polytechnical University, Xi’an, 710072, China; Imperial College London, London, SW3 6NP, UK

Liu He School of Software and Microelectronics, Northwestern Polytechnical University, Xi’an, 710072, China; Imperial College London, London, SW3 6NP, UK

Bochen Fu School of Software and Microelectronics, Northwestern Polytechnical University, Xi’an, 710072, China; Imperial College London, London, SW3 6NP, UK

Abstract

In the condition of the traditional cryptogram which has been breached successively, this paper mainly studies the current cryptography-DNA cryptogram. Using biology question which has none solution in “if we don’t know the correct primer situations from an unknown mixture of trying to isolate specific DNA of DNA is quite difficult” as the safety of constructing DNA encryption algorithm. Using the chaotic system which is constructed by using Logistic chaos mapping and Henon chaos mapping to produce the pseudorandom to process the plaintext and eliminate the statistical rule. Building the encryption algorithm, and analyzing the DNA encryption algorithm based on PCR technology. And improve the algorithm in the key space, security, and experiment. Doing exclusive or operation between the binary code of plaintext, we can get the new code, and then append the primers. By this way, we can increase the number of primers, and the attackers can never get the plaintext unless he get all DNA chain with information. In addition, it will lead the failure if the target DNA chain is too long when doing the PCR amplification. In this encryption algorithm, the PCR amplification can be successfully by dividing the binary code of plaintext into many short sequences. This paper uses encryption examples to describe the whole encryption algorithm, and then analyses the security and maneuverability of the whole system. And then we get the whole system.

Publication Details

Page(s) 232-238

DOI DOI not available

Published Journal: Journal of Theoretical and Applied Information Technology, Volume: 45, Issue: 1, Year: 2012

Request the full text from PASTIC

Citations

Downloads

149

Views