Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L. Adleman. “Molecular Computation of Solutions to Combinatorial Problems.” Science 266 (November 1994), 1021–1024.
T. Cormen, C. Leiserson, R. Rivest. Introduction to Algorithms. New York: McGraw Hill, 1990.
P. Shor. “Algorithms for Quantum Computation: Discrete Logarithms and Factoring.” Proceedings of the 35th FOCS, IEEE, 1994, 124–134.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaver, D. (1995). Factoring: The DNA solution. In: Pieprzyk, J., Safavi-Naini, R. (eds) Advances in Cryptology — ASIACRYPT'94. ASIACRYPT 1994. Lecture Notes in Computer Science, vol 917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000453
Download citation
DOI: https://doi.org/10.1007/BFb0000453
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59339-3
Online ISBN: 978-3-540-49236-8
eBook Packages: Springer Book Archive