arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0702092cs.CR
收藏

关于位搜索型发生器的周期性和输出速率的注记

A Note on the Periodicity and the Output Rate of Bit Search Type Generators

Yucel Altug, N. Polat Ayerden, M. Kivanc Mihcak, Emin Anarim

摘要:

我们研究了基于LFSR的流密码中使用的位搜索型不规则抽取算法。特别是,我们专注于BSG和ABSG,并考虑两种不同的分析设置。在第一种情况下,输入被假定为一个m序列,我们表明,所有可能的输出序列可以分为两组,其中每一个的特点是其元素的等价性高达移位。此外,我们证明了这些集合的基数等于其元素之一的周期,并随后推导出预期输出周期的第一个已知界限(假设不存在子周期)。在第二种设置中,我们在概率框架中工作,并假设输入序列是均匀分布的(即,独立同分布Bernoulli过程(概率为1/2)。在这些假设下,我们推导出封闭形式的输出长度和输出率的分布,这是渐近高斯分布,并集中在平均指数紧密的表达式。

英文摘要:

We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two different setups for the analysis. In the first case, the input is assumed to be a m-sequence; we show that all possible output sequences can be classified into two sets, each of which is characterized by the equivalence of their elements up to shifts. Furthermore, we prove that the cardinality of each of these sets is equal to the period of one of its elements and subsequently derive the first known bounds on the expected output period (assuming that no subperiods exist). In the second setup, we work in a probabilistic framework and assume that the input sequence is evenly distributed (i.e., independent identically distributed Bernoulli process with probability 1/2). Under these assumptions, we derive closed-form expressions for the distribution of the output length and the output rate, which is shown to be asymptotically Gaussian-distributed and concentrated around the mean with exponential tightness.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