DNA COMPUTING

Click to edit Master subtitle style

3/2/12

What is meant by computing??

Computingis usually defined as the activity of using and improving computer hardwareandsoftware

3/2/12

Ok.. Fine we perform computing by enhancing the s/w and h/w Are you really sure that the content which u have enhanced is truly protected from intruders..??? DEFINITELY NOT.

Hence to enhance the security of your data we go for the concept of

3/2/12

Data encryption

What is Encrypting???
the process of transforming information(referred to asplaintext) using analgorithm(called acipher) to make it unreadable to anyone except those possessing special knowledge, usually referred to as a key. The result of the process isencrypted information
3/2/12 Where decryption is the reverse of

 Ok we are done with encryption

Is the encryption you performed secure ?? Not really !!!!

3/2/12

SECURITY ATTACKS PASSIVE ATTACKS RELEAS E OF MESSA GE CONTE NTS TRAFF IC ANALY SIS ACTIVE ATTACKS MASQUE RADE MODIFICA TION DENI AL

3/2/12

Till now most of the encryption algorithms were breakable(except the RSA algorithm) As modern encryption algorithms are broken, the world of information security looks in new directions to protect the data it transmits.
3/2/12

What is DNA??

3/2/12

patterns of inheritance from parent to offspring, and gene distribution, variation and change inpopulations.

Deoxyribonucleic acidis a nucleic acidcontaining thegenetic instructions used in the development and functioning of all known livingorganisms. Within the cells of any organism is a substance called Deoxyribonucleic Acid (DNA) which is a doublestranded helix of nucleotides which 3/2/12

Strands of DNA are long polymers of millions of linked nucleotides. These nucleotides consist of one of four nitrogen bases, a five carbon sugar and a phosphate group. The nucleotides that make up these polymers are named after the nitrogen base that it consists of; Adenine (A), Cytosine (C), Guanine (G) and Thymine (T).
A T

3/2/12

What does all this chemistry and biology have to do with security you might ask?

3/2/12

Basics and Origins of DNA Computing DNA computing or molecular computing are terms used to describe utilizing the inherent combinational properties of DNA for massively parallel computation. The idea is that with an appropriate setup and enough DNA, one can potentially solve huge mathematical problems by parallel search. Basically this means that you can attempt every solution to a given problem until you 3/2/12 came across the right one through

The concept of using DNA computing in the fields of cryptography and steganography has been identified as a possible technology that may bring forward a new hope for unbreakable algorithms.

Stegano s ~hidden Graphei n ~write

3/2/12

In 1994, Leonard Adleman introduced the idea of using DNA to solve complex mathematical problems. Adleman, a computer scientist at the University of Southern California, came to the conclusion that DNA had computational potential after reading the book "Molecular Biology of the Gene," written by James Watson, who codiscovered the structure of DNA in 1953. In fact, DNA is very similar to a 3/2/12 computer hard drive in how it stores

Adleman put his theory of DNA computing to the test on a problem called the Hamiltonian Path problem or sometimes referred to as the Traveling Salesman Problem known as the non deterministic polynomial time problem(NP). The crux of the problem is that the salesman must find a route to travel that passes through each city (A through G) exactly once, with a designated beginning and end

3/2/12

Here are the steps taken in the Adleman DNA computer experiment: Strategy -1 Strands of DNA represent the seven cities. In genes, genetic coding is represented by the letters A, T, C and G. Some sequence of these four letters represented each city and possible flight path. Los AngelesGCTACG
3/2/12ChicagoCTAGTA

The molecules can be made by a machine called a DNA synthesizer. Itineraries can then be produced from the city encoding by linking them together in proper order.

DNA replication Polymerase chain reaction Oligonucleotide synthesis Gene synthesis

3/2/12

To accomplish this you can take advantage of the fact that DNA hybridizes with its complimentary sequence. For example, you can encode the routes between cities by encoding the compliment of the second half (last three letters) of the departure city and the first half (first three letters) of the arrival city. route between Miami (CTACGG) and NY (ATGCCG) can be made by taking the second half of the coding for 3/2/12

