Question: Consider a scheme OTP = (Gen, Enc, Dec) where K = {0, 1}^2l, M = {0, 1}^2l and C = {0,1}^2l . Gen generates a

Consider a scheme OTP = (Gen, Enc, Dec) where K = {0, 1}^2l, M = {0, 1}^2l and

C = {0,1}^2l . Gen generates a random l-bit string as a key, Enck(m) = kkR m (where kR is the reverse of l-bit string k) and Deck(c) = kkR c.

Does the scheme work? Prove using definition III (indistinguishability game) that this scheme is not perfectly secret.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!