Factoring: The DNA solution

  • Donald Beaver
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 917)


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.


Discrete Logarithm Hamiltonian Path Computational Device Massive Parallelism Hamiltonian Path Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A94]
    L. Adleman. “Molecular Computation of Solutions to Combinatorial Problems.” Science 266 (November 1994), 1021–1024.Google Scholar
  2. [CLR90]
    T. Cormen, C. Leiserson, R. Rivest. Introduction to Algorithms. New York: McGraw Hill, 1990.Google Scholar
  3. [Sho94]
    P. Shor. “Algorithms for Quantum Computation: Discrete Logarithms and Factoring.” Proceedings of the 35th FOCS, IEEE, 1994, 124–134.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Donald Beaver
    • 1
  1. 1.State CollegePenn State UniversityUSA

Personalised recommendations