Path obtained

Random itineraries can be made by mixing city encodings with the route encodings. Finally, the DNA strands can be connected together by an enzyme called ligase.What we are left with are strands of DNA representing itineraries with a random number of cities and random set of routes. We can be confident that we have all possible combinations including the correct one by using an excess of DNA encodings, say 10^13 copies of each city and each route between cities. Remember DNA is a highly compact data format, so numbers are on our side. 3/2/12

Strategy 2: Selectively copy and amplify only the section of the DNA that starts with LA and ends with NY by using the Polymerase Chain Reaction.

After Part I, we now have a test tube full of various lengths of DNA that encode possible routes between cities. What we want are routes that start with LA and end with NY To accomplish this we can use a technique . called Polymerase Chain Reaction(PCR). What we end up with after PCR is a test tube full of double stranded DNA of various lengths, encoding itineraries that start with LA and end with NY .
3/2/12

Strategy 3:Sort the DNA by length and select the DNA whose length corresponds to 5 cities.

Our test tube is now filled with DNA encoded itineraries that start with LA and end with NY, where the number of cities in between LA and NY varies. We now want to select those itineraries that are five cities long. To accomplish this we can use a technique called Gel Electrophoresis

3/2/12

Strategy 4: Successively filter the DNA molecules by city, one city at a time. Since the DNA we start with contains five cities, we will be left with strands that encode each city once. DNA containing a specific sequence can be purified from a sample of mixed DNA by a technique called affinity purification.

This is exactly what we are looking for. If the answer exists we would retrieve it at this step

3/2/12

DNA Steganography

The principles used in this experiment used a simple code to convert the letters of the alphabet into combinations of the four bases which make up DNA and create a strand of DNA based on that code. A piece of DNA spelling out the message to be hidden is synthetically created which contains the secret encrypted message in the middle plus short marker sequences at the ends of the 3/2/12 message. The encoded piece of DNA

DNA Steganography. a:Structure of secret message DNA strand illustrating marker sequences. B: key used to encode message in DNA. 3/2/12 d: Gel analysis of DNA strand. d: Sequence of cloned product of PCR

DNA Authentication

Forms of DNA authentication have already been used for such

official clothing from the Sydney Olympic Games,

items as the

Here is the authentication performed using this technology

sports collectibles and limited edition art markets such as original animation cells distributed by the Hanna Barbara group of artists. In the case of the clothing used in the Sydney Olympic Games, a Canadian company named DNA Technologies was able to showcase its DNA-tagging abilities on the world stage in the summer of 2000. All Olympic merchandise from shirts and hats 3/2/12 to pins and coffee mugs were tagged with special ink that contained DNA taken from an unnamed Australian athlete.

A hand held scanner is then used to scan the inked area of the clothing to determine if a piece of merchandise is authentic or not. As it is estimated that the human genome is roughly 3 billion base pairs in size, and the samples taken were from a random athlete from a Olympic team of hundreds, the possibility of counterfeiting this merchandise is difficult to say the least. For the Sydney games, DNA inks were applied too nearly 50 million items at a cost of about five cents each, including licensing, databasing , and back-end support. There are possibilities of this type of technology to be used in the arenas of currency and other such brandable items where existing authentication methods such as holograms are proving ineffective 3/2/12 and costly. DNA-tagging is much cheaper in

Advantages of DNA computing Speed Conventional computers

can perform approximately 100 MIPS (millions of instruction per second). Combining DNA strands as demonstrated by Adleman, made computations equivalent to or better, arguably over 100 times faster than the fastest computer. The inherent parallelism of DNA computing was staggering.

3/2/12

Minimal Storage Requirements

Applications
A lot of research has been going on in this field and here is description of two softwares based on the concept of DNA computing and this idea of implementing the idea on DNA Computing in sotwares is called Soft Molecular Computing. 1.EDNA, integrated software platform

This software takes advantage of digital computers to gain realistic 3/2/12