A brute force attack consists of trying every possible code, combination, or password until you find the right one.
The difficulty of a brute force attack depends on several factors, such as:
As an example, imagine a system which only allows 4 digit PIN codes. This means that there are a maximum of 10,000 possible PIN combinations.
From the example above, PIN security could be increased by:
A brute force attack will always succeed, eventually. However, brute force attacks against systems with sufficiently long key sizes may require billions of years to complete.
In most cases, a dictionary attack will work more quickly than a brute force attack. A brute force attack is, however, more certain to achieve results eventually than a dictionary attack.
source: topbits.com