  We describe generalized running key ciphers and apply them for analysis of
two Shannon's methods. In particular, we suggest some estimation of the cipher
equivocation and the probability of correct deciphering without key.
