brute-force

listen to the pronunciation of brute-force
Английский Язык - Турецкий язык
kaba kuvvet
(Konuşma Dili) bilek gücü

Связанные Термины

resort to brute force
kaba kuvvete başvurmak
brute force
kaba kuvvet
by brute force
zorla
brute force
acı kuvvet
Английский Язык - Английский Язык
Alternative spelling of brute force
A method of computation wherein all permutations of a problem are tried manually until one is found that provides a solution, in contrast to the implementation of a more intelligent algorithm

E.g. to find the set of all positive integers that are multiples of seven, a brute force algorithm would search through all positive integers, checking each one to see if it is a multiple of seven, whereas a more intelligent algorithm might simply multiply the set of all positive integers by seven.

A method of accomplishing something primarily by means of strength, without the use of mechanical aids or, in combat, without strategic planning or tactics
A hacking method used to find passwords or encryption keys by trying every possible combination of characters until the code is broken
Four special cases, three counting arguments, two long inductions, "and a partridge in a pair tree "
An attack on encrypted data that attempts to guess every possible key Can be stopped by using very long keys Example, using a key or password of only three letters means there are only 26*26*26 = 17,576 possible values Even a slow computer can test all combinations in a few seconds
The process of trying every possible combination of passwords or keys to find the password or key that was was used to encrypt a file This type of attack against an encrypted file can be devastating if computers are used in the brute force method
A method of searching that every piece of data must be blindly processed or tested until the solution is found RC5-64 is an example of this; they must test every block in their search for the key block- all blocks have an equal chance of being the solution, and any user could, at any time, find the key block See also: RC5-64
Taking copies of the plaintext and ciphertext and trying every possible combination of keys to find the solution
Refers to a programming style that does not include any shortcuts to improve performance, but instead relies on sheer computing power to try all possibilities until the solution to a problem is found A classic example is the traveling salesman problem (TSP) Suppose a salesman needs to visit 10 cities across the country How does one determine the order in which cities should be visited such that the total distance traveled is minimized? The brute force solution is simply to calculate the total distance for every possible route and then select the shortest one This is not particularly efficient because it is possible to eliminate many possible routes through clever algorithms Although brute force programming is not particularly elegant, it does have a legitimate place in software engineering Since brute force methods always return the correct result -- albeit slowly -- they are useful for testing the accuracy of faster algorithms In addition, sometimes a particular problem can be