A cryptanalysis success where the attacker discovers additional plain texts (or cipher texts) not previously known.

A cryptanalysis success where the attacker discovers additional plain texts (or cipher texts) not previously known.
A . Total Break
B. Distinguishing Algorithm
C. Instance Deduction
D. Information Deduction

View Answer

Answer: C

Explanation:

Instance Deduction

https://en.wikipedia.org/wiki/Cryptanalysis

The results of cryptanalysis can also vary in usefulness. For example, cryptographer Lars Knudsen (1998) classified various types of attack on block ciphers according to the amount and quality of secret information that was discovered:

Total break ― the attacker deduces the secret key.

Global deduction ― the attacker discovers a functionally equivalent algorithm for encryption and decryption, but without learning the key.

Instance (local) deduction ― the attacker discovers additional plaintexts (or ciphertexts) not previously known.

Information deduction ― the attacker gains some Shannon information about plaintexts (or ciphertexts) not previously known.

Distinguishing algorithm ― the attacker can distinguish the cipher from a random permutation.