35 matches found
pyasn1: Quadratic complexity in OBJECT IDENTIFIER and RELATIVE-OID processing allows denial of service
Impact The BER/CER/DER decoders process OBJECT IDENTIFIER and RELATIVE-OID values in quadratic time relative to the number of arcs. A small crafted payload tens of kilobytes containing an OID with many arcs consumes seconds of CPU per decode call, allowing denial of service in any application tha...
CVE-2026-45822
decode-uri-component through 0.4.1 is vulnerable to denial of service. The decode function splits input on '%' producing N tokens and calls decodeComponents, exhibiting super-linear parsing time: 200 '%ab' tokens takes approximately 0.7s, 700 tokens approximately 6s, and 1400 tokens approximately...
crypto/x509: Quadratic complexity when checking name constraints in crypto/x509
A potential denial of service flaw has been discovered in golang's crypto/x509 module. Due to the design of the name constraint checking algorithm, the processing time of some inputs scales non-linearly with respect to the size of the certificate. This affects programs which validate arbitrary...
parse-server has GraphQL complexity validator exponential fragment traversal DoS
Impact The GraphQL query complexity validator can be exploited to cause a denial-of-service by sending a crafted query with binary fan-out fragment spreads. A single unauthenticated request can block the Node.js event loop for seconds, denying service to all concurrent users. This only affects...
GHSA-MFJ6-6P54-M98C parse-server has GraphQL complexity validator exponential fragment traversal DoS
Impact The GraphQL query complexity validator can be exploited to cause a denial-of-service by sending a crafted query with binary fan-out fragment spreads. A single unauthenticated request can block the Node.js event loop for seconds, denying service to all concurrent users. This only affects...
CLEANSTART-2026-NV34418 Due to the design of the name constraint checking algorithm, the processing time of some inputs scale non-linearly with respect to the size of the certificate
Multiple security vulnerabilities affect the argo-cd-fips package. Due to the design of the name constraint checking algorithm, the processing time of some inputs scale non-linearly with respect to the size of the certificate. See references for individual vulnerability details...
Decryption Thorough Polynomial Ambiguity: Noise-Enhanced High-Memory Convolutional Codes for Post-Quantum Cryptography
We present a novel approach to post-quantum cryptography that employs directed-graph decryption of noise-enhanced high-memory convolutional codes. The proposed construction generates random-like generator matrices that effectively conceal algebraic structure and resist known structural attacks...
[SECURITY] Fedora 41 Update: rust-regex-1.12.2-1.fc41
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs...
[SECURITY] Fedora 42 Update: rust-regex-1.12.2-1.fc42
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs...
[SECURITY] Fedora 43 Update: rust-regex-1.12.2-1.fc43
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs...
CVE-2025-58187
Due to the design of the name constraint checking algorithm, the processing time of some inputs scale non-linearly with respect to the size of the certificate. This affects programs which validate arbitrary certificate chains. Mitigation Mitigation for this issue is either not available or the...
AZL-78913 CVE-2025-58187 affecting package golang 1.25.7-1
Due to the design of the name constraint checking algorithm, the processing time of some inputs scale non-linearly with respect to the size of the certificate. This affects programs which validate arbitrary certificate chains...
EUVD-2015-1426
Malware in sbrugna...
An Efficient Construction of Raz's Two-Source Randomness Extractor with Improved Parameters
Randomness extractors are algorithms that distill weak random sources into near-perfect random numbers. Two-source extractors enable this distillation process by combining two independent weak random sources. Raz's extractor STOC '05 was the first to achieve this in a setting where one source has...
Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor
Estimating the density of a distribution from its samples is a fundamental problem in statistics. Hypothesis selection addresses the setting where, in addition to a sample set, we are given $n$ candidate distributions -- referred to as hypotheses -- and the goal is to determine which one best...
Fedora: Security Advisory for treelayout (FEDORA-2024-129d8ca6fc)
The remote host is missing an update for the SPDX-FileCopyrightText: 2024 Greenbone AG Some text descriptions might be excerpted from a referenced sources, and are Copyright C by the respective right holders. SPDX-License-Identifier: GPL-2.0-only ifdescription...
[SECURITY] Fedora 40 Update: treelayout-1.0.3-23.fc40
Efficiently create compact, highly customizable tree layouts. The software builds tree layouts in linear time; i.e., even trees with many nodes are built quickly...
[SECURITY] Fedora 36 Update: rust-regex-1.5.5-1.fc36
Implementation of regular expressions for Rust. This implementation uses fini te automata and guarantees linear time matching on all inputs...