Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/8281
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSrivastava, A.-
dc.contributor.authorPandey, V.-
dc.date.accessioned2020-03-30T10:18:20Z-
dc.date.available2020-03-30T10:18:20Z-
dc.date.issued2013-
dc.identifier.citationProceedings of the 2013 3rd IEEE International Advance Computing Conference, IACC 2013, 2013, Vol., , pp.769-774en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/8281-
dc.description.abstractThe computational and storage limitations with silicon computers have propelled computer scientists to search for new dimensions in computer science. DNA computing emerges out to be a very promising field. The use of DNA strands would enable us to do complex calculations in seconds, which would have otherwise needed years. The volumes of data that can be stored have reached a new limit. Recently researchers of Harvard crack DNA storage and have been able to cram 700 terabytes of data into a single gram of DNA strand While developing any system a lot of design issues have to be taken into consideration and same is applicable for DNA computers. The paper makes an effort to deal with the consistency issue of DNA computers. A proof of inconsistency is provided and ground rules to a few DNA based cryptosystems are indexed which take advantage of the inconsistency and make use of it for data security. � 2013 IEEE.en_US
dc.titleInconsistency in DNA computing and it's use in cryptographyen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
8281.pdf177.09 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.