Computer architecture and organization; (2nd ed.)
Computer architecture and organization; (2nd ed.)
Cryptography: Theory and Practice
Cryptography: Theory and Practice
DNA-based Parallel Computation of Simple Arithmetic
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Simulating Boolean Circuits on a DNA Computer
Simulating Boolean Circuits on a DNA Computer
Fastest parallel molecular algorithms for the elliptic curve discrete logarithm problem over GF(2n)
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
An improved DNA-sticker addition algorithm and its application to logarithmic arithmetic
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Natural Computing: an international journal
| Hi-index | 0.00 |
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.