The Shannon cipher system with a guessing wiretapper
IEEE International Symposium on Information Theory - Proceedings
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27655
Previous work on guessing is combined with the Shannon (1949) theory of cipher systems. A complexity measure is defined for breaking a cipher system by guessing at the key or the message. A single-letter characterization of the guessing effort for a discrete memoryless source (DMS) is given. © 1998 IEEE.
- Conference Paper