{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "rsa-cryptosystem",
    "title": "Rivest, Shamir and Adleman: the RSA cryptosystem",
    "summary": "Constructed paired public and secret operations through exponentiation modulo a composite integer, providing methods for public-key encryption and digital signatures.",
    "boundary": "The work dates to 1978; the inspected copy is a 1983 reprint. Raw RSA arithmetic is not a modern secure protocol or padding scheme, and the paper does not prove full equivalence between security and integer factorization.",
    "area": "Cryptography",
    "topic": "Computing & AI",
    "year": 1978,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "rsa-cryptosystem",
    "target": {
      "record_id": "urn:uuid:9ef30cdb-d075-4c76-a801-d037ed3d2b15",
      "version": 2,
      "content_hash": "sha256:c72ba0186c8a2a7d1fcb58552440d0d3b5f0c66c7824e0ad516dfa887bb3ae11"
    },
    "humans": [
      "Ronald L. Rivest",
      "Adi Shamir",
      "Leonard M. Adleman"
    ],
    "human_identities": [
      {
        "author_position": 1,
        "source_name": "Adi Shamir",
        "person_id": "wrs-person-ecfa6e629a5a7484d7bf1e8c",
        "display_name": "Adi Shamir",
        "status": "SOURCE_LINKED_IDENTITY",
        "sources": [
          {
            "title": "Attribution source",
            "url": "https://wis-wander.weizmann.ac.il/math-computer-science/rsa-algorithm-secured-transations"
          },
          {
            "title": "Attribution source",
            "url": "https://weizmann.esploro.exlibrisgroup.com/esploro/outputs/journalArticle/IP--PSPACE/993265992703596"
          }
        ]
      }
    ],
    "authors_complete": true,
    "human_role_note": "Listed source contributors; individual labor shares are not measured",
    "agents": [],
    "related": [
      "diffie-hellman-key-exchange",
      "shor-algorithm"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "rsa-1978",
        "title": "Rivest, Shamir and Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978), author-hosted 1983 reprint",
        "url": "https://people.csail.mit.edu/rivest/pubs/RSA83a.pdf"
      }
    ],
    "geography": {
      "country_codes": [
        "US"
      ],
      "location_basis": "Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.",
      "source_url": "https://cir.nii.ac.jp/crid/1362544421237353472",
      "target": {
        "record_id": "urn:uuid:9ef30cdb-d075-4c76-a801-d037ed3d2b15",
        "version": 2,
        "content_hash": "sha256:c72ba0186c8a2a7d1fcb58552440d0d3b5f0c66c7824e0ad516dfa887bb3ae11"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-09-26",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "Attribution source",
          "url": "https://cir.nii.ac.jp/crid/1362544421237353472"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "US": "United States"
      }
    },
    "points": "140000",
    "published_grade": {
      "id": "rsa-cryptosystem",
      "entry_id": "rsa-cryptosystem",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:9ef30cdb-d075-4c76-a801-d037ed3d2b15",
        "version": 2,
        "content_hash": "sha256:c72ba0186c8a2a7d1fcb58552440d0d3b5f0c66c7824e0ad516dfa887bb3ae11"
      },
      "what_changed": "Constructed paired public and secret operations through exponentiation modulo a composite integer, providing methods for public-key encryption and digital signatures.",
      "scope": "Constructed paired public and secret operations through exponentiation modulo a composite integer, providing methods for public-key encryption and digital signatures. Scope limitation: The work dates to 1978; the inspected copy is a 1983 reprint. Raw RSA arithmetic is not a modern secure protocol or padding scheme, and the paper does not prove full equivalence between security and integer factorization.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:9ef30cdb-d075-4c76-a801-d037ed3d2b15",
        "version": 2,
        "content_hash": "sha256:c72ba0186c8a2a7d1fcb58552440d0d3b5f0c66c7824e0ad516dfa887bb3ae11"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": {
      "content_hash": "sha256:989cde0a02c26ae9406af28182a99b8fd823766f0e5bbe7e375a5faceed4e598",
      "record_id": "urn:uuid:9ef30cdb-d075-4c76-a801-d037ed3d2b15",
      "version": 1
    },
    "published_at": "2026-09-12T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Ronald L. Rivest",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Rivest, Shamir and Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978), author-hosted 1983 reprint",
            "url": "https://people.csail.mit.edu/rivest/pubs/RSA83a.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Adi Shamir",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Rivest, Shamir and Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978), author-hosted 1983 reprint",
            "url": "https://people.csail.mit.edu/rivest/pubs/RSA83a.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Leonard M. Adleman",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Rivest, Shamir and Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978), author-hosted 1983 reprint",
            "url": "https://people.csail.mit.edu/rivest/pubs/RSA83a.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Rivest, Shamir and Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978), author-hosted 1983 reprint",
            "url": "https://people.csail.mit.edu/rivest/pubs/RSA83a.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The work dates to 1978; the inspected copy is a 1983 reprint. Raw RSA arithmetic is not a modern secure protocol or padding scheme, and the paper does not prove full equivalence between security and integer factorization.",
        "domain": "密码学"
      },
      "sources": [
        {
          "citation": "Rivest, Shamir and Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978), author-hosted 1983 reprint",
          "url": "https://people.csail.mit.edu/rivest/pubs/RSA83a.pdf"
        }
      ],
      "statement": "# Rivest, Shamir and Adleman: the RSA cryptosystem\n\n## The question\n\nHow can someone publish information that enables a useful cryptographic operation while keeping a related capability private? RSA provides a public-key construction based on modular arithmetic. This changes a basic coordination problem: participants need not begin by sharing the same secret key for every operation. The record covers the named construction and its source, not a blanket security guarantee for every system that uses the letters RSA.\n\n## The idea\n\nThe construction chooses a modulus from primes and uses related exponentiation operations. Information enabling one operation can be public while the information needed for the complementary operation is kept private. Correctness of the arithmetic and resistance to attacks are separate questions. Practical cryptographic systems also require appropriate encodings, parameters and protocols; an old textbook calculation is not a deployment recommendation.\n\n## Why it matters\n\nThe contribution makes a powerful asymmetric cryptographic design concrete. WRS's A grade concerns that construction, with Rivest, Shamir and Adleman's roles retained. Historical importance does not certify a present implementation's security. A later flaw in a protocol using the construction must be examined at its actual layer; it does not automatically refute the modular arithmetic, and the arithmetic alone does not prevent that protocol flaw.\n\n## A teaching example\n\nImagine a demonstration using tiny primes so every calculation fits on a worksheet. That makes the arithmetic visible, but it also makes the factors easy to recover. The demonstration therefore teaches how a construction works while deliberately failing to offer practical secrecy. Write down which operation you checked, the allowed message representation and every parameter. If an input lies outside the stated domain, say so. A test that an output returns to its input proves only the finite case checked, not that an attacker lacks another route.\n\n## Scope and a useful next step\n\nThe linked author-hosted paper identifies the public-key construction and digital-signature discussion. A bounded contribution might reconstruct one educational example, check its algebra and explain why it should never protect real data. Keep correctness, hardness assumptions and safe protocol use in separate paragraphs. For a real security choice, consult current maintained standards and implementations rather than reusing this historical record as operating guidance.\n\n## Scientific scope\n\nThe work dates to 1978; the inspected copy is a 1983 reprint. Raw RSA arithmetic is not a modern secure protocol or padding scheme, and the paper does not prove full equivalence between security and integer factorization.\n\n## Sources for this explanation\n\n- [Rivest, Shamir and Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978), author-hosted 1983 reprint](https://people.csail.mit.edu/rivest/pubs/RSA83a.pdf): Identified original contribution source. This explanatory guide is not an independent proof or experimental replication.\n",
      "summary": "Constructed paired public and secret operations through exponentiation modulo a composite integer, providing methods for public-key encryption and digital signatures.",
      "title": "Rivest, Shamir and Adleman: the RSA cryptosystem"
    },
    "record_id": "urn:uuid:9ef30cdb-d075-4c76-a801-d037ed3d2b15",
    "version": 2,
    "source_ref": {
      "record_id": "urn:uuid:9ef30cdb-d075-4c76-a801-d037ed3d2b15",
      "version": 2,
      "content_hash": "sha256:c72ba0186c8a2a7d1fcb58552440d0d3b5f0c66c7824e0ad516dfa887bb3ae11"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:97d153fb1f8b9a6f5795f3508ae4a9895dca2dfc6bb1f3ce7cdd833f36d668c6"
  },
  "target": {
    "record_id": "urn:uuid:9ef30cdb-d075-4c76-a801-d037ed3d2b15",
    "version": 2,
    "content_hash": "sha256:c72ba0186c8a2a7d1fcb58552440d0d3b5f0c66c7824e0ad516dfa887bb3ae11"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "rsa-cryptosystem",
    "entry_id": "rsa-cryptosystem",
    "revision": 1,
    "title": "Rivest, Shamir and Adleman: the RSA cryptosystem",
    "context": "Cryptography",
    "track": "Scoped scientific or research-capability contribution",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-09-14",
    "evidence_cutoff": "2026-09-14",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Constructed paired public and secret operations through exponentiation modulo a composite integer, providing methods for public-key encryption and digital signatures.",
    "scope": "Constructed paired public and secret operations through exponentiation modulo a composite integer, providing methods for public-key encryption and digital signatures. Scope limitation: The work dates to 1978; the inspected copy is a 1983 reprint. Raw RSA arithmetic is not a modern secure protocol or padding scheme, and the paper does not prove full equivalence between security and integer factorization.",
    "evidence_summary": "Assessment uses the catalogue-linked source evidence for the stated contribution. The work dates to 1978; the inspected copy is a 1983 reprint. Raw RSA arithmetic is not a modern secure protocol or padding scheme, and the paper does not prove full equivalence between security and integer factorization.",
    "references": [
      {
        "title": "Rivest, Shamir and Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978), author-hosted 1983 reprint",
        "url": "https://people.csail.mit.edu/rivest/pubs/RSA83a.pdf",
        "locator": "Retained catalogue source evidence; Visually inspected reprint identification, original abstract and sections I–V, modular exponentiation and n=pq; 1983 reprint is not the discovery date"
      }
    ],
    "roles": [
      {
        "who": "Ronald L. Rivest",
        "credit": "SCIENCE",
        "did": "Named source contributor; exact labor shares are not measured."
      },
      {
        "who": "Adi Shamir",
        "credit": "SCIENCE",
        "did": "Named source contributor; exact labor shares are not measured."
      },
      {
        "who": "Leonard M. Adleman",
        "credit": "SCIENCE",
        "did": "Named source contributor; exact labor shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:9ef30cdb-d075-4c76-a801-d037ed3d2b15",
      "version": 2,
      "content_hash": "sha256:c72ba0186c8a2a7d1fcb58552440d0d3b5f0c66c7824e0ad516dfa887bb3ae11"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "140000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": {
    "id": "rsa-cryptosystem",
    "sections": [
      {
        "title": "The question",
        "text": "How can someone publish information that enables a useful cryptographic operation while keeping a related capability private? RSA provides a public-key construction based on modular arithmetic. This changes a basic coordination problem: participants need not begin by sharing the same secret key for every operation. The record covers the named construction and its source, not a blanket security guarantee for every system that uses the letters RSA."
      },
      {
        "title": "The idea",
        "text": "The construction chooses a modulus from primes and uses related exponentiation operations. Information enabling one operation can be public while the information needed for the complementary operation is kept private. Correctness of the arithmetic and resistance to attacks are separate questions. Practical cryptographic systems also require appropriate encodings, parameters and protocols; an old textbook calculation is not a deployment recommendation."
      },
      {
        "title": "Why it matters",
        "text": "The contribution makes a powerful asymmetric cryptographic design concrete. WRS's A grade concerns that construction, with Rivest, Shamir and Adleman's roles retained. Historical importance does not certify a present implementation's security. A later flaw in a protocol using the construction must be examined at its actual layer; it does not automatically refute the modular arithmetic, and the arithmetic alone does not prevent that protocol flaw."
      },
      {
        "title": "A teaching example",
        "text": "Imagine a demonstration using tiny primes so every calculation fits on a worksheet. That makes the arithmetic visible, but it also makes the factors easy to recover. The demonstration therefore teaches how a construction works while deliberately failing to offer practical secrecy. Write down which operation you checked, the allowed message representation and every parameter. If an input lies outside the stated domain, say so. A test that an output returns to its input proves only the finite case checked, not that an attacker lacks another route."
      },
      {
        "title": "Scope and a useful next step",
        "text": "The linked author-hosted paper identifies the public-key construction and digital-signature discussion. A bounded contribution might reconstruct one educational example, check its algebra and explain why it should never protect real data. Keep correctness, hardness assumptions and safe protocol use in separate paragraphs. For a real security choice, consult current maintained standards and implementations rather than reusing this historical record as operating guidance."
      }
    ],
    "target": {
      "record_id": "urn:uuid:9ef30cdb-d075-4c76-a801-d037ed3d2b15",
      "version": 2,
      "content_hash": "sha256:c72ba0186c8a2a7d1fcb58552440d0d3b5f0c66c7824e0ad516dfa887bb3ae11"
    },
    "references": [
      {
        "title": "Rivest, Shamir and Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978), author-hosted 1983 reprint",
        "url": "https://people.csail.mit.edu/rivest/pubs/RSA83a.pdf",
        "locator": "Identified original contribution source. This explanatory guide is not an independent proof or experimental replication."
      }
    ]
  },
  "reading_status": "EXPLANATORY_GUIDE"
}