Brute force attack: Difference between revisions

Browse history interactively ← Previous edit Next edit →Content deleted Content addedVisual WikitextInline

Revision as of 16:00, 17 September 2004 editCompulsion (talk \| contribs)57 editsNo edit summary← Previous edit		Revision as of 16:25, 17 September 2004 edit undoKbh3rd (talk \| contribs)Extended confirmed users31,490 editsm some rewordingNext edit →
Line 1:		Line 1:
	'''~~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 ].		In the field information system security a '''brute-force attack''' is a method to determine 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.		The implementation of such an attack involves the generation of a series of ] 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. Cracking a message with a relatively miniscule 6-digit ] key has <math>62^6</math> possible solutions, each of which must be run through a verfication process.		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 miniscule 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, eventually, the correct key will be produced.		The benefit of a Brute-Force attack is that, eventually, the correct key will be produced.

Revision as of 16:25, 17 September 2004

In the field information system security a brute-force attack is a method to determine 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.

The implementation of such an attack involves the generation of a series of keys either algorithmically or from a predetermined list. The latter is also known as a dictionary attack. The generated keys and the chosen cipher are applied to the message to produce a plain text. Each passage of plain text must be verified 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 miniscule 6-digit alphanumeric key has $62^{6}$ possible solutions, each of which must be run through the 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.