This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Crosby S, Wallach D (2003) Denial of Service via algorithmic complexity attacks. Proceedings of the 12th USENIX Security Symposium. Washington, DC
Bloom BH (1970) Space/time trade-offs in hash coding with allowable errors. Commun ACM 13(7):422–426
Smith R, Estan C, Jha S (2006) Backtracking algorithmic complexity attacks against a NIDS. Proceedings of the 22nd Annual Computer Security Applications Conference. Miami, Florida
Probst CW, Gal A, Franz M (2005) Average case vs. worst case: margins of safety in system design. Proceedings of the 2005 Workshop on New Security Paradigms. Lake Arrowhead, California
McIlroy MD (1999) A killer adversary for Quicksort. Software Pract Exp 29(4):341–344
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Crosby, S., Wallach, D. (2011). Algorithmic DoS. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_261
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_261
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering