Guessing based on length functions

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, Submitted to IEEE Transactions on Information Theory, Special issue on Information Theoretic Security, Simplified pr

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Guessing based on length functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Guessing based on length functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Guessing based on length functions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-383379

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.