Using Set Theoretic Estimation to Implement Shannon Secrecy

In Claude Shannon´s paper, Communication Theory of Secrecy, a concept of decrypt is developed and defined in terms of the number of keys of the cipher used, the number of symbols in an alphabet, and the redundancy of a language. In this paper, we show that Shannon´s theory can be formalized as a set theoretic estimation (STE) that promises to be applicable to more general decryption techniques. We discuss the unification of Shannon´s decryption techniques and STE. A summary of experimental results using the STE implementation is presented, as well as, relevant insights and advances in decryption performance.