Algorithmic complexity attack

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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[edit]

See also[edit]

  • Adversarial input
  • Quicksort - popular and fast in-place sorting algorithm, running on average, but having behaviour if implemented naïvely.

Further reading[edit]

  • 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.