Computer Science – Information Theory
Scientific paper
2007-02-20
Computer Science
Information Theory
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
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.
Profile ID: LFWR-SCP-O-383379