Preimage attack

From Wikipedia, the free encyclopedia

In cryptography, a preimage attack on a cryptographic hash is an attempt to find a message that has a specific hash value. There are two types of preimage attacks:

• First preimage attack: given a hash h, find a message m such that hash(m) = h.
• Second preimage attack: given a fixed message m1, find a different message m2 such that hash(m2) = hash(m1).

A preimage attack differs from a collision attack in that there is a fixed hash or message that is being attacked. Optimally, a preimage attack on an n-bit hash function will take an order of 2ⁿ operations to be successful. On the other hand, due to the birthday attack, one can expect to find a collision between 2 arbitrary messages in an order of 2^n/2 operations.

[edit] See also

• Cryptographic hash function
• Collision attack
• Birthday attack
• Rainbow table

v • d • e   Cryptographic hash functions and Message authentication codes (MACs) Hash algorithms: Gost-Hash | HAS-160 | HAVAL | MDC-2 | MD2 | MD4 | MD5 | N-Hash | RadioGatún | RIPEMD | SHA family | Snefru | Tiger | WHIRLPOOL | crypt(3) DES MAC algorithms: DAA | CBC-MAC | HMAC | OMAC/CMAC | PMAC | UMAC | Poly1305-AES Authenticated encryption modes: CCM | CWC | EAX | GCM | OCB Attacks: Hash collision | Birthday attack | Preimage attack | Rainbow table | Brute force attack Misc: Avalanche effect | Hash collision | Merkle-Damgård construction   Standardization: CRYPTREC | NESSIE v • d • e   Cryptography History of cryptography | Cryptanalysis | Cryptography portal | Topics in cryptography Symmetric-key algorithm | Block cipher | Stream cipher | Public-key cryptography | Cryptographic hash function | Message authentication code | Random numbers | Steganography