?
Theoretically persistent ciphers and how to understand them
The article belongs to the category of research articles. The article considers a class of ciphers - perfect ciphers. They are based on the model of K. Shannon and are considered undeciphered ciphers. Such ciphers, in particular, are ciphers of random gaming. An analysis of existing publications has shown that they substantiate the conclusion about the undeciphered character of the perfect ciphers according to K. Shannon. In this article, we introduced such concepts as: the probabilistic model of the cipher; The cipher made on attack on the open text at interception of the ciphered text; Cipher, committed by attacking a key while intercepting encrypted text; effective attack on plaintext or key; Ineffective attack on open text or key; decrypted cipher model; undeciphered cipher model. On the basis of the introduced concepts, the mathematical model of the perfect cipher is refined - the model of K. Shannon. The need for such a refinement is dictated by the fact that each cipher can have several independent models. The reasoning is presented, on the basis of which it is proved that the cipher of random gaming is a decipherable cipher.
In book
