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: It has giant text and images for no reason, doesn't do scrolling properly, and conveys basically zero information.
gollark: This is very light on information on what it actually is, and if that site there is an example of it I don't want it.
gollark: I'm always willing to redesign my website for no good reason!
gollark: What is this "fluent design"?
gollark: <@151391317740486657> https://osmarks.tk/points still works the same, tap achievements to dismiss them.
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.