Question: We define the bit-permutation cipher as follows: P(m, k) will reorder the l bits in m based on ran- domly picking one of the l!

We define the bit-permutation cipher as follows: P(m, k) will reorder the l bits in m based on ran- domly picking one of the l! permutations on the index set {0,..., 1 1}. Is this cipher semantically secure? Please prove your
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
