Book ChapterDOI
Binary Arithmetic for DNA Computers
Rana Barua,Janardan Misra +1 more
- pp 124-132
Reads0
Chats0
TLDR
A (recursive) DNA algorithm for adding two binary numbers which require O(log n) bio-steps using only O(n) different type of DNA strands, where n is the size of the binary string representing the largest of the two numbers.Abstract:
We propose a (recursive) DNA algorithm for adding two binary numbers which require O(log n) bio-steps using only O(n) different type of DNA strands, where n is the size of the binary string representing the largest of the two numbers. The salient feature of our technique is that the input strands and the output strands have exactly the same structure which makes it fully procedural unlike most methods proposed so far. Logical operations of binary numbers can easily be performed by our method and hence can be used for cryptographic purpose.read more
Citations
More filters
Journal ArticleDOI
Fast parallel molecular algorithms for DNA-based computation: factoring integers
TL;DR: To factor the product of two large prime numbers, is a breakthrough in basic biological operations using a molecular computer and indicates that the cryptosystems using public-key are perhaps insecure and presents clear evidence of the ability of molecular computing to perform complicated mathematical operations.
Journal ArticleDOI
Parallel DNA arithmetic operation based on n-moduli set
Xuedong Zheng,Jin Xu,Wu Li +2 more
TL;DR: An improved DNA representation of an integer is presented and applied in DNA arithmetic operation based on a special n-moduli set and the degree of parallelism in residue arithmetic operation is n.
Journal ArticleDOI
The principle of recursive genome function.
TL;DR: The principle of recursive genome function (PRGF) is put forward, effectively reversing two axioms of genomics as the authors used to know it, prior to the Encyclopedia of DNA Elements Project (ENCODE).
Proceedings ArticleDOI
Fast parallel molecular algorithms for DNA-based computation: factoring integers
Weng-Long Chang,M. Ho,Minyi Guo +2 more
TL;DR: Three DNA-based algorithms - parallel subtractor, parallel comparator and parallel modular arithmetic - are proposed that formally verify the designed molecular solutions for factoring the product of two large prime numbers.
Proceedings ArticleDOI
Finite field arithmetic using self-assembly of DNA tilings
Rana Barua,Shantanu Das +1 more
TL;DR: This work shows how the DNA self assembly process can be used for computing finite field multiplication and addition, parallely and at very low cost.
References
More filters
Book
Cryptography: Theory and Practice
TL;DR: The object of the book is to produce a general, comprehensive textbook that treats all the essential core areas of cryptography.
Book
Computer Architecture and Organization
TL;DR: Computer Architecture and Organization, 3rd edition, provides a comprehensive and up-to-date view of the architecture and internal organization of computers from a mainly hardware perspective.
Book ChapterDOI
DNA-based Cryptography
TL;DR: Some procedures for DNA-based cryptography based on one-time-pads that are in principle unbreakable are presented, and a class of DNA steganography systems, which secretly tag the input DNA and then hide it within collections of other DNA are examined.
Journal ArticleDOI
On the computational power of DNA
TL;DR: It is shown how DNA-based computers can be used to solve the satisfiability problem for boolean circuits and how DNA computers can solve optimization problems directly without first solving several decision problems.
Journal ArticleDOI
Making DNA Add
TL;DR: The development of a DNA-based algorithm for addition in a form permitting a chain of primer extension reactions to carry out the addition operation of two nonnegative binary numbers is presented.