基于长度函数的猜测
Guessing based on length functions
摘要：
分析了具有记忆信源的猜测窃听器在香农密码体制下的性能。首先建立了猜测函数与长度函数之间的密切关系。随后，渐近最优的加密和攻击策略的识别和他们的性能分析与内存的来源。性能指标是猜测时刻的指数和大偏差的概率。然后对单线源的度量进行表征。通用的渐近最优加密和攻击策略也确定为unifilar源。在有限状态源的Lempel-Ziv编码长度的递增顺序的猜测提出，并证明是渐近最优的。最后，竞争的最优性质的猜测的描述长度和Lempel-Ziv编码长度的递增顺序证明。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
