Wikinventia — Atlas of discoveries and inventions · Global Age

RSA algorithm — public-key cryptography by factorization — Rivest, Shamir, and Adleman

1977 AD · Transmission: Global
ComputingMethodNorth American

Ron Rivest, Adi Shamir, and Leonard Adleman, MIT mathematicians, publish in August 1977 the RSA algorithm (from their initials) in "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems" (Communications of the ACM). The system uses the multiplication of two large prime numbers as a one-way trapdoor: easy to compute in one direction, computationally infeasible to invert without the private key. RSA becomes the dominant public-key algorithm of the internet era: it underlies TLS/HTTPS, digital signatures, and SSL certificates. Clifford Cocks at GCHQ had developed an equivalent system in 1973, classified and declassified in 1997. Rivest, Shamir, and Adleman received the Turing Award in 2002.

InstitutionMIT — Laboratory for Computer Science, Cambridge MA
Historical regionUnited States (Massachusetts)
Primary sourceRivest, R., Shamir, A. & Adleman, L. — "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems" (Communications of the ACM, 21:2, February 1978, pp. 120–126). DOI: 10.1145/359340.359342
Secondary sourceSingh, S. — The Code Book (Fourth Estate, 1999), ch. 6; Levy, S. — Crypto (Viking, 2001)
Original languageEnglish
View this entry in the interactive atlas → View in graph →