Scribd
Upload
11 views9 pages

Gango Week 1 Lect 4

This document discusses probability distributions related to cryptosystems. It introduces random variables to represent plaintexts, keys, and ciphertexts. It describes the probability distributions of ciphertexts, ciphertexts given a plaintext, and plaintexts given a ciphertext. It also defines perfect secrecy as a property where the ciphertext provides no information about the plaintext. Finally, it notes that the shift cipher achieves perfect secrecy when keys are used with equal probability.

Uploaded by

Ashish Patel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views9 pages

Gango Week 1 Lect 4

This document discusses probability distributions related to cryptosystems. It introduces random variables to represent plaintexts, keys, and ciphertexts. It describes the probability distributions of ciphertexts, ciphertexts given a plaintext, and plaintexts given a ciphertext. It also defines perfect secrecy as a property where the ciphertext provides no information about the plaintext. Finally, it notes that the shift cipher achieves perfect secrecy when keys are used with equal probability.

Uploaded by

Ashish Patel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Introduction to Cryptology

Week 1 Lecture 4
Sugata Gangopadhyay
Department of Computer Science and Engineering
Indian Institute of Technology Roorkee

Probability distributions related to a


cryptosystem
Let
us suppose that a cryptosystem is specified by .
Assume that it is possible to define a probability distribution
on the plaintext space , the key space space .
The probability distribution on and induces a probability
distribution on .
Let the random variables associated to plaintexts, keys and
ciphertexts be and respectively.
The probability that is denoted by .
The probability that is denoted by
The probability that is denoted by .

Distribution of ciphertexts
is the set of all possible ciphertexts.
The probability distribution of ciphertexts is
The probability distribution of ciphertexts given a
plaintext is

Distribution of plaintexts given a


ciphertext
(An application of Bayes theorem)

The probability distribution of plaintexts conditional to


ciphertexts is

Computation of these probabilities


Let with , .
Let with .
Let
The cryptosystem is represented by the following
encryption matrix:

Computation of these probabilities

;
;.
;;

;.

;;
;.

Perfect Secrecy
Perfect secrecy means that an adversary (Oscar) cannot
get any information about the plaintext by observing
the ciphertext.
A precise formulation of this was given by Claude
Elwood Shannon which is as follows:
A cryptosystem
has perfect secrecy if
for all , .

Perfect secrecy and Shift Cipher


Suppose that the keys in the shift cipher are used with
equal probability . Then for any plaintext probability
distribution, the Shift Cipher has perfect secrecy.

Summing up
We have studied
Probability distributions related to plaintexts, keys and
ciphertexts.
The idea of perfect secrecy introduced by Shannon.
The condition under which Shift Cipher achieves
perfect secrecy.

You might also like