Dna Cryptology: A Brief Survey and a DNA Algorithm for Breaking a Proposotional Logic Based Cryptosystom.

Date of Submission

December 2003

Date of Award

Winter 12-12-2004

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Theoretical Statistics and Mathematics Unit (TSMU-Kolkata)


Barua, Rana (TSMU-Kolkata; ISI)

Abstract (Summary of the Work)

The ain of the project is study the mothods in DNA eryptology and to present. an attack on a cryptosystem bnsexd on propositional logic which is presented in (10] and shown to be optimal In the seuse thnt any eryptanalytic attack agalnat it can be uIRed to brenk other eryptosystema N well. Such a eryplanalytle methol eomlel nlnu le unel to molwe in polymninl time, the Iembershlp prolblem of any Inngunge in NPCo-NI.Tom lend 6] has given an elegant aul simple DNA algnrithm to solve Llhe SAT and other hard problems. Artificial plastniels are crented, which are clreular double-stranded DNA taoleculen. The DNA computation is domn lıy Initializing with this single mnlrenlar varirty combining the operations of eut and puste into a single componnd operation.


ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843391

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.



This document is currently not available here.