"cryptosystem" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "crypto-",
        "3": "system"
      },
      "expansion": "crypto- + system",
      "name": "af"
    }
  ],
  "etymology_text": "From crypto- + system.",
  "forms": [
    {
      "form": "cryptosystems",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "cryptosystem (plural cryptosystems)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with crypto-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1987, Neal Koblitz, A Course in Number Theory and Cryptography, Springer, page 81:",
          "text": "In our example of the affine cryptosystem family, deciphering is also accomplished by an affine map, namely P#92;equiva#123;-1#125;C-a#123;-1#125;b#92;bmodN, and so the deciphering transformation uses the same algorithm as the enciphering transformation, except with a different key, namely, the pair (a#123;-1#125;,-a#123;-1#125;b).",
          "type": "quote"
        },
        {
          "ref": "2015, Ping Ngai Chung, Craig Costello, Benjamin Smith, “Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes”, in arXiv:",
          "text": "Our results show that many existing fast pseudomultiplication implementations (hitherto limited to applications in Diffie--Hellman key exchange) can be wrapped with simple and efficient pre-and post-computations to yield competitive full scalar multiplication algorithms, ready for use in more general discrete logarithm-based cryptosystems, including signature schemes.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A system of cryptography."
      ],
      "id": "en-cryptosystem-en-noun-Z4kV2xTj",
      "links": [
        [
          "system",
          "system"
        ],
        [
          "cryptography",
          "cryptography"
        ]
      ]
    }
  ],
  "word": "cryptosystem"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "crypto-",
        "3": "system"
      },
      "expansion": "crypto- + system",
      "name": "af"
    }
  ],
  "etymology_text": "From crypto- + system.",
  "forms": [
    {
      "form": "cryptosystems",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "cryptosystem (plural cryptosystems)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with crypto-",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries"
      ],
      "examples": [
        {
          "ref": "1987, Neal Koblitz, A Course in Number Theory and Cryptography, Springer, page 81:",
          "text": "In our example of the affine cryptosystem family, deciphering is also accomplished by an affine map, namely P#92;equiva#123;-1#125;C-a#123;-1#125;b#92;bmodN, and so the deciphering transformation uses the same algorithm as the enciphering transformation, except with a different key, namely, the pair (a#123;-1#125;,-a#123;-1#125;b).",
          "type": "quote"
        },
        {
          "ref": "2015, Ping Ngai Chung, Craig Costello, Benjamin Smith, “Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes”, in arXiv:",
          "text": "Our results show that many existing fast pseudomultiplication implementations (hitherto limited to applications in Diffie--Hellman key exchange) can be wrapped with simple and efficient pre-and post-computations to yield competitive full scalar multiplication algorithms, ready for use in more general discrete logarithm-based cryptosystems, including signature schemes.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A system of cryptography."
      ],
      "links": [
        [
          "system",
          "system"
        ],
        [
          "cryptography",
          "cryptography"
        ]
      ]
    }
  ],
  "word": "cryptosystem"
}