Guessing based on length functions

Abstract

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.

16 pages, Submitted to IEEE Transactions on Information Theory, Special issue on Information Theoretic Security, Simplified proof of Proposition 2

References in corpus (2)

• Guessing under source uncertainty
• Guessing based on length functions

Cited by in corpus (8)

• Capacity-achieving Guessing Random Additive Noise Decoding (GRAND)
• Guesswork, large deviations and Shannon entropy
• Multi-user guesswork and brute force security
• Guessing based on length functions
• Some Useful Integral Representations for Information-Theoretic Analyses
• Guessing Revisited: A Large Deviations Approach
• Brute force searching, the typical set and Guesswork
• The Shannon Cipher System with a Guessing Wiretapper: General Sources