Sundaresan, Rajesh (2007) Guessing based on length functions. In: IEEE International Symposium on Information Theory, JUN 24-29, 2007, Nice.
game.pdf - Published Version
Restricted to Registered users only
Download (275Kb) | Request a copy
Close relationships between guessing functions and length functions are established. Good length functions lead to good guessing functions. In particular, guessing in the increasing order of Lempel-Ziv lengths has certain universality properties for finite-state sources. As an application, these results show that hiding the parameters of the key-stream generating source in a private key crypto-system may not enhance the privacy of the system, the privacy level being measured by the difficulty in brute-force guessing of the key stream.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||22 Mar 2010 07:34|
|Last Modified:||19 Sep 2010 05:57|
Actions (login required)