Metraipolis › archive › dc_4ed18b0bfa95

Brute-force attack — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Brute-force_attack
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-05T23:22:55.644Z
SHA-256 of the archived text
aed8550cb8d2b6fe68d7a36d2370317c32d7c5e54dc6e88872ab5efed4387cad
Stable URL of this page
https://metraipolis.com/documento/dc_4ed18b0bfa95

How to cite

Brute-force attack — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Brute-force_attack (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_4ed18b0bfa95 (Metraipolis archive dc_4ed18b0bfa95, sha256 aed8550cb8d2b6fe68d7a36d2370317c32d7c5e54dc6e88872ab5efed4387cad)
BibTeX
@misc{dc4ed18b0bfa95,
  title = {Brute-force attack — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Brute-force_attack},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_4ed18b0bfa95; sha256 aed8550cb8d2b6fe68d7a36d2370317c32d7c5e54dc6e88872ab5efed4387cad},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Brute-force_attack. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In cryptography, a brute-force attack or exhaustive key search is a cryptanalytic attack that consists of an attacker submitting many possible keys or passwords with the hope of eventually guessing correctly. This strategy can theoretically be used to break any form of encryption that is not information-theoretically secure. However, in a properly designed cryptosystem the chance of successfully guessing the key is negligible. When cracking passwords, this method is very fast when used to check all short passwords, but for longer passwords other methods such as the dictionary attack are used because a brute-force search takes too long. Longer passwords, passphrases and keys have more possible values, making them exponentially more difficult to crack than shorter ones due to the diversity of characters. Brute-force attacks can be made less effective by implementing key stretching techniques making it more difficult for an attacker to recognize when the code has been cracked or by making the attacker do more work to test each guess. One of the measures of the strength of an encryption system is how long it would theoretically take an attacker to mount a successful brute-force attack against it. Brute-force attacks are an application of brute-force search, the general problem-solving technique of enumerating all candidates and checking each one. The word 'hammering' is sometimes used to describe a brute-force attack, with 'anti-hammering' for countermeasures.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «Merkle tree»).
Fonte: Wikipedia in inglese, voce «Brute-force attack» — https://en.wikipedia.org/wiki/Brute-force_attack
Wikidata Q869370 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q869370
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Brute-force_attack?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1364164791, consultata il 2026-10-05T23:06:36.799Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 64f1155ec49639e5d040521977c335895dd74d574e7734366ba25d6ea648ad63