Show that the given encryption system is perfectly secure

Assignment Help Computer Network Security
Reference no: EM131226988

We consider the alphabet A= {0,1,2,3,4} and the space of messages consists of all 1-symbol words, so it is M ={0,1,2,3,4}. The encryption is done using the shift cipher, so it is given by the equation X = x+k (mod 5) applied to each letter of the plaintext (as discussed in class, x is the letter that we encrypt, k is the secret key, and X is the encrypted letter).

a. Suppose Eve knows that the symbols 0 and 1 have the same probability Prob(M=0)=Prob(M=1) = a, and the symbols 2,3, and 4 have the same probability Prob(M=2) = Prob(M=3) = Prob(M=4) = b, and she also knows that 0 is three times more likely than 2, so she knows that a = 3b. Find a and b. (Hint: use the fact that the sum of all probabilities is 1).

b. Calculate Prob (M= 1 | C = 4) (according to Eve's distribution). Recall that C= EK(M), that is the ciphertext is obtained by encrypting the message M (which is drawn according to Eve's distribution which you found at point a.), and the key is equally likely to be any number in the set {0,1,2,3,4}. You'll have to use the formula for conditional probability (see the notes, and the proof of Shannon's theorem).

c. Show that the given encryption system is perfectly secure for , by checking the definition given in class for perfect security - version 1 (Note: you need to consider an arbitrary distribution on because the definition must hold for all possible distributions).

Reference no: EM131226988

Show that given encryption system is perfectly secure for m

Calculate Prob (M= 2 | C = 4) (according to Eve's distribution). Show that the given encryption system is perfectly secure for M, by checking the definition given in class

Compare two-tier client-server system configuration

Compare 2-tier and 3-tier client/server system configurations and analyze how they are different. Based on your comparison, suggest the real life scenarios which are suitabl

Describe the mutual authentication procedure

COIS23001 - Network Security - What makes a brute-force attack both particularly difficult and potentially easy on a wireless network using AES/CCMP encryption and 802.1x au

Understanding on network-related issues

CISC650 Computer Networks - In order to show understanding on network-related issues, each student is expected to complete a paper on a relevant network topic of the student

Discuss a case study on your chosen it system

BN203: Network Security/Overview of Network Security Identify three (3) security vulnerabilities in the chosen case study and discuss how these threats can be mitigated using

Does crc detect more errors than a parity bit

Does CRC detect more errors than a parity bit? Why or Why not? A world wide web server typically receives small messages from clients but sends very large messages back to

Write =on various type of utility and its use to secure data

Write a paper about various types of Utility and its use to secure the data. 8 pages start with executive summary, introduction, examples, its use in data security and conclu

How the threats are exploiting holes in current security

An explanation of which web security threats are most prevalent, the hazards they present, and how these threats are exploiting holes in current security countermeasures.

Reviews

Write a Review

 
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd