Improving Reliability in DNA based Computations with Applications to Cryptography
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of Cincinnati / OhioLINK
2012
|
| Subjects: | |
| Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=ucin1352992351 |
| id |
ndltd-OhioLink-oai-etd.ohiolink.edu-ucin1352992351 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-OhioLink-oai-etd.ohiolink.edu-ucin13529923512021-08-03T05:20:30Z Improving Reliability in DNA based Computations with Applications to Cryptography Mantha, Anusha Computer Engineering DNA computing has become an attractive alternative to traditional computing techniques due to the large storage capacity of DNA, massive parallelism and energy efficiency of the computations. However, since DNA computing is based on bio-molecular reactions, it is not error free. One of the main sources of these errors is false hybridizations between unintended sequences during the computation process. An efficient way to minimize these errors is through designing error-resistant DNA sequences. The DNA encoding problem is the design of DNA sequences in such a way that every DNA sequence hybridizes with its own complementary sequence during the computation process. In this thesis, the DNA encoding problem has been studied and approached using the simulated annealing algorithm. Several combinatorial constraints have been considered to optimize the DNA sequences so that they are resistant to false hybridizations during the computations. A cost function which captures the DNA design requirements has been developed and minimized using simulated annealing algorithm. Also, application of DNA computations to the field of cryptography has been studied. A new cryptographic algorithm based on linear self-assembly of DNA has been proposed in which the rate of hybridization errors could be controlled using the error-resistant DNA sequences generated using the simulated annealing algorithm in this work. A simulation framework to simulate the DNA cryptography algorithms has been developed using an object oriented approach. The DNA self assembly based cryptography algorithm developed in this work and an existing DNA cryptography algorithm based on polymerase chain reaction have been simulated and compared in terms of the implementation time complexity. 2012 English text University of Cincinnati / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=ucin1352992351 http://rave.ohiolink.edu/etdc/view?acc_num=ucin1352992351 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws. |
| collection |
NDLTD |
| language |
English |
| sources |
NDLTD |
| topic |
Computer Engineering |
| spellingShingle |
Computer Engineering Mantha, Anusha Improving Reliability in DNA based Computations with Applications to Cryptography |
| author |
Mantha, Anusha |
| author_facet |
Mantha, Anusha |
| author_sort |
Mantha, Anusha |
| title |
Improving Reliability in DNA based Computations with Applications to Cryptography |
| title_short |
Improving Reliability in DNA based Computations with Applications to Cryptography |
| title_full |
Improving Reliability in DNA based Computations with Applications to Cryptography |
| title_fullStr |
Improving Reliability in DNA based Computations with Applications to Cryptography |
| title_full_unstemmed |
Improving Reliability in DNA based Computations with Applications to Cryptography |
| title_sort |
improving reliability in dna based computations with applications to cryptography |
| publisher |
University of Cincinnati / OhioLINK |
| publishDate |
2012 |
| url |
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1352992351 |
| work_keys_str_mv |
AT manthaanusha improvingreliabilityindnabasedcomputationswithapplicationstocryptography |
| _version_ |
1719418889619636224 |