https://en.formulasearchengine.com/w/api.php?action=feedcontributions&feedformat=atom&user=62.25.109.198 2026-08-01T16:27:24Z User contributions MediaWiki 1.47.0-wmf.7 https://en.formulasearchengine.com/w/index.php?title=Robert_McNeill_Alexander&diff=25721 2014-01-07T16:57:39Z

<p>62.25.109.198: </p> <hr /> <div>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 attack|denial-of-service]].<br /> <br /> ==See also==<br /> * [[Adversarial input]]<br /> * [[Quicksort]] - popular and fast in-place sorting algorithm, running &lt;math&gt;O(n \log n)&lt;/math&gt; on average, but having &lt;math&gt;O(n^2)&lt;/math&gt; behaviour if implemented naïvely.<br /> <br /> ==Further reading==<br /> *{{Cite web|url=http://www.cs.dartmouth.edu/~doug/mdmspe.pdf|title=A Killer Adversary for Quicksort|author=M. D. McIlroy|authorlink=Douglas McIlroy|year=1999|accessdate=2010-06-16|archiveurl=http://www.webcitation.org/5qXIzWWHB|archivedate=2010-06-16}}<br /> *{{Cite web|url=http://www.cs.rice.edu/~scrosby/hash/CrosbyWallach_UsenixSec2003/index.html|title=Denial of Service via Algorithmic Complexity Attacks|author=Scott A Crosby|coauthors=Dan S Wallach|year=2003|accessdate=2010-06-16|archiveurl=http://web.archive.org/web/20070202204633/www.cs.rice.edu/~scrosby/hash/CrosbyWallach_UsenixSec2003/index.html|archivedate=2008-02-23}}<br /> <br /> {{DEFAULTSORT:Algorithmic Complexity Attack}}<br /> [[Category:Hacking (computer security)]]</div>

62.25.109.198