Factoring: The DNA Solution

@inproceedings{Beaver1994FactoringTD,
  title={Factoring: The DNA Solution},
  author={Donald Beaver},
  booktitle={ASIACRYPT},
  year={1994}
}
  • Donald Beaver
  • Published in ASIACRYPT 28 November 1994
  • Computer Science
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. 
Molecular Computing
TLDR
A molecular Turing machine is designed and it is shown that such molecular computers can in fact compute PSPACE, under the generous assumptions implicit in A94].
The Emergence of the Discipline of Biomolecular Computation in the US
TLDR
A description of the recent evolution in the US of an emerging technology known as DNA Computation from its early stages to its development and extension into other areas such as nanotechnology, emerging as a viable sub-discipline of science and engineering.
DNA Computing: A Survey
TLDR
A review on DNA computing: molecular biology is used to suggest a new way of solving a NP-complete problem, and strands of DNA are used to encode the problem and to manipulate them using techniques commonly available in any molecular biology laboratory, in order to simulate operations that select the solution of the problem, if it exists.
DNA Computing and Its Application to Information Security Field
TLDR
Some schemes with secret key searching with DNA computing are analyzed and the application of DNA computing in encryption, steganography and authentication is introduced.
Parallel Biomolecular Computation: Models and Simulations
  • J. Reif
  • Computer Science
    Algorithmica
  • 1999
TLDR
Techniques for executing lengthy computations using short DNA strands by more or less conventional biotechnology engineering techniques within a small number of lab steps are described, in the context of well defined abstract models of biomolecular computation.
DNA computing: applications and challenges
TLDR
A review of recent advances in DNA computing is presented and molecular-scale autonomous programmable computers are demonstrated allowing both input and output information to be in molecular form.
Parallel molecular computation
  • J. Reif
  • Computer Science
    SPAA '95
  • 1995
TLDR
The first, the Parallel Associative Memory (PAM) Model, is a very high level model which appears to improve the power of molecular parallelism beyond the operations previously considered by Lipton, and two abstract models of molecular computation are proposed.
Research on DNA Cryptosystem Based on DNA Computing
TLDR
This paper depicts several DNA cryptosystems, further analyzes the security and performance of these schemes, summarizes the shortcomings of current DNA cryptography research, and looks forward to its development prospect in the field of information security.
Light-Weighted DNA-Based Cryptographic Mechanism Against Chosen Cipher Text Attacks
TLDR
The formal and experimental analysis not only shows that this Biotic Pseudo DNA cryptography method is powerful against brute force attack and chosen cipher text attacks, but also it is very efficient in storage, computation as well as transmission.
The emerging discipline of biomolecular computation in the US
  • J. Reif
  • Biology
    New Generation Computing
  • 2009
TLDR
A description of the recent evolution in the US of an emerging technology known as DNA Computation from its early stages to its development and extension into other areas such as nanotechnology, emerging as a viable sub-discipline of science and engineering.
...
1
2
3
...

References

SHOWING 1-3 OF 3 REFERENCES
Molecular computation of solutions to combinatorial problems.
TLDR
This experiment demonstrates the feasibility of carrying out computations at the molecular level by solving an instance of the directed Hamiltonian path problem with standard protocols and enzymes.
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
TLDR
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
Introduction to Algorithms
TLDR
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.