adversarial input

Input chosen deliberately by someone who wants your code to behave badly, often by hitting its worst case.

Any structure whose worst case is slow can be driven there by whoever controls its input.

In more detail

Average-case promises assume inputs are typical, and an attacker is under no obligation to be typical. Crafted colliding keys defeat a predictable hash table, and sorted input turns an unbalanced search tree into a list. Worst-case guarantees, such as those of AVL trees or randomised hashing, are what hold up against it.

Related terms

Taught in

References