Skip to content

Adi Shamir

  • by

Adi Shamir: Co-Inventor of RSA and Cryptography Pioneer

Adi Shamir stands as one of the most influential cryptographers in history—an Israeli mathematician whose work on the RSA algorithm, alongside Ron Rivest and Leonard Adleman, provided the practical foundation for public-key cryptography that enables Bitcoin and modern secure communications. Known for elegant mathematical solutions to complex problems, Shamir has made numerous contributions to cryptography including secret sharing, identity-based cryptography, and differential cryptanalysis. His work established the paradigm of asymmetric cryptography that underpins all modern digital security, including Bitcoin’s ownership model.

“The ability to prove ownership through digital signatures, to verify transactions without revealing private keys, and to create tamper-evident records—all trace their intellectual lineage through Shamir’s work.”

A Brief History

Adi Shamir was born in 1952 in Tel Aviv, Israel. After serving in the Israel Defense Forces, he earned his bachelor’s degree in mathematics from Tel Aviv University in 1973. He then pursued graduate studies at the Weizmann Institute, receiving his master’s in 1975 and Ph.D. in computer science in 1977. His doctoral work was supervised by Zohar Manna, but his most consequential collaboration would come during a postdoctoral fellowship at MIT.

At MIT’s Computer Science department in 1977, Shamir joined Ron Rivest and Leonard Adleman in developing practical implementations of public-key cryptography. While Rivest provided the mathematical breakthrough for RSA, Shamir contributed crucial refinements and applications. The “S” in RSA represents his essential role in creating the algorithm that would secure internet commerce and make modern cryptography practical.

The Breakthrough

Shamir’s contributions to cryptography extend far beyond RSA. Throughout his career, he has developed foundational concepts that continue to influence modern cryptographic systems, including Bitcoin.

RSA and Public-Key Cryptography

The RSA algorithm provided the first practical implementation of public-key cryptography. Its security relies on the mathematical difficulty of factoring large numbers—a problem that has resisted efficient solution despite centuries of mathematical attention. This computational hardness creates the asymmetry that makes public-key cryptography possible: easy to encrypt, computationally infeasible to decrypt without the private key.

Secret Sharing (1979)

In 1979, Shamir developed secret sharing schemes—methods for distributing a secret among multiple parties such that only certain combinations can reconstruct it. This concept has direct applications in Bitcoin custody solutions, where funds can be secured requiring multiple signatures or keys to spend. His paper “How to Share a Secret” provides the mathematical foundation for distributing Bitcoin custody across multiple parties or locations.

Identity-Based Cryptography (1984)

In 1984, Shamir invented identity-based cryptography, a form of public-key encryption where the public key can be an arbitrary string (such as an email address) rather than a mathematically generated value. While not directly used in Bitcoin, this work expanded the conceptual possibilities of public-key systems and demonstrated the versatility of asymmetric cryptography.

Early Career

Tel Aviv University (1973)
• Bachelor’s degree in Mathematics
• Foundation in mathematical theory

Weizmann Institute (1975–1977)
• Master’s degree (1975)
• Ph.D. in Computer Science (1977)
• Doctoral work supervised by Zohar Manna

MIT (1977)
• Postdoctoral fellowship
• Collaboration with Rivest and Adleman on RSA
• Development of practical public-key cryptography

Weizmann Institute Faculty (1980s–present)
• Built premier cryptography research group
• Supervised dozens of Ph.D. students
• Influenced generations of cryptographers
• Continues active research

Additional Contributions
• Differential cryptanalysis (with Eli Biham)
• Various attacks on cryptographic systems
• Visual cryptography
• Numerous other advances in computer security

Recognition
• ACM Turing Award (2002, with Rivest and Adleman)
• Israel Prize
• Erdős Prize
• IEEE Koji Kobayashi Computers and Communications Award
• Numerous other honors

Significance To Bitcoin

Adi Shamir’s contributions to Bitcoin are foundational—the cryptographic paradigm he helped establish makes Bitcoin possible:

1. Asymmetric Cryptography Foundation

