nerdexam
EC-Council

312-50V10 · Question #754

What is a "Collision attack" in cryptography?

The correct answer is D. Collision attacks try to find two inputs producing the same hash. A collision attack in cryptography is the attempt to find two distinct input values that produce the same hash digest, breaking the collision resistance property of a hash function.

Cryptography

Question

What is a "Collision attack" in cryptography?

Options

  • ACollision attacks try to get the public key
  • BCollision attacks try to break the hash into three parts to get the plaintext value
  • CCollision attacks try to break the hash into two parts, with the same bytes in each part to get the
  • DCollision attacks try to find two inputs producing the same hash

How the community answered

(37 responses)
  • A
    3% (1)
  • C
    3% (1)
  • D
    95% (35)

Why each option

A collision attack in cryptography is the attempt to find two distinct input values that produce the same hash digest, breaking the collision resistance property of a hash function.

ACollision attacks try to get the public key

Collision attacks target the output of hash functions, not public keys; attempting to derive a private key from a public key describes a different class of asymmetric cryptography attack.

BCollision attacks try to break the hash into three parts to get the plaintext value

Hash functions produce a single fixed-length digest and are not broken into three parts; this description does not correspond to any recognized cryptographic attack model.

CCollision attacks try to break the hash into two parts, with the same bytes in each part to get the

This description inaccurately adds a constraint about matching bytes within hash segments; a collision attack only requires two different inputs yielding the same final hash output, with no requirement about the internal structure of the hash.

DCollision attacks try to find two inputs producing the same hashCorrect

A collision attack succeeds when an attacker identifies two different messages M1 and M2 such that Hash(M1) equals Hash(M2). This violates the collision resistance requirement that cryptographic hash functions must satisfy. Successful collision attacks - such as those demonstrated against MD5 and SHA-1 - undermine digital signatures and certificate integrity because a fraudulent document can be made to match the hash of a legitimate one.

Concept tested: Cryptographic hash function collision attack definition

Source: https://csrc.nist.gov/glossary/term/collision_attack

Topics

#collision attack#hash functions#cryptographic attacks#hash collision

Community Discussion

No community discussion yet for this question.

Sign up to join the discussion
Full 312-50V10 Practice