DNA Computing Technique Research Articles

A Novel Hybrid Image Hiding Technique using Elliptic Curve Cryptography and DNA Computing Technique

The proposed novel hybrid image hiding techniques uses the security features of ECC for encrypting the secret image before embedding with cover image and also map the secret image with DNA nucleotide to improve the level of security with high embedding capacity. In the proposed image steganography, the secret image is fed as input to the ECC encryption algorithm and the resultant ciphertext point is mapped with DNA nucleotide, and then converts it into binary digits. Second, the cover image is compressed by using DWT compression techniques. The compressed image is used as a cover image to embed the secret image by using a singular value decomposition algorithm. The resultant stego image will have high PSNR and less MSE. Results show that 36.23% decreased value of MSE value and 5.6% increased value of PSNR for 512 × 512 image size.

A novel hybrid image hiding technique using elliptic curve cryptography and DNA computing technique

The proposed novel hybrid image hiding techniques uses the security features of ECC for encrypting the secret image before embedding with cover image and also map the secret image with DNA nucleotide to improve the level of security with high embedding capacity. In the proposed image steganography, the secret image is fed as input to the ECC encryption algorithm and the resultant ciphertext point is mapped with DNA nucleotide, and then converts it into binary digits. Second, the cover image is compressed by using DWT compression techniques. The compressed image is used as a cover image to embed the secret image by using a singular value decomposition algorithm. The resultant stego image will have high PSNR and less MSE. Results show that 36.23% decreased value of MSE value and 5.6% increased value of PSNR for 512 × 512 image size.

DNA Computing Based Encryption Algorithm for Wireless Multimedia Communication System

Transmission of digital images for wireless multimedia communication system requires reliable security in storage which is a challenging task. So many works are carried out to develop and implement the cryptographic techniques for a wireless multimedia communication system. A traditional symmetric key cryptographic algorithm such as Light weight Data Encryption Standard cipher, Advanced Encryption Standard cipher, Triple-DES, Twofish, Blowfish, RC5 etc played a major role to transmit and receive the multimedia (text, image and video) data. Proposed DNA computing based authentication algorithm provides secure transmission of multimedia data by using symmetric key cryptography techniques. DNA computing techniques provides a higher level of security and enables the user to store a large amount of data. Finally, it shows the implemented result analysis the performance of different symmetric key cryptographic techniques using the simulation parameters such as power consumption, key size, processing time, memory space, speed and latency. It also improves the security level by incorporating the advantage of DNA cryptography to achieve a high level of security against various attacks.

Real parallel and constant delay logic circuit design methodology based on the DNA model-of-computation

DNA is known as the building block of live organisms for storing the life codes and transferring the genetic features through the generations. However, it is found that DNA strands can be used for a new kind of computation. DNA computation proposes a new level of impressive degree of parallelism that is not feasible with conventional electronic computers. However, available computational models cannot be used for massive parallelism in DNA computing and new computation models and techniques should be developed.In this paper, a new computational model and methodology is proposed to use the massive parallelism of DNA-based circuits. In the proposed model, billions of DNA strands are utilized to compute the elements of the Boolean function concurrently to reach a high level of parallelism. Simulation and analytical results prove the feasibility and efficiency of the proposed method. Moreover, analyses and results show that delay of a circuit in this method is independent from the complexity of the function and each Boolean function can be computed with O(1) time complexity.

PCR and Bio-signature for data confidentiality and integrity in mobile cloud computing

Cloud computing technology got relevance as computing paradigm, which delivers massively scalable computing technologies based on the Internet for the organizations. Mobile Cloud Computing (MCC) allows users more possibilities to access services conveniently. But data security and privacy issues still act as barriers for adoption to cloud technology when dealing with confidential data. Encryption techniques play a significant role in ensuring data security in the Cloud. Various data encryption techniques have been evolved till the date of which DNA Computing techniques got wider acceptance due to biological complexity and computational properties of DNA. These features can be exploited to solve data security issues in MCC. This paper highlights the security issues in the MCC and proposes biocomputing solution approaches to address data security. A methodology is proposed based on the principle concepts of polymerase chain reaction and primer generation for ensuring data confidentiality and integrity. The security analysis of the proposed cryptosystem is evaluated by theoretical analysis, complexity and probability analysis. Formal analysis of the proposed protocol is done using Scyther and all the modeled claims are validated and positive results are obtained.

Amplification and Quantification of an Antisense Oligonucleotide from Target microRNA Using Programmable DNA and a Biological Nanopore.

This paper describes a strategy for autonomous diagnoses of cancers using microRNA (miRNA) and therapy for tumor cells by DNA computing techniques and nanopore measurement. Theranostics, which involves the combination of diagnosis and therapy, has emerged as an approach for personalized medicine or point-of-care cancer diagnostics. DNA computing will become a potent tool for theranostics because it functions completely autonomously without the need for external regulations. However, conventional theranostics using DNA computing involves a one-to-one reaction in which a single input molecule generates a single output molecule; the concentration of the antisense drug is insufficient for the therapy in this type of reaction. Herein we developed an amplification system involving an isothermal reaction in which a large amount of the antisense DNA drug was autonomously generated after detecting miRNA from small cell lung cancer. In addition, we successfully quantified the amount of the generated drug molecule by nanopore measurement with high accuracy, which was more accurate than conventional gel electrophoresis. This autonomous amplification strategy is a potent candidate for a broad range of theranostics using DNA computing.

