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.
KeywordsDiscrete Logarithm Hamiltonian Path Computational Device Massive Parallelism Hamiltonian Path Problem
Unable to display preview. Download preview PDF.
- [A94]L. Adleman. “Molecular Computation of Solutions to Combinatorial Problems.” Science 266 (November 1994), 1021–1024.Google Scholar
- [CLR90]T. Cormen, C. Leiserson, R. Rivest. Introduction to Algorithms. New York: McGraw Hill, 1990.Google Scholar
- [Sho94]P. Shor. “Algorithms for Quantum Computation: Discrete Logarithms and Factoring.” Proceedings of the 35th FOCS, IEEE, 1994, 124–134.Google Scholar