The infinite loop can also be reached when parsing crafted private keys as they can contain explicit elliptic curve parameters. Since certificate parsing happens prior to verification of the certificate signature, any process that parses an externally supplied certificate may thus be subject to a denial of service attack. It is possible to trigger the infinite loop by crafting a certificate that has invalid explicit curve parameters. Internally this function is used when parsing certificates that contain elliptic curve public keys in compressed form or explicit elliptic curve parameters with a base point encoded in compressed form.
The BN_mod_sqrt() function, which computes a modular square root, contains a bug that can cause it to loop forever for non-prime moduli. There are currently no known workarounds. The issue has been addressed in `node-forge` version 1.3.0. This can allow padding bytes to be removed and garbage data added to forge a signature when a low public exponent is being used. Prior to version 1.3.0, RSA PKCS#1 v1.5 signature verification code does not check for tailing garbage bytes after decoding a `DigestInfo` ASN.1 structure. There are currently no known workarounds.įorge (also called `node-forge`) is a native implementation of Transport Layer Security in JavaScript. This can lead to successful verification with signatures that contain invalid structures but a valid digest. Prior to version 1.3.0, RSA PKCS#1 v1.5 signature verification code does not properly check `DigestInfo` for a proper ASN.1 structure. Forge (also called `node-forge`) is a native implementation of Transport Layer Security in JavaScript.
0 kommentar(er)
