- An algorithmic complexity attack that produces a denial of service by providing a regular expression or an input that takes a long time to evaluate. The attack exploits the fact that many regular expression implementations have super-linear worst-case complexity; on certain regex–input pairs, the time taken can grow polynomially or exponentially in relation to the input size. ← Wikipedia
This term is sponsored by: your name/company?
- Previous term: Regular expression
- Next term: Regular Language Description for XML
- Random term: Tooling (webglossary.info/random 🎲)