# Public-key cryptography: Science

Source page: https://www.materialinsights.org/technologies/public_key_cryptography/tech-science/

#### Principles

The science it rests on, with why each principle matters to it
 Relies on

- [Number theory and modular arithmetic](https://www.materialinsights.org/science/number_theory/) RSA depends on the great difficulty of factoring the product of two very large prime numbers ^[3].
 Limited by

- [Quantum mechanics](https://www.materialinsights.org/science/quantum_mechanics/) Quantum computers, which work by quantum effects, could break many public-key systems now in use, which is why NIST set new standards ^[9].

as of 2026-11-10

#### Discoveries

The discoveries that made it possible: when, by whom and what was found

| Year | Who | What |
|---|---|---|
| 1973 | James Ellis, Clifford Cocks and Malcolm Williamson, GCHQ | Find, in secret, all the key parts of public-key cryptography ^[7] |
| 1976 | Whitfield Diffie and Martin Hellman, Stanford | Publish New Directions in Cryptography, with public-key exchange of secrets ^[1] |
| 1977 | Ronald Rivest, Adi Shamir and Leonard Adleman, MIT | Devise the RSA system, based on factoring large numbers ^[3]^[4] |

as of 2026-11-10

#### The science explained

The science behind it explained for a curious reader

Picture a padlock that snaps shut without a key. You can hand out open padlocks to anyone. A friend puts a letter in a box, snaps one of your padlocks on it and posts it; only you, with the one key, can open it. Your padlock is the public key, your key the private key. In mathematics the padlock is a calculation that is easy one way and hard the other. RSA uses multiplication: making the product of two huge primes takes a moment, but splitting it back into those primes is thought to take a very long time ^[3]^[4]. Diffie-Hellman uses a related trick so that two people can each mix in a secret number and still end up with the same shared secret, while an eavesdropper sees only the public parts ^[2].

as of 2026-11-10

#### Sources

1. [Cryptography Pioneers Receive ACM A.M. Turing Award](https://www.acm.org/media-center/2016/march/turing-award-2015) Association for Computing Machinery, 2016
2. [Stanford cryptography pioneers Whitfield Diffie and Martin Hellman win ACM 2015 A.M. Turing Award](https://news.stanford.edu/?p=1972) Stanford University, Stanford Report
3. [Ronald L. Rivest](https://www.britannica.com/biography/Ronald-L-Rivest) Encyclopaedia Britannica
4. [Prestigious Award in Computer Science to Weizmann Institute's scientist](https://wis-wander.weizmann.ac.il/node/1272) Weizmann Institute of Science, Weizmann Wonder Wander, 2003
5. [Dr Clifford Cocks CB](https://www.bristol.ac.uk/alumni/our-alumni/honorary-degrees/honorary-graduates/2008/cocks.html) University of Bristol, honorary graduates 2008
6. [NIST Releases Three Post-Quantum Cryptography Standards](https://hklaw.com/en/insights/publications/2024/08/nist-releases-three-post-quantum-cryptography-standards) Holland & Knight, IP/Decode Blog, 2024

## Other sections

- [Summary](https://www.materialinsights.org/technologies/public_key_cryptography/index.md)
- [Overview](https://www.materialinsights.org/technologies/public_key_cryptography/tech-overview/index.md)
- [Evolution](https://www.materialinsights.org/technologies/public_key_cryptography/tech-evolution/index.md)
- [Industries](https://www.materialinsights.org/technologies/public_key_cryptography/tech-industries/index.md)
