Algorithmic complexity attack
An algorithmic complexity attack is a form of computer attack that exploits known cases in which an algorithm used in a piece of software will exhibit worst case behavior. This type of attack can be used to achieve a denial-of-service.
Examples
gollark: USB 2, even.
gollark: I don't know how frequent those are on average, but my server has never actually undergone any hardware failures in 3 years.
gollark: Not really? You probably want to clean out the dust in the fans and stuff occasionally, and sometimes you might have a hardware failure.
gollark: If you don't need an actual live *video* and can deal with a frame every second or something, it could work.
gollark: Obviously you can reencode in software when watching it actively, but that's very very intensive.
See also
- Adversarial input
- Quicksort - popular and fast in-place sorting algorithm, running on average, but having behaviour if implemented naïvely.
Further reading
- M. D. McIlroy (1999). "A Killer Adversary for Quicksort" (PDF). Archived (PDF) from the original on 2010-06-16. Retrieved 2010-06-16.
- Scott A Crosby; Dan S Wallach (2003). "Denial of Service via Algorithmic Complexity Attacks". Archived from the original on 2007-02-02. Retrieved 2010-06-16.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.