# Leonard Adleman

> 1945– · Computer Scientist, Co-creator of RSA
>
> **Recorded contribution:** RSA algorithm (the "A"); DNA computing pioneer

## How to use this dossier

Read for a causal chain, not a hero story: inherited problem → contribution → mechanism → downstream capability → limit. Then close the page and complete the reconstruction exercise from memory.

## 1. Historical orientation

Leonard Adleman (born 1945) is the 'A' in RSA, developed with Ron Rivest and Adi Shamir at MIT in 1977. RSA uses modular exponentiation and the practical difficulty of factoring a large composite to support public-key encryption and signatures. Adleman also initiated DNA computing by encoding a small Hamiltonian-path instance in DNA molecules and using biochemical operations to filter candidate paths. RSA credit is intrinsically tripartite, and Clifford Cocks had devised a classified equivalent earlier at GCHQ. DNA computing demonstrated massive molecular parallelism, not a generally faster replacement for electronic computers.

## 2. The problem inherited

Public-key concepts needed a concrete scheme for encryption and signatures, while researchers wondered whether biochemical molecules could serve as programmable information-processing substrates.

## 3. The central contribution

Adleman co-created RSA and later proved by experiment that DNA encoding, hybridization, and laboratory selection can carry out a combinatorial computation.

## 4. Reconstruct the mechanism

1. For RSA, choose two large primes, publish their product and an exponent, and keep the inverse exponent derived from the factorization secret.
2. Map a message into the permitted numeric domain and apply modular exponentiation with the public or private exponent.
3. Rely on the inverse exponent to recover or verify the message, while secure deployment adds padding and strict encoding.
4. For DNA computation, encode vertices and edges as strands, combine many candidates, then filter by path length, membership, and uniqueness constraints.

## 5. What changed downstream

- RSA became foundational to digital signatures, certificates, software distribution, and early secure Internet systems.
- DNA computing opened a field connecting molecular biology and theoretical computation.
- The work made computational hardness and physical representation central engineering choices.

## 6. Attribution, limits, and uncertainty

- Rivest and Shamir are equal RSA creators, while Cocks's secret earlier work complicates chronological priority.
- Textbook RSA is insecure; real systems require randomized padding, side-channel defenses, and adequate keys.
- DNA experiments consume laboratory time and material, suffer errors, and scale input preparation poorly.

## 7. Reconstruction lab

Perform toy RSA with small primes, then demonstrate why deterministic textbook encryption leaks repeated messages. Add randomized padding conceptually, and separately design strand filters for a four-vertex path problem.

## 8. Evidence trail

- [A Method for Obtaining Digital Signatures and Public-Key Cryptosystems](https://doi.org/10.1145/359340.359342) — Communications of the ACM
- [Molecular Computation of Solutions to Combinatorial Problems](https://doi.org/10.1126/science.7973651) — Science

---

*Research checked 2026-08-09. Dates, roles, and claims about living people are historical snapshots. Linked sources remain the authority; this dossier is original instructional synthesis.*