He proved that a one-time pad cannot theoretically be broken by a ciphertext-only attack and that a key needs to have as many binary digits as the number of bits of information in a message in order to be unbreakable.
He proved that a one-time pad cannot theoretically be broken by a ciphertext-only attack and that a key needs to have as many binary digits as the number of bits of information in a message in order to be unbreakable. This computer scientist created Theseus, an electronic mouse that learned about its maze and, when placed in a changed environment, could go directly to its goal after finding a familiar location. In "Programming a Computer for Playing Chess" he argued that computers could only use a brute-force or a selection strategy, the latter using a minimax procedure based on an evaluation function that determined how good a position was. In boolean algebra, his expansion splits a function into the sum of two subfunctions multiplied by a variable and the complement of that variable; however, he is better known in that field for showing that a boolean algebra based on "meet" and "join" variables could model an electronic circuit. The discoverer, along with Nyquist, of the sampling theorem, for 10 points, name this author of "The Mathematical Theory of Communication", the founder of information theory.
He proved that a one-time pad cannot theoretically be broken by a ciphertext-only attack and that a key needs to have as many binary digits as the number of bits of information in a message in order to be unbreakable.
Claude {Shannon}