DNA and DNA Computing in Security Practices â€œ Is the Future in Our Genes?
As modern encryption algorithms are broken, the world of information security looks in new directions to protect the data it transmits. 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. Is the fledgling field of DNA computing the next cornerstone in the world of information security or is our time better spent following other paths for our data encryption algorithms of the future?
This paper will outline some of the basics of DNA and DNA computing and its use in the areas of cryptography, steganography and authentication.
Research has been performed in both cryptographic and steganographic situations with respect to DNA computing. The constraints of its high tech lab requirements and computational limitations combined with the labour intensive extrapolation means, illustrate that the field of DNA computing is far from any kind of efficient use in todayâ„¢s security world. DNA authentication on the other hand, has exhibited great promise with real world examples already surfacing on the marketplace today.
The world of encryption appears to be ever shrinking. Several years ago the thought of a 56-bit encryption technology seemed forever safe, but as mankind'sâ„¢ collective computing power and knowledge increases, the safety of the worldâ„¢s encryption methods seems to disappear equally as fast. Mathematicians and physicists attempt to improve on encryption methods while staying within the confines of the technologies available to us. Existing encryption algorithms such as RSA have not yet been compromised but many fear the day may come when even this bastion of encryption will fall. There is hope for new encryption algorithms on the horizon utilizing mathematical principles such as Quantum Theory however the science of our very genetic makeup is also showing promise for the information security world.
The concepts of utilizing DNA computing in the field of data encryption and DNA authentication methods for thwarting the counterfeiting industry are subjects that have been surfacing in the media of late. How realistic are these concepts and is it feasible to see these technologies changing the security marketplace of today?
What is DNA?
Before delving into the principles of DNA computing, we must have a basic understanding of what DNA actually is. All organisms on this planet are made of the same type of genetic blueprint which bind us together. The way in which that blueprint is coded is the deciding factor as to whether you will be bald, have a bulbous nose, male, female or even whether you will be a human or an oak tree.
Within the cells of any organism is a substance called Deoxyribonucleic Acid (DNA) which is a double-stranded helix of nucleotides which carries the genetic information of a cell. This information is the code used within cells to form proteins and is the building block upon which life is formed.
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 ©, Guanine (G) and Thymine (T). These nucleotides will only combine in such a way that C always pairs with G and T always pairs with A.
The two strands of a DNA molecule are antiparallel where each strand runs in an opposite direction. Figure 1 illustrates two strands of DNA and the bonding priciples of of the 4 types of nucleotides and the Figure 2 illustrates the double helix shape of DNA.
Fig 1 â€œ Graphical representation of inherent bonding properties of DNA  Fig 2 â€œ Illustration of double helix shape of DNA. 
The combination of these 4 nucleotides in the estimated million long polymer strands can result in billions of combinations within a single DNA double-helix. These massive amount of combinations allows for the multitude of differences between every living thing on the planet from the large scale (mammal vs. plant), to the small (blue eyes vs. green eyes).
With the advances in DNA research in projects such as the Human Genome project (a research effort to characterize the genomes of human and selected model organisms through complete mapping and sequencing of their DNA ) and a host of others, the mystery of DNA and its construction is slowly being unraveled through mathematical means. Distinct formulae and patterns have emerged that may have implications well beyond those found in the fields of genetics.
What does all this chemistry and biology have to do with security you might ask? To answer that question we must first look at how biological science can be applied to mathematical computation in a field known as DNA computing.
Basics and Origins of DNA Computing
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 came across the right one through random calculation. Utilizing DNA for this type of computation can be much faster than utilizing a conventional computer.
Leonard Adleman, a computer scientist at the University of Southern California was the first to pose the theory that the makeup of DNA and itâ„¢s multitude of possible combining nucleotides could have application in brute force computational search techniques.
In early 1994, 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. (Fig. 3)
Fig. 3 â€œ Basic outline of ËœTraveling Salesmanâ„¢ Problem representing the 7 cities and one way streets between them.
The NP problem was chosen for Adlemanâ„¢s DNA computing test as it is a type of problem that is difficult for conventional computers to solve. The inherent parallel computing ability of DNA combination however is perfectly suited for NP problem solving.
Adleman, using a basic 7 city, 13 street model for the Traveling Salesman Problem, created randomly sequenced DNA strands 20 bases long to chemically represent each city and a complementary 20 base strand that overlaps each cityâ„¢s strand halfway to represent each street (Fig. 4). This representation allowed each multi-city tour to become a piece of double stranded DNA with the cities linked in some order by the streets.
Fig 4. â€œ Representation of 20 base DNA strand representing a city showing the bonding tendencies of nucleotides to DNA strands representing pathways between the cities.
By placing a few grams of every DNA city and street in a test tube and allowing the natural bonding tendencies of the DNA building blocks to occur, the DNA bonding created over answers in less than one second. Of course, not all of those answers that came about in that one second were right answers as Adleman only needed to keep those paths that exhibited the following properties:0
1. The path must start at city A and end at city G.
2. Of those paths, the correct paths must pass through all 7 cities at least once.
3. The final path(s) must contain each city in turn.
The Ëœcorrectâ„¢ answer was determined by filtering the strands of DNA according to their end-bases to determine which strands begin from city A and end in city G and discarding those that did not. The remaining strands were then measured through electrophoreic techniques to determine if the path they represent has passed through all 7 cities.
Adleman found his one true path for the ËœSalesmanâ„¢ in his problem and the possible future of DNA computing opened up in front of him. The ability to solve problems with larger numbers of cities and paths using the same techniques was immediately feasible.
For example a group of researchers at Princeton in early 2000 demonstrated an RNA computer similar to Adlemanâ„¢s which had the ability to solve a chess problem involving how many ways there are to place knights on a chess board so that none can take the others.
Adleman instantly envisioned the use of DNA computing for any type of computational problems that require massive amounts of parallel computing. The possibility existed of the very genetic makeup of an individual being used in the encryption/decryption of data from/to that person. The possibility was also seen that the DNA of an individual will give them the Ëœwho you areâ„¢ portion of the Ëœwho you areâ„¢, Ëœwhat you knowâ„¢, Ëœwhat you haveâ„¢ aspects of security authentication.
There has been much speculation of the use of this type of technology for cryptographic and steganographic means that would take advantage of the parallel computation possibilities available with DNA computing.
ËœDNA-based Cryptographyâ„¢ which puts an argument forward that the high level computational ability and incredibly compact information storage media of DNA computing has the possibility of DNA based cryptography based on one time pads. They argue that current practical applications of cryptographic systems based on one-time pads is limited to the confines of conventional electronic media whereas as small amount of DNA can suffice for a huge one time pad for use in public key infrastructure (PKI). 
To put this into terms of the common Alice and Bob description of secure data transmission and reception, they are basing their argument of DNA cryptography on Bob providing Alice his public key, and Alice will use it to send an encrypted message to him. The potential eavesdropper, Eve, will have an incredible amount of work to perform to attempt decryption of their transmission than either Alice or Bob.
Public key encryption splits the key up into a public key for encryption and a secret key for decryption. It's not possible to determine the secret key from the public key. Bob generates a pair of keys and tells everyone his public key, while only he knows his secret key. Anyone can use Bob's public key to send him an encrypted message, but only Bob knows the secret key to decrypt it. This scheme allows Alice and Bob to communicate in secret without having to physically meet as in symmetric encryption methods. 
Fig 5. Public Key Encryption illustrated.
Injecting DNA cryptography into the common PKI scenario, the researchers from Duke argue that we have the ability to follow the same inherent pattern of PKI but using the inherent massively parallel computing properties of DNA bonding to perform the encryption and decryption of the public and private keys.
It can easily be argued that DNA computing is just classical computing, albeit highly parallelized; thus with a large enough key, one should be able to thwart any DNA computer that can be built. This puts the idea of this form of DNA computing at great risk in the field of cryptography. As well, the obstacles of utilizing this kind of technology outside of a lab are extremely high.
Origins of Steganography
Steganography is a variety of encryption that completely hides text or graphics, usually unencrypted, within other text or graphics that are electronically transmitted.
The term steganography derives from the Greek words steganos meaning hidden and graphein meaning to write. One of the early Grecian methods of steganography was to shave the head of a messenger, tattoo the message to be hidden .
Throughout our history there have been many other forms of steganography used to hide messages such as the use of null ciphers, invisible inks and others. In World War II for example, German cryptographers devised a method of using microdots to conceal messages within messages themselves.
More recently, computer technology and the Internet have provided a medium for steganography that has been unseen in the past. The ability to transfer text and images is now instantaneous and accessible by individuals virtually everywhere on the planet. It has been reported that the Al Queda network of terrorists may have used steganographic means to hide their communications in organizing the September 11th attacks on the United States of America.
Readily available software applications such as the freeware application JPHide and JPSeek will encrypt messages with the common JPG format of graphic files. Other applications give the user the ability to hide data within other graphic formats such as GIF or BMP and audio formats such as MP3. Messages can now be hidden in the inconspicuous advertising banners of web pages and the music files we listen to.
Much like the world of data transmission, the steganographic world is on the lookout for the encryption methods that cannot be broken. Can DNA steganography provide that unbreakable encryption medium?
Experiments in DNA Steganography have been conducted by Carter Bancroft and his team at the Mt. Sinai School of Medicine to encrypt hidden messages within microdots.
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 message. The encoded piece of DNA is then placed into a normal piece of human DNA which is then mixed with DNA strands of similar length. The mixture is then dried on to paper that can be cutup into microdots with each dot containing billions of strands of DNA. Not only is the microdot difficult to detect on the plain message medium but only one strand of those billions within the microdot contains the message.
The key to decrypting the message lies in knowing which markers on each end of the DNA are the correct ones which mean there must be some sort of shared secret that is transmitted previously for this type of transmission to work successfully. Once the strand is determined via identifying the markers, the recipient uses polymerase chain reaction to multiply only the DNA which contains the message and applies the simple code to finally decode the true message.  Utilizing these methods, Bancroft and his team were successfully able to encode and decode the famous message ËœJune 6 Invasion: Normandyâ„¢ within a microdot placed in the full stops on a posted typed letter.
Fig 6. DNA Steganography. a, Structure of secret message DNA strand illustrating marker sequences. b, key used to encode message in DNA. c, Gel analysis of DNA strand. d, Sequence of cloned product of PCR amplification and resulting encoded message. 
The DNA microdot team does see this technology having applications in another field however â€œ that of authentication. With the amount of plant and animal genetic engineering that is taking place today and will continue to do so in the future, this methodology would allow engineers to place DNA authentication stamps within organisms they are working with to easily detect counterfeits or copyright infringements.
It is worth mentioning that DNA authentication is currently at work in the marketplace today albeit not in the genetic engineering form envisioned by Bancroft and his team. Forms of DNA authentication have already been used for such items as the official clothing from the Sydney Olympic Games, 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 to pins and coffee mugs were tagged with special ink that contained DNA taken from an unnamed Australian athlete. DNA was taken via saliva samples from the athlete and mixed into existing ink compounds which was in turn used in the regular merchandise manufacturing process. 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 and costly. DNA-tagging is much cheaper in comparison and ultimately more difficult to thwart.
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.
Minimal Storage Requirements â€œ DNA stores memory at a density of about 1 bit per cubic nanometer where conventional storage media requires cubic nanometers to store 1 bit. In essence, mankinds collective knowledge could theoretically be stored in a small bucket of DNA solution.
Minimal Power Requirements - There is no power required for DNA computing while the computation is taking place. The chemical bonds that are the building blocks of DNA happen without any outside power source. There is no comparison to the power requirements of conventional computers.
The field of DNA computing is still in its infancy and the applications for this technology are still not fully understood.Is DNA computing viable â€œ perhaps, but the obstacles that face the field such as the extrapolation and practical computational environments required are daunting. DNA authentication methods on the other hand have shown great promise in the marketplace of today and it is hoped that its applications will continue to expand.
The beauty of both these DNA research trends is found in the possibility of mankindsâ„¢ utilization of its very life building blocks to solve its most difficult problems. DNA computing research has resulted in significant progress towards the ability to create molecules with the desired properties . This ability could have important applications in biology ,chemistry and medicine,a strong argument for continued research.
1. Gehani, Ashish. La Bean, Thomas H. Reif, John H. DNA-Based Cryptography. Department of Computer Science, Duke University. June 1999, http://cs.duke.edu/~reif/paper/DNAcrypt/crypt.pdf
2. Gupta, Gaurav. Mehra, Nipun. Chakraverty, Shumpa. DNA Computing. The Indian Programmer. June 12, 2001. http://theindianprogrammertechnology/dna_computing.htm
3. Peterson, Ivars. Hiding in DNA. Science News Online. April 8, 2000. http://sciencenews20000408/mathtrek.asp
4. Blahere, Kristina. DNA Computing. CNET. April 26, 2000. http://cnettechtrends
5. Frequently Asked Questions About Todayâ„¢s Cryptography 4.1 - Section 7.19 What is DNA Computing. RSA Laboratories. http://rsasecurityrsalabs/faq/7-19.html
6. Friedman, Yali. DNA Based Computers. http://dna2zdnacpu/dna2.html
7. Gehani, Ashish. La Bean, Thomas H. Reif, John H. DNA-Based Cryptography. Department of Computer Science, Duke University. June 1999, http://cs.duke.edu/~reif/paper/DNAcrypt/crypt.pdf
8. Gupta, Gaurav. Mehra, Nipun. Chakraverty, Shumpa. DNA Computing. The Indian Programmer. June 12, 2001. http://theindianprogrammertechnology/dna_computing.htm
9. Peterson, Ivars. Hiding in DNA. Science News Online. April 8, 2000. http://sciencenews20000408/mathtrek.asp
10. Blahere, Kristina. DNA Computing. CNET. April 26, 2000. http://cnettechtrends
11. Frequently Asked Questions About Todayâ„¢s Cryptography 4.1 - Section 7.19 What is DNA Computing. RSA Laboratories. http://rsasecurityrsalabs/faq/7-19.html
12. Friedman, Yali. DNA Based Computers. http://dna2zdnacpu/dna2.html