On key and message equivocations in secrecy systems
Two methods (including randomization) are studied for increasing the uncertainty concerning n ³ 1 transmitted messages and an applied key. Furthermore, it is shown that encryptions which perform equally well for n = 1 may perform differently when n > 1.