The modified function still has high nonlinearity, and as such functions are very rare the process should be much faster than a brute-force search.

And based on its length, how long would it take a brute-force search to find it?

A complete solution was obtained within seven months of brute-force search on two domestic PCs.

Any problem that had to be solved by random, brute-force search, could now have a quadratic speedup.

Indeed, brute-force search can be viewed as the simplest metaheuristic.

In order to apply brute-force search to a specific class of problems, one must implement four procedures, first,next, valid, and output.

This brute-force search is computationally expensive and fast translation functions are now more commonly used.

Still there is no known way to break the full 16 rounds, apart from a brute-force search.

The closest pair of points can be computed in O(n) time by performing a brute-force search.

This forces both the attacker and legitimate users to perform a brute-force search for the salt value.