• 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
A method for obtaining digital signatures and public-key cryptosystems
TLDR
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys. Expand
Molecular computation of solutions to combinatorial problems.
  • L. Adleman
  • Computer Science, Medicine
  • Science
  • 1 November 1994
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. Expand
Quantum Computability
TLDR
It is shown that when quantum Turing machines are restricted to have transition amplitudes which are algebraic numbers, BQP, EQP, and nondeterministic quantum polynomial time (NQP) are all contained in PP, hence in P and PSPACE. Expand
Running time and program size for self-assembled squares
TLDR
The development of a computational theory of self-assembly promises to provide a new conduit by which results and methods of theoretical computer science might be applied to problems of interest in biology and the physical sciences. Expand
Two theorems on random polynomial time
  • L. Adleman
  • Mathematics, Computer Science
  • 19th Annual Symposium on Foundations of Computer…
  • 16 October 1978
TLDR
Where the traditional method of polynomial reduction has been inapplicable, randomness has been used in demonstrating intractibility by Adleman and Manders, and in showing problems equivalent by Rabin, a new examination of randomness is in order. Expand
Combinatorial optimization problems in self-assembly
TLDR
Two combinatorial optimization problems related to efficient self-assembly of shapes in the Tile Assembly Model of self- assembly proposed by Rothemund and Winfree are studied, and it is proved that the first problem is NP-complete in general, and polynomial time solvable on trees and squares. Expand
A subexponential algorithm for the discrete logarithm problem with applications to cryptography
  • L. Adleman
  • Computer Science
  • 20th Annual Symposium on Foundations of Computer…
  • 29 October 1979
TLDR
A new algorithm is presented for the Discrete Logarithm Problem which runs in RTIME better than O(qE) for all E > O and the most efficient incarnation of this algorithm runs inRTIME O(2(O(/10g(q)loglog(q))). Expand
The function field sieve
  • L. Adleman
  • Mathematics, Computer Science
  • ANTS
  • 6 May 1994
TLDR
An heuristic analysis shows that there exists a ce ℜ>0 such that the function field sieve computes discrete logarithms within random time. Expand
On constructing a molecular computer
TLDR
Practical aspects of constructing a molecular computer are considered and it is suggested that under some circumstances computers based on molecular interactions may be a viable alternative to computersbased on electronics. Expand
...
1
2
3
4
5
...