• Publications
  • Influence
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two importantExpand
  • 10,287
  • 771
  • PDF
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1)Expand
  • 6,131
  • 451
  • PDF
Molecular computation of solutions to combinatorial problems.
  • L. Adleman
  • Computer Science, Medicine
  • Science
  • 1 November 1994
The tools of molecular biology were used to solve an instance of the directed Hamiltonian path problem. A small graph was encoded in molecules of DNA, and the "operations" of the computation wereExpand
  • 2,659
  • 133
  • PDF
Quantum Computability
In this paper some theoretical and (potentially) practical aspects of quantum computing are considered. Using the tools of transcendental number theory it is demonstrated that quantum Turing machinesExpand
  • 245
  • 36
  • PDF
Running time and program size for self-assembled squares
Recently Rothemund and Winfree [6] have considered the program size complexity of constructing squares by self-assembly. Here, we consider the time complexity of such constructions using a naturalExpand
  • 229
  • 34
  • PDF
Two theorems on random polynomial time
  • L. Adleman
  • Computer Science
  • 19th Annual Symposium on Foundations of Computer…
  • 16 October 1978
The use of randomness in computation was first studied in abstraction by Gill [4]. In recent years its use in both practical and theoretical areas has become apparent. Strassen and Solovay [10];Expand
  • 341
  • 27
The function field sieve
  • L. Adleman
  • Mathematics, Computer Science
  • ANTS
  • 6 May 1994
The fastest method known for factoring integers is the ‘number field sieve’. An analogous method over function fields is developed, the ‘function field sieve’, and applied to calculating discreteExpand
  • 131
  • 23
Combinatorial optimization problems in self-assembly
Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used inExpand
  • 152
  • 22
  • PDF
Solution of a 20-Variable 3-SAT Problem on a DNA Computer
A 20-variable instance of the NP-complete three-satisfiability (3-SAT) problem was solved on a simple DNA computer. The unique answer was found after an exhaustive search of more than 1 million (220)Expand
  • 477
  • 20
  • PDF
On constructing a molecular computer
It has recently been suggested that under some circumstances computers based on molecular interactions may be a viable alternative to computers based on electronics. Here, some practical aspects ofExpand
  • 223
  • 20