|1 via 3 paths|
Find, fix and prevent vulnerabilities in your code.
- Vulnerable module: path-parse
- Introduced through: email@example.com, firstname.lastname@example.org and others
Introduced through: email@example.com › firstname.lastname@example.org › email@example.com › firstname.lastname@example.org › email@example.com
Introduced through: firstname.lastname@example.org › email@example.com › firstname.lastname@example.org › email@example.com › firstname.lastname@example.org
Introduced through: email@example.com › firstname.lastname@example.org › email@example.com › firstname.lastname@example.org › email@example.com › firstname.lastname@example.org
path-parse is a Node.js path.parse() ponyfill
splitPathRe regular expressions. ReDoS exhibits polynomial worst-case time complexity.
Let’s take the following regular expression as an example:
regex = /A(B|C+)+D/
This regular expression accomplishes the following:
AThe string must start with the letter 'A'
(B|C+)+The string must then follow the letter A with either the letter 'B' or some number of occurrences of the letter 'C' (the
+matches one or more times). The
+at the end of this section states that we can look for one or more matches of this section.
DFinally, we ensure this section of the string ends with a 'D'
The expression would match inputs such as
It most cases, it doesn't take very long for a regex engine to find a match:
From there, the number of steps the engine must use to validate a string just continues to grow.
|String||Number of C's||Number of steps|
There is no fixed version for