a brute-forcesearch to break a cipher by trying each possible key
a general term used to describe the process by which a given outcome is achieved through trial and error
a method to crack the passwords of encrypted files
an attack on cipher text where the cryptanalyzer tries all possible keys
an attack which offers a large number of different biometric features to the authentication system, anticipating a coincidence with the stored reference feature
an automated process of trial and error used to guess a person's username, password, credit-card number or cryptographic key
a systematic attempt to find a valid login to the members area by repetitively attempting to enter the LatinBoyz
a type of attack in which every possible key is attempted until the correct key is found
an attack on a cryptography system that attempts to determine the key used for encryption by attempting to decrypt the message using every possible key.
An attack on an encryption algorithm where the encryption key for a ciphertext is determined by trying to decrypt with every key until valid plaintext is obtained.
An attack in which each possible key or password is attempted until the correct one is found. See Also: Attack
An attack in which every possible combination of data is tried until the correct one is found. This is normally used against short items such as passwords, as the difficulty discovering the correct form increases with the length of the data. This illustrates the need for good, complex passwords See also Dictionary attack
A brute force attack does not rely on poor programming code to gain access to a system, but rather repetitively beats on a system through known connection methods. For example, a brute force logon attack will simply continue to try different logon names and passwords until access is granted.
Where an attacker uses a program to automatically try and log in to your system hundreds of times a second using different login details each time. Can be circumvented by preventing more than a certain number of successive attempts from the same IP address, or by introducing a short delay between the login details being entered and the application responding.
Attack on a cryptographic system through computing all possible values of a key.
This attack requires trying all (or a large fraction of all) possible values till the right value is found; also called an exhaustive search.
An attempt to illicitly recover a cryptographic key by trying all reasonable possibilities.
In cryptanalysis, a brute force attack is a method of defeating a cryptographic scheme by trying a large number of possibilities; for example, exhaustively working through all possible keys in order to decrypt a message. In most schemes, the theoretical possibility of a brute force attack is recognized, but it is set up in such a way that it would be computationally infeasible to carry out. Accordingly, one definition of "breaking" a cryptographic scheme is to find a method faster than a brute force attack.