| Revision as of 17:56, 6 October 2004 editNohat (talk | contribs)Administrators11,044 edits spelling← Previous edit | Revision as of 17:14, 4 November 2004 edit undoMatt Crypto (talk | contribs)23,089 edits #REDIRECT Brute force attackNext edit → | ||
| Line 1: | Line 1: | ||
| ⚫ | #REDIRECT ] | ||
| In the field of information system security a '''brute-force attack''' is a method to determine the ] of an ]. While simple to implement, it is a ] method of attack. A brute-force attack is similar to a ]. | |||
| The implementation of such an attack involves the generation of a series of keys either ]ically or from a predetermined list. The latter is also known as a ]. <!-- IMHO a dictionary attack and a brute-force attack are two separate things. kbh3rd --> The generated keys and the chosen ] are applied to the message to produce a ]. Each passage of ] must be ] to determine if it is a valid and therefore properly decrypted message. | |||
| This is an extremely time-consuming task, the effort for which increases exponentially with the size of the key. Cracking a message with a relatively minuscule 6-digit ] key has <math>62^6</math> possible solutions, each of which must be run through the verfication process. | |||
| The benefit of a brute-force attack is that, given enough time, the correct key is guaranteed to be found. The relative security of a ] system can be measured by the ] time required to find a key by brute force, and the security of an encrypted message may be expressed as the expected number of years required to thus determine its encryption key. This time decreases with increases in the power of computers. The decreasing cost and increasing power of computing resources has caused the ] to propose withdrawing the 56-]-keyed ] as an encryption standard in ]. | |||
| ==See also== | |||
| ⚫ | |||
| ==External links== | |||
| * , a successful brute-force challenge project. | |||
| ] | |||
Revision as of 17:14, 4 November 2004
Redirect to: