Factoring: The DNA Solution

We consider molecular models for computing and derive a DNA-based mechanism for solving intractable problems through massive parallelism. In principle, such methods might reduce the effort needed to solve otherwise difficult tasks, such as factoring large numbers. We investigate the application of such techniques to cryptography.

[1]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[2]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[3]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.