Scribd
Upload
19 views10 pages

Cryptography Solved Tasks

Uploaded by

Cent Security
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views10 pages

Cryptography Solved Tasks

Uploaded by

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

Answer 1:

Answer 2:
Part a)
Answer 3:
Part a)

The values that the random variable takes be P1, P2, ..., Pn . Now if it is uniformly
distributed then:

If it is uniformly not distributed then at least one of the Pi < 1/n must be satisfied. Now
since the total sum is 1 we cannot have all the probabilities satisfying Pi < 1/n since
then:

This is false so we must have at least one of the probabilities such that:

Part b)

The minimum entropy in this case if the distribution is not uniform is:

This completes the proof.

Part c)

If the values are uniformly distributed then we have:

This is the case when it’s the highest as E ∞ (X )>1/n is absurd because if the minimum
probability is more than 1/n then the sum of the probabilities will be greater than 1.
Answer 4:
Answer 5:
Part a)

Part b)
Part c)

Output

Observation:

The larger the value of r, the faster the value of H(s||r) will be less than t.

You might also like