The Generative Capacity of Probabilistic Splicing Systems

The concept of probabilistic splicing system was introduced as a model for stochastic processes using DNA computing techniques. In this paper we introduce splicing systems endowed with different continuous and discrete probabilistic distributions and call them as probabilistic splicing systems. We show that any continuous distribution does not increase the generative capacity of the probabilistic splicing systems with finite components, meanwhile, some discrete distributions increase their generative capacity up to context-sensitive languages. Finally, we associate certain thresholds with probabilistic splicing systems and this increases the computational power of splicing systems with finite components.

Hybrid secure GSM architecture using DNA computing-based hyperelliptic curve cryptography

Wireless mobile communication has become more familiar and popular among other communication system for transmitting data to enable the user to communicate with other third parties at any place at any time. Due to third party interception, transmission of data, connection establishment, connection release, billing processes are in insecure environments. So many researchers had put their effort to develop an innovative authentication scheme for GSM network. The existing authentication scheme provides security with high communication and computational overhead using a symmetric key cryptography. The proposed scheme mainly focuses on providing security to global system for mobile communication system using hyperelliptic curve cryptography and DNA computing technique for mutual authentication, secret key generation and, data encryption and decryption algorithm. Finally, a security analysis shows that authentication algorithm is more secure and efficient.

Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique

Spatial cluster analysis is an important data mining task. Typical techniques include CLARANS, density- and gravity-based clustering, and other algorithms based on traditional von Neumann's computing architecture. The purpose of this paper is to propose a technique for spatial cluster analysis based on sticker systems of DNA computing. We will adopt the Bin-Packing Problem idea and then design algorithms of sticker programming. The proposed technique has a better time complexity. In the case when only the intracluster dissimilarity is taken into account, this time complexity is polynomial in the amount of data points, which reduces the NP-completeness nature of spatial cluster analysis. The new technique provides an alternative method for traditional cluster analysis.

A Novel Multi-Client Authentication Method Using Infection of Bacteria

The massive parallelism and data hiding capabilities inherent in DNA strands make them innovative media to base security primitives. In this paper we propose an authentication scheme based on infection of Escherichia coli bacteria. Our scheme is the first illustration of using DNA computing techniques in authentication. Our proposed technique simply simulates a client-server network and each one of the clients keeps a test tube containing their encoded identity. We have conducted a security analysis for our scheme, which demonstrates that it is hard for an adversary to extract users' identities. Our scheme can be easily implemented using genetic engineering techniques and with the growth of utilizing genetic engineering techniques in computing, it will supersede the traditional trends for authentication of clients in networks.

A CLIQUE algorithm using DNA computing techniques based on closed-circle DNA sequences

Abstract DNA computing has been applied in broad fields such as graph theory, finite state problems, and combinatorial problem. DNA computing approaches are more suitable used to solve many combinatorial problems because of the vast parallelism and high-density storage. The CLIQUE algorithm is one of the gird-based clustering techniques for spatial data. It is the combinatorial problem of the density cells. Therefore we utilize DNA computing using the closed-circle DNA sequences to execute the CLIQUE algorithm for the two-dimensional data. In our study, the process of clustering becomes a parallel bio-chemical reaction and the DNA sequences representing the marked cells can be combined to form a closed-circle DNA sequences. This strategy is a new application of DNA computing. Although the strategy is only for the two-dimensional data, it provides a new idea to consider the grids to be vertexes in a graph and transform the search problem into a combinatorial problem.

Prostate cancer classification processor using DNA computing technique

Recently, classification and gene selection of DNA microarray data are important in biomedical research. DNA microarray data provide useful information that can be used to discover the complex mechanism of cancer development. DNA computing techniques are alternative approaches to analyze the DNA microarray data.In this paper, we propose the VLSI implementation of a prostate cancer classification processor. The proposed architecture uses parallel and pipelined processing to improve speed and uses cyclic random masks to reduce memory size. We evaluated the prostate cancer classification processor by testing its performance on prostate cancer microarray data. From the experimental results, the proposed architecture reduced the memory size and classification time with little loss of classification accuracy.

A surface-based DNA algorithm for the minimal vertex coverproblem*

Abstract DNA computing was proposed for solving a class of intractable computational problems, of whichthe computing time will grow exponentially with the problem size. Up to now. many achievements have been made to improve its performance and increase its reliability. It has been shownmany times that the surface-based DNA computing technique has very low error rate, but the technique has not been widely used in the DNA computing algorithms design. In this paper, a surface-based DNA computing algorithm for minimal vertex cover problem, a problem well-known for its exponential difficulty, is introduced. This work provides further evidence for the ability of surface-based DNA computing in solving NP-complete problems.