COMMON ATTACK PATTERN ENUMERATION AND CLASSIFICATIONMITRE canlı kaydı

CAPEC-20

Encryption Brute Forcing

An attacker, armed with the cipher text and the encryption algorithm used, performs an exhaustive (brute force) search on the key space to determine the key that decrypts the cipher text to obtain the plaintext.

Soyutlama

Standard

Tipik ciddiyet

Low

Saldırı ihtimali

Low

Saldırıyı anla

Bu saldırı kalıbı nedir?

An attacker, armed with the cipher text and the encryption algorithm used, performs an exhaustive (brute force) search on the key space to determine the key that decrypts the cipher text to obtain the plaintext.

Uygulama akışı

Saldırı adım adım nasıl ilerler?

1

Explore

Attack step

Determine the ciphertext and the encryption algorithm.
2

Experiment

Attack step

Perform an exhaustive brute force search of the key space, producing candidate plaintexts and observing if they make sense.

Gereksinimler

Saldırının gerçekleşmesi için ne gerekir?

Ön koşullar

  • Ciphertext is known.
  • Encryption algorithm and key size are known.

Gerekli beceri

  • Low: Brute forcing encryption does not require much skill.

Gerekli kaynak

  • A powerful enough computer for the job with sufficient CPU, RAM and HD. Exact requirements will depend on the size of the brute force job and the time requirement for completion. Some brute forcing jobs may require grid or distributed computing (e.g. DES Challenge). On average, for a binary key of size N, 2^(N/2) trials will be needed to find the key that would decrypt the ciphertext to obtain the original plaintext. Obviously as N gets large the brute force approach becomes infeasible.

Tespit

Saldırının göstergeleri nelerdir?

None. This attack happens offline.

Etki

Başarılı saldırı neye yol açar?

Read Data

Etkilenen alanlar: Confidentiality

Savunma

Nasıl önlenir ve etkisi azaltılır?

1
Use commonly accepted algorithms and recommended key sizes. The key size used will depend on how important it is to keep the data confidential and for how long.
2
In theory a brute force attack performing an exhaustive key space search will always succeed, so the goal is to have computational security. Moore's law needs to be taken into account that suggests that computing resources double every eighteen months.

Gerçek dünya

MITRE örnek olayları

Örnek olay 1Detay
In 1997 the original DES challenge used distributed net computing to brute force the encryption key and decrypt the ciphertext to obtain the original plaintext. Each machine was given its own section of the key space to cover. The ciphertext was decrypted in 96 days.
CAPEC-20: Encryption Brute Forcing — DayBreach Saldırı Sözlüğü · DayBreach