1
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…