"pseudomultiplication" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "pseudo",
        "3": "multiplication"
      },
      "expansion": "pseudo- + multiplication",
      "name": "prefix"
    }
  ],
  "etymology_text": "pseudo- + multiplication",
  "forms": [
    {
      "form": "pseudomultiplications",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "pseudomultiplication (countable and uncountable, plural pseudomultiplications)",
      "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 pseudo-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "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": "quotation"
        }
      ],
      "glosses": [
        "Any of several methods of multiplication that employ addition and shifting of digits"
      ],
      "id": "en-pseudomultiplication-en-noun-A6Nj~W2h",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "multiplication",
          "multiplication"
        ],
        [
          "addition",
          "addition"
        ],
        [
          "shifting",
          "shifting"
        ],
        [
          "digit",
          "digit"
        ]
      ],
      "raw_glosses": [
        "(mathematics) Any of several methods of multiplication that employ addition and shifting of digits"
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "pseudomultiplication"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "pseudo",
        "3": "multiplication"
      },
      "expansion": "pseudo- + multiplication",
      "name": "prefix"
    }
  ],
  "etymology_text": "pseudo- + multiplication",
  "forms": [
    {
      "form": "pseudomultiplications",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "pseudomultiplication (countable and uncountable, plural pseudomultiplications)",
      "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 pseudo-",
        "English terms with quotations",
        "English uncountable nouns",
        "en:Mathematics"
      ],
      "examples": [
        {
          "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": "quotation"
        }
      ],
      "glosses": [
        "Any of several methods of multiplication that employ addition and shifting of digits"
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "multiplication",
          "multiplication"
        ],
        [
          "addition",
          "addition"
        ],
        [
          "shifting",
          "shifting"
        ],
        [
          "digit",
          "digit"
        ]
      ],
      "raw_glosses": [
        "(mathematics) Any of several methods of multiplication that employ addition and shifting of digits"
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "pseudomultiplication"
}