Department of Computer Science & Engineering
Information Security Lecture Notes Prof. A. L. Narasimha Rao
•
Secrecy of the key- It was shown that the security of conventionalencryption depends on the secrecy of the key, not the secrecy of thealgorithm.Referring to Fig. 1 above, with the message X and the encryption key K as input,the encryption algorithm forms the ciphertext.Y=E
k
(X)The intended receiver, in possession of the key is able to invert thetransformation
X=D
k
(Y)
An opponent, observing Y but not having access to K or X, may attempt torecover X or K or both X and K. It is assumed that the opponent knows theencryption (E) and decryption (D) algorithms. If the opponent is interested in onlythis particular message, then the focus of the effort is to recover X by generatinga plaintext estimate X^. Often, however, the opponent is interested in being ableto read future messages as well, in which case an attempt is made to recover Kby generating an estimate K^.
Cryptanalysis
The process of attempting to discover X or Y or both is known as
cryptanalysis
.The strategy used by the cryptanalysis depends on the nature of the encryptionscheme and the information available to the cryptanalyst.The following table summarizes the various types of cryptanalytic attacks basedon the amount of information known to the cryptanalyst.
Table 1: Types of Attacks on Encrypted Message
Attack Type Knowledge Known to CryptanalystCiphertext only
•
Encryption algorithm
•
Ciphertext to be decodedKnown Plaintext
•
Encryption algorithm
•
Ciphertext to be decoded
•
One or more plaintext-ciphertext pairs formed withthe same secret keyChosen Plaintext
•
Encryption algorithm
•
Ciphertext to be decoded
•
Plaintext message chosen by cryptanalyst, together
with its corresponding ciphertext generated with
Leave a Comment