CVE-2025-1234-RSA-Key-Validation-Bypass

CVE-2025-1234-RSA-Key-Validation-Bypass A flaw in a popular RSA implementation allows attackers to bypass key validation by supplying a modulus that appears valid but is actually factorable — if you can factor it quickly. CVE‑2025‑1234 — RSA Key Validation Bypass Exploit Proof‑of‑concept exploit...

Natural Barriers to Quantum Extraction: On the Post-Quantum (In)Security of (O)EKE and Masny-Rindal OT

Encrypted key exchange EKE, introduced by Bellovin and Merritt IEEE S&P 1992, and Masny-Rindal OT, introduced by Masny and Rindal ACM CCS 2019, are highly-efficient methods for compiling essentially any KEM into advanced cryptographic protocols, namely password-authenticated key exchange PAKE and...

CVE-2024-58382

league/commonmark versions before 2.6.0 contain polynomial time complexity vulnerabilities in Markdown parsing that allow attackers to cause denial of service. Attackers can submit carefully crafted Markdown inputs designed to trigger worst-case performance, and sending multiple requests in...

CVE-2024-58382: Inefficient Algorithmic Complexity

league/commonmark versions before 2.6.0 contain polynomial time complexity vulnerabilities in Markdown parsing that allow attackers to cause denial of service. Attackers can submit carefully crafted Markdown inputs designed to trigger worst-case performance, and sending multiple requests in...

GHSA-2WM5-Q62R-HMRV Colord: Slow rejection of oversized malformed color strings

Impact colord's CSS color string matchers described a number as +-?\d.?\d+. In that form \d and \d+ can match the same digits, so a run of n digits can be divided between them in On² ways, and rejecting an input retries every division. Parsing is synchronous and uninterruptible, so a long...

Statistically Secure Uncloneable Encryption of Arbitrary Messages

Unconditional uncloneable encryption of a single bit with efficient encryption and decryption is now possible. However, whether the extension to messages of arbitrary length achieves statistical security remains to be known. Using the fact that the encoding bases for the single-bit scheme known t...

Statistically Undetectable Backdoors in Deep Neural Networks

We show how an adversarial model trainer can plant backdoors in a large class of deep, feedforward neural networks. These backdoors are statistically undetectable in the white-box setting, meaning that the backdoored and honestly trained models are close in total variation distance, even given th...

Unity Linux 20.1050e / 20.1060e / 20.1070e Security Update: nodejs-hosted-git-info (UTSA-2026-016626)

The Unity Linux 20 host has a package installed that is affected by a vulnerability as referenced in the UTSA-2026-016626 advisory. The package hosted-git-info before 3.0.8 are vulnerable to Regular Expression Denial of Service ReDoS via regular expression shortcutMatch in the fromUrl function in...

Quantum Ramp Secret Sharing from Haar Scrambling

Quantum information scrambling has emerged as a powerful tool for studying the dynamics of chaotic quantum many-body systems, assessing benchmarking protocols, and even investigating exotic black hole models. During quantum information scrambling, localized quantum information disperses across th...

EUVD-2021-0928

Malware in sbrugna...

EUVD-2021-1748

Malware in sbrugna...

EUVD-2023-28818

Malicious code in bioql PyPI...

EUVD-2023-30291

Malicious code in bioql PyPI...

EUVD-2023-26630

Malicious code in bioql PyPI...

CVE-2024-8763

A Regular Expression Denial of Service ReDoS vulnerability exists in the lunary-ai/lunary repository, specifically in the compileTextTemplate function. The affected version is git be54057. An attacker can exploit this vulnerability by manipulating the regular expression /.?/g, causing the server ...

CVE-2024-12388: Inefficient Regular Expression Complexity

A vulnerability in binary-husky/gptacademic version 310122f allows for a Regular Expression Denial of Service ReDoS attack. The application uses a regular expression to parse user input, which can take polynomial time to match certain crafted inputs. This allows an attacker to send a small...

Denial Of Service (DoS)

libcmark-gfm.so is vulnerable to Denial Of Service DoS. The vulnerability exists due to polynomial time complexity when creating tables or footnotes, which allows an attacker to cause unbounded resource exhaustion...

Denial of Service (DoS)

Overview Affected versions of this package are vulnerable to Denial of Service DoS. Three polynomial time complexity issues in cmark-gfm may lead to unbounded resource exhaustion. PoC python3 -c 'n = 10000; print"|" + "x|" n + "\n|" + "-|" n' | cmark-gfm -e table python3 -c 'n = 10000; print"|" +...

CVE-2023-37463

cmark-gfm is an extended version of the C reference implementation of CommonMark, a rationalized version of Markdown syntax with a spec. Three polynomial time complexity issues in cmark-gfm may lead to unbounded resource exhaustion and subsequent denial of service. These vulnerabilities have been...

CVE-2023-37463: Uncontrolled Resource Consumption

cmark-gfm is an extended version of the C reference implementation of CommonMark, a rationalized version of Markdown syntax with a spec. Three polynomial time complexity issues in cmark-gfm may lead to unbounded resource exhaustion and subsequent denial of service. These vulnerabilities have been...