Jump to content

Algorithmic complexity attack

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by C. A. Russell (talk | contribs) at 20:16, 16 June 2010 (←Created page with '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 [[w...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.

Notes

  • M. D. McIlroy (1999). "A Killer Adversary for Quicksort". Archived from the original (PDF) on 2010 June 16. Retrieved 2010 June 16. {{cite web}}: Check date values in: |accessdate= and |archivedate= (help)
  • Scott A Crosby (2003). "Denial of Service via Algorithmic Complexity Attacks". Archived from the original on 2008 February 23. Retrieved 2010 June 16. {{cite web}}: Check date values in: |accessdate= and |archivedate= (help); Unknown parameter |coauthors= ignored (|author= suggested) (help)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Algorithmic_complexity_attack&oldid=368455308"