| Revision as of 15:55, 17 September 2004 editCompulsion (talk | contribs)57 editsNo edit summary | Revision as of 16:00, 17 September 2004 edit undoCompulsion (talk | contribs)57 editsNo edit summaryNext edit → | ||
| Line 1: | Line 1: | ||
| '''Brute-force attack''' is a |
'''Brute-force attack''' is a method of determining the key of an encrypted message. While simple to implement, it is a ] method of attack. A Brute-Force attack is similar to a ]. | ||
| Usually, a series of ] are generated via an ] or from a predetermined list (usually referred to as a ]). Keys are applied to the message to produce ]. Each passage of ] must be ] to determine if it is the desired message. | Usually, a series of ] are generated via an ] or from a predetermined list (usually referred to as a ]). Keys are applied to the message to produce ]. Each passage of ] must be ] to determine if it is the desired message. | ||
Revision as of 16:00, 17 September 2004
Brute-force attack is a method of determining the key of an encrypted message. While simple to implement, it is a computationally expensive method of attack. A Brute-Force attack is similar to a Brute-force search.
Usually, a series of keys are generated via an algorithm or from a predetermined list (usually referred to as a dictionary). Keys are applied to the message to produce plain text. Each passage of plain text must be verified to determine if it is the desired message.
This is an extremely time-consuming task. Cracking a message with a relatively miniscule 6-digit alphanumeric key has possible solutions, each of which must be run through a verfication process.
possible solutions, each of which must be run through a verfication process.
The benefit of a Brute-Force attack is that, eventually, the correct key will be produced.
Specifics of Brute-force methods can be found at Brute-force search.