• DocumentCode
    2449340
  • Title

    The Shannon cipher system with a guessing wiretapper

  • Author

    Merhav, Neri ; Arikan, Erdal

  • Author_Institution
    Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    83
  • Abstract
    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
  • Keywords
    cryptography; information theory; cipher systems; complexity measure; discrete memoryless source; key; message; single-letter characterization; Cryptography; Entropy; Equations; Postal services; Random variables; Statistics; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-7803-5000-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1998.708668
  • Filename
    708668