Bruteforce (Web)

controlla tutte le possibili e phrase finché non viene trovata quella corretta.

In cryptography, a brute-force attack consists of an attacker submitting many s or phrases with the hope of eventually guessing a combination correctly. The attacker systematically checks all possible s and phrases until the correct one is found. Alternatively, the attacker can attempt to guess the key which is typically created from the using a key derivation function. This is known as an exhaustive key search.

In cryptanalysis and computer security, a dictionary attack is a form of brute force attack technique for defeating a cipher or authentication mechanism by trying to determine its decryption key or phrase by trying thousands or millions of likely possibilities, such as words in a dictionary or previously used s, often from lists obtained from past security breaches