Guessing based on length functions

A guessing wiretapper's performance on a Shannon cipher system is analyzed for a source with memory. Close relationships between guessing functions and length functions are first established. Subsequently, asymptotically optimal encryption and attack strategies are identified and their performa...

Full description

Saved in:
Bibliographic Details
Main Author Sundaresan, Rajesh
Format Journal Article
LanguageEnglish
Published 20.02.2007
Subjects
Computer Science - Cryptography and Security
Computer Science - Information Theory
Mathematics - Information Theory
Online AccessGet full text

Cover

More Information
Summary:A guessing wiretapper's performance on a Shannon cipher system is analyzed for a source with memory. Close relationships between guessing functions and length functions are first established. Subsequently, asymptotically optimal encryption and attack strategies are identified and their performances analyzed for sources with memory. The performance metrics are exponents of guessing moments and probability of large deviations. The metrics are then characterized for unifilar sources. Universal asymptotically optimal encryption and attack strategies are also identified for unifilar sources. Guessing in the increasing order of Lempel-Ziv coding lengths is proposed for finite-state sources, and shown to be asymptotically optimal. Finally, competitive optimality properties of guessing in the increasing order of description lengths and Lempel-Ziv coding lengths are demonstrated.
DOI:10.48550/arxiv.cs/0702115