# Adi Shamir > 1952– · Computer Scientist, Co-creator of RSA > > **Recorded contribution:** RSA (the "S"); differential cryptanalysis; visual cryptography ## 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 Adi Shamir is the “S” in RSA, devised with Ron Rivest and Leonard Adleman in 1977, and later contributed differential cryptanalysis, secret sharing, identification schemes, and visual cryptography. His career repeatedly turned intuitive security questions into explicit mathematical attacks or constructions. This work makes a security claim depend on an explicit adversary model, mathematical construction, key or randomness discipline, and a testable notion of success. The chronology is used causally: it connects the inherited constraint to an implementable mechanism and then to later reuse, instead of treating fame, job title, or eventual market success as the explanation. ## 2. The problem inherited Secure communication over an open network appeared to require parties to share a secret key in advance; symmetric ciphers also needed systematic ways to evaluate resistance to structured attacks. Secrecy, integrity, authenticity, privacy, and consensus cannot be delivered by obscurity. The protected asset and attacker capabilities must be stated before an algorithm can be judged. ## 3. The central contribution RSA uses modular exponentiation with related public and private exponents, while its security relies on the practical difficulty of recovering private structure from the public modulus; Shamir’s later cryptanalysis showed how cipher structure leaks under chosen differences. The contribution is best understood as a construction plus its assumptions and proof target, not as a magic shield around data. ## 4. Reconstruct the mechanism 1. Generate a toy modulus from two primes and derive compatible public and private exponents. Define the parties, keys or randomness, messages, and exact security property. 2. Encrypt or verify with the public operation and decrypt or sign with the private operation. Execute setup and the core transform on a toy instance small enough to inspect. 3. Explain correctness through modular arithmetic while keeping correctness distinct from security. Give the receiver or verifier only the information the construction permits and check the intended result. 4. Attack tiny parameters, bad padding, reused secrets, or a structured cipher difference to locate where deployment departs from the proof model. Strengthen the attacker, weaken randomness, reuse state, or change a hardness assumption and identify the resulting break. ## 5. What changed downstream - RSA enabled public-key encryption and signatures at Internet scale; differential cryptanalysis transformed block-cipher evaluation and influenced modern design practice. - The work supplied later protocols with a composable primitive or a sharper way to state what an attacker should be unable to do. - The transferable first-principles lesson is to separate the artifact named in “RSA (the "S"); differential cryptanalysis; visual cryptography” from the mechanism, surrounding institution, and evidence that allowed later systems to depend on it. ## 6. Attribution, limits, and uncertainty - RSA has three named inventors and important classified and public predecessors; production RSA requires secure padding and sufficiently large keys. Shamir’s work spans distinct collaborations that should not be collapsed into a single-inventor story. - Mathematical security does not automatically secure implementations, endpoints, key custody, incentives, or institutions. - The subject is living or the registry has no death year; current titles and institutional affiliations are treated as dated snapshots verified on 2026-08-09, not permanent identity claims. ## 7. Reconstruction lab Perform RSA on very small primes, then factor the modulus to demonstrate why the toy is insecure. Add a simple padding rule and explain why real padding security requires more than the toy. Separate the toy mathematics from production security; finish with an attack caused by violating one stated assumption. ## 8. Evidence trail - [Adi Shamir](https://www.wisdom.weizmann.ac.il/~shamir/) — Weizmann Institute of Science - [Adi Shamir](https://en.wikipedia.org/wiki/Adi_Shamir) — Wikipedia contributors · overview and bibliography - [Adi Shamir structured identity record](https://www.wikidata.org/wiki/Q320624) — Wikidata contributors · CC0 --- *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.*