Regexes with large repetitions on empty sub-expressions take a very long time to parse
该报告还没有中文解读。
原文摘录
摘自原文(1003 字符中的一小部分)
Rust's regex crate guarantees a linear time complexity with regex length for compilation of untrusted regexes. However, existing mitigations for known malicious regexes are based on memory usage and, as such, do not mitigate repetitions of empty sub-expressions. For example, the following payload …
原文中的代码
(?:){4294967295}默认不展示报告全文。以上为简短摘录,完整复现过程请阅读原文。版权归研究员与 Internet Bug Bounty 所有。
时间线
- 报告提交
- 公开披露
阅读 HackerOne 原文 ↗作者 @addisoncrump · 版权归作者与 Internet Bug Bounty 所有