alaniz-cipher

The Alaniz Cipher v3 Sheaf-Based Post-Quantum Encryption via Vector-Valued Finite Field Permutations A cryptographic primitive based on the Nonlinear Sheaf Morphism Inversion Problem NL-SMIP: a polynomial system with secret coefficients coupled by sheaf cohomology over graphs. Paper v3 : L. Alani...

HQC

Hamming Quasi-Cyclic HQC HQC is a code-based Key Encapsulation Mechanism KEM selected by NIST during the NIST's Post-Quantum Cryptography Standardization Project. This repository contains the implementation provided by the HQC team. Structure The project is organized into modular components,...

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...

SUSE CVE-2026-118779

Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode, lib/pem.js, missing END line to process the relevant input or security decision. node-forge used polynomial-time regular expressions in...

Linux Distros Unpatched Vulnerability : CVE-2026-118779

The Linux/Unix host has one or more packages installed that are impacted by a vulnerability without a vendor supplied patch available. - Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode,...

EUVD-2026-113337

Forge: Regular expression denial of service in PEM decoding pem.decode...

CVE-2026-118779

Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode, lib/pem.js, missing END line to process the relevant input or security decision. node-forge used polynomial-time regular expressions in...

UBUNTU-CVE-2026-118779

Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode, lib/pem.js, missing END line to process the relevant input or security decision. node-forge used polynomial-time regular expressions in...

AZL-112469 CVE-2026-118779 affecting package python-tensorboard 2.16.2-6

Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode, lib/pem.js, missing END line to process the relevant input or security decision. node-forge used polynomial-time regular expressions in...

CVE-2026-118779

Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode, lib/pem.js, missing END line to process the relevant input or security decision. node-forge used polynomial-time regular expressions in...

CVE-2026-118779 Forge: Regular expression denial of service in PEM decoding (pem.decode)

Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode, lib/pem.js, missing END line to process the relevant input or security decision. node-forge used polynomial-time regular expressions in...

CVE-2026-118779

Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode, lib/pem.js, missing END line to process the relevant input or security decision. node-forge used polynomial-time regular expressions in...

CVE-2026-118779 Forge: Regular expression denial of service in PEM decoding (pem.decode)

Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode, lib/pem.js, missing END line to process the relevant input or security decision. node-forge used polynomial-time regular expressions in...

CVE-2026-118779 Forge: Regular expression denial of service in PEM decoding (pem.decode)

Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode, lib/pem.js, missing END line to process the relevant input or security decision. node-forge used polynomial-time regular expressions in...

CVE-2026-118779

The Forge (also known as node-forge ) JavaScript library, a native implementation of Transport Layer Security, is vulnerable to a Regular Expression Denial of Service (ReDoS) in versions prior to 1.4.1 . The root cause is the use of polynomial-time regular expressions within the pem.decode() func...

DigitalBazaar Forge resource management error vulnerability

Versions of DigitalBazaar Forge prior to 1.4.1 contain a resource management error vulnerability. This vulnerability arises because pem.decode uses polynomial-time regular expressions to process PEM input when an END line is missing. Unauthenticated attackers can exploit this by sending long...

CVE-2026-118779: digitalbazaar forge: Forge (also called node-forge) is a native implementation of Transport Layer Security in JavaScript

Forge also called node-forge is a native implementation of Transport Layer Security in JavaScript. Prior to 1.4.1, the affected implementation used pem.decode, lib/pem.js, missing END line to process the relevant input or security decision. node-forge used polynomial-time regular expressions in...

PT-2026-132793

Name of the Vulnerable Software and Affected Versions Forge versions prior to 1.4.1 Description An unauthenticated attacker can cause a denial of service by supplying a long malformed PEM message to any high-level parser. This occurs because the pem.decode function in lib/pem.js uses...

Astra Linux – Vulnerability in imagemagick

ImageMagick is free and open-source software used for editing and manipulating digital images. Prior to versions 6.9.13-47 and 7.1.2-22, when performing a polynomial distortion, an excessive read of 24 bytes could occur when specifying certain arguments. This issue has been fixed in versions...

Cryptanalysis of a Class of Ideal Secret Sharing Schemes Based on the CRT for Polynomial Rings

Based on the CRT for polynomial rings, Yang, Zhu, Fu and Xia ISIT 2026 proposed a compartmented secret sharing scheme for the compartmented access structure with lower bounds, claiming it can be ideal. We exhibit three families of unauthorized subsets that reconstruct the secret. The scheme is...