Misplaced Pages

Algorithmic complexity attack

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

An algorithmic complexity attack (ACA) is a form of attack in which an attacker sends a pattern of requests to a computer system that triggers the worst-case performance of the algorithms it uses. In turn, this may exhaust the resources the system uses. Examples of such attacks include ReDOS, zip bombs and exponential entity expansion attacks.

References

  1. Crosby, Scott A.; Wallach, Dan S. (2003). "Denial of Service via Algorithmic Complexity Attacks". Proceedings of the 12th USENIX Security Symposium.
  2. "Regular expression Denial of Service - ReDoS | OWASP Foundation". owasp.org. Retrieved 2023-10-17.

Related works


Stub icon

This computer security article is a stub. You can help Misplaced Pages by expanding it.

Categories: