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.