Prove that if an encryption scheme has .K<.m then it cannot satisfy onetime secrecy. try to structure your proof as an explicit attack on such a scheme distinguisher against the appropriate libraries in one-time pad enc is deterministic function but for full credit you should prove statement even if randomized. however may assume that dec deterministic. hint: definition of interchangeabilitiy doesn care about running time program. so exhaustive brute-force would be valid. encryption has .k algorithm our definitions allow randomized give different outputs when called twice with same k and m case>