# Meet-in-the-middle attack/Related Articles

From Citizendium, the Citizens' Compendium

*See also changes related to Meet-in-the-middle attack, or pages that link to Meet-in-the-middle attack or to this page or whose text contains "Meet-in-the-middle attack".*

## Parent topics

- Cryptanalysis [r]: The sub-field of cryptology which deals with breaking into existing codes and ciphers.
^{[e]} - Information security [r]: The set of policies and protective measures used to ensure appropriate confidentiality, integrity and availability to information; usually assumed to be information in a computer or telecommunications network but the principles extend to people and the physical world
^{[e]}

## Subtopics

- Code book attack [r]: Attacking a block cipher by creating a code book, collecting plaintext/ciphertext pairs.
^{[e]} - Passive attack [r]: An attack on a communications system in which the attacker reads messages he is not supposed to but does not alter them.
^{[e]} - Active attack [r]: An attack on a communications system in which the attacker creates, alters, replaces, re-routes or blocks messages; this contrasts with a passive attack in which he only reads them.
^{[e]} - Block cipher [r]: A symmetric cipher that operates on fixed-size blocks of plaintext, giving a block of ciphertext for each
^{[e]} - Hashed message authentication code [r]: A technique for authenticating a message using a hash function and a secret key.
^{[e]} - Birthday coincidence [r]: In probability theory, the event that two persons in a group celebrate their birthday on the same day of the year; see birthday paradox.
^{[e]} - Birthday attack [r]: An attack on a cryptographic system that works by finding two identical outputs from the system.
^{[e]} - Cryptographic hash [r]:
*Add brief definition or description* - Cipher [r]: A means of combining plaintext (of letters or numbers, or bits), using an algorithm that mathematically manipulates the individual elements of plaintext, into ciphertext, a form unintelligible to any recipient that does not know both the algorithm and a randomizing factor called a cryptographic key
^{[e]} - Hash [r]: An algorithm that produces a fixed-size digest from an input of essentially arbitrary size.
^{[e]} - Cryptographic key [r]: Value used by a computer together with a complex algorithm to encrypt and decrypt messages.
^{[e]}