Adi Shamir co-invented RSA with Ronald Rivest and Leonard Adleman in 1977. RSA is a public-key cryptosystem: users can share a public key while keeping its paired private key secret. The invention addressed a core challenge in digital communication—establishing protected communication without first meeting to exchange a secret.
Three researchers developed RSA
The algorithm’s name comes from Rivest, Shamir, and Adleman. In an ACM interview transcript, Adleman recounts the three MIT colleagues’ collaboration and the problem of transmitting private information when correspondents had no shared key. RSA uses mathematical operations on large numbers; factoring the product of two large primes is computationally difficult, which underlies the system’s security.
The three researchers received the 2002 A.M. Turing Award for their work on public-key cryptography. The Institute’s award notice identifies Shamir among the recipients, and its account of his honors situates RSA within his broader career in cryptography.
Why public-key cryptography mattered
Before public-key methods, communicating parties generally needed a shared secret established in advance. RSA showed how public and private keys could support encryption and digital signatures across networks. Modern systems use cryptographic algorithms inside carefully specified protocols; secure use depends on sound implementation, appropriate key sizes, and system design.
RSA is an algorithm, not a complete security standard. Standards and protocols specify how cryptographic methods should be applied. Shamir also worked in cryptanalysis, testing the strength of cryptographic systems, and developed other influential methods, including secret sharing. RSA’s lasting importance lies in helping demonstrate that public-key cryptography could work at practical scale.