Jump to content

Brute-force attack

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 217.168.172.202 (talk) at 01:47, 29 August 2002. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A brute force attack against a cipher refers to breaking a cipher by trying all possible keys. Statistically, if the keys were originally chosen randomly, the plaintext will become available after about 1/2 of the possible keys are tried. The underlying assumption is, of course, that the cypher is known. Since A Kerckoffs first published it, a fundamental maxim of cryptography has been that security must reside ONLY in the key. As Claude E. Shannon said a few decades later, 'the enemy knows the system'. In practice, it has been excellent advice.

As of the year 2002, ciphers with 64 or fewer keys are vulnerable to brute force attacks.

see also Unicity distance