The RSA concept that Shamir helped develop—using mathematical relationships between public and private keys—directly influenced Bitcoin’s use of elliptic curve cryptography. While Bitcoin uses ECDSA (and now Schnorr signatures) rather than RSA for its digital signatures, the underlying principle of asymmetric cryptography traces to the RSA breakthrough.

2. Secret Sharing and Multi-Sig

Shamir’s work on secret sharing has direct applications in Bitcoin multi-signature schemes and threshold signature implementations. His 1979 paper “How to Share a Secret” provides the mathematical foundation for distributing Bitcoin custody across multiple parties or locations, enhancing security for institutional and high-net-worth holders.

3. Computational Hardness

The concept of computational hardness—using problems that are easy to verify but difficult to solve—underpins both RSA and Bitcoin’s security model. Bitcoin’s use of elliptic curve discrete logarithm problems follows the same paradigm that Shamir helped establish with RSA’s factoring-based security.

4. Cryptographic Mindset

When Satoshi Nakamoto designed Bitcoin’s cryptographic framework, they were working within a paradigm established by Shamir and his colleagues. The ability to prove ownership through digital signatures, to verify transactions without revealing private keys, and to create tamper-evident records—all of these capabilities trace their intellectual lineage through Shamir’s work.

Legacy and Impact

Throughout the 1980s and 1990s, Shamir taught and researched at the Weizmann Institute, building one of the world’s premier cryptography research groups. His elegant proof techniques and creative problem-solving approaches have become legendary in the field. He has supervised dozens of Ph.D. students and influenced generations of cryptographers.

For Bitcoiners, Adi Shamir represents the mathematical foundation of digital ownership. His work on public-key cryptography, secret sharing, and cryptographic security established the concepts that make Bitcoin possible. Every Bitcoin transaction that uses digital signatures, every multi-sig wallet that distributes custody, every threshold signature scheme—all build upon foundations that Shamir helped establish.

Shamir continues his research at the Weizmann Institute, remaining active in cryptography and computer security. His ongoing contributions demonstrate that the field he helped create continues to evolve, finding new applications in technologies like Bitcoin that he could not have anticipated when he developed RSA in 1977.

Timeline

• 1952 — Born in Tel Aviv, Israel
• 1973 — Bachelor’s degree in Mathematics, Tel Aviv University
• 1975 — Master’s degree, Weizmann Institute
• 1977 — Ph.D. in Computer Science, Weizmann Institute
• 1977 — Postdoctoral fellowship at MIT
• 1977 — Collaboration with Rivest and Adleman on RSA
• 1979 — Develops secret sharing schemes
• 1984 — Invents identity-based cryptography
• 1980s–1990s — Faculty at Weizmann Institute, builds cryptography research group
• 1990 — Differential cryptanalysis (with Eli Biham)
• 2002 — ACM Turing Award (with Rivest and Adleman)
• 2008 — Bitcoin whitepaper published, building on cryptographic foundations Shamir helped establish
• Ongoing — Continues research at Weizmann Institute

References and Further Reading

• Rivest, R.L., Shamir, A., and Adleman, L. (1978). “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.” Communications of the ACM, 21(2), 120-126. https://people.csail.mit.edu/rivest/Rsapaper.pdf
• Shamir, A. (1979). “How to Share a Secret.” Communications of the ACM, 22(11), 612-613.
• Shamir, A. (1984). “Identity-Based Cryptosystems and Signature Schemes.” Advances in Cryptology — CRYPTO ’84.
• Biham, E. and Shamir, A. (1991). “Differential Cryptanalysis of DES-like Cryptosystems.” CRYPTO ’90.
• Nakamoto, S. (2008). “Bitcoin: A Peer-to-Peer Electronic Cash System.” (Builds on cryptographic foundations established by Shamir)
• ACM Turing Award Lecture: https://amturing.acm.org/award_winners/shamir_2325426.cfm
• Levy, S. (2001). “Crypto: How the Code Rebels Beat the Government—Saving Privacy in the Digital Age.” Penguin Books. (Chapter on RSA development)

If you found this article helpful, please consider zapping some sats or sharing it on social media. You can also help this project grow by doing any of the following.