matslina personal blog
Algorithmic complexity attacks and libc qsort()
An algorithmic complexity attack is a denial of service attack that triggers worst case behaviour in code that is otherwise expected to perform well. The canonical example would be the widely published attacks against hash table implementations , where carefully crafted inputs made snappy \(O(1)\) operations…
- Points
- 149
- HN comments
- 52
- Submissions
- 1
- Cited by
- 0 commenters
Systems & PerformanceSecurity & Privacy2014
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Jun 11, 2014 | Algorithmic complexity attacks and libc qsort() by matslina | 149 | 52 |
