- I Only Need The Answer To C3 1 (104.57 KiB) Viewed 31 times
I only need the answer to C3).
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
I only need the answer to C3).
I only need the answer to C3).
= = = (c) Consider the random plaintext on two letters, P = {A, B}. We have the proba- bility distribution on A, B, given by p(A) = P, and p(B) = q. We take K = {0,1} with o the identity map on P and 7 the permutation that interchange A with B. We put on K the uniform distribution, with plo) = 1 = (). Finally, as a set C= P. 1. Show that if the probability on a sequence from Pn is the product of the probabilities for the n letters, then the probability that the cryptogram wil be a specific sequence from Cn with m A's and n − m B's, is пт p”.qn-m + pn-m.qm . Pm = 2 2. Using (1) above, show that the entropy of Cn, is n n H(Cn) = - Σ • I'm · log(rm). m=0 m 1 3. For p= 0.25. Find the first n > 0, such that En < 0.3. =
= = = (c) Consider the random plaintext on two letters, P = {A, B}. We have the proba- bility distribution on A, B, given by p(A) = P, and p(B) = q. We take K = {0,1} with o the identity map on P and 7 the permutation that interchange A with B. We put on K the uniform distribution, with plo) = 1 = (). Finally, as a set C= P. 1. Show that if the probability on a sequence from Pn is the product of the probabilities for the n letters, then the probability that the cryptogram wil be a specific sequence from Cn with m A's and n − m B's, is пт p”.qn-m + pn-m.qm . Pm = 2 2. Using (1) above, show that the entropy of Cn, is n n H(Cn) = - Σ • I'm · log(rm). m=0 m 1 3. For p= 0.25. Find the first n > 0, such that En < 0.3. =
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!