arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.00943cs.CR
收藏

序列的变换域分析

Transform Domain Analysis of Sequences

Muhammad Asad Khan, Amir A Khan, Fauzan Mirza

摘要:

在密码分析中,密码在面对攻击时的安全性是根据三个复杂性标准来衡量的,即,计算、记忆和时间。某些特征在特定领域中可能不那么明显,在变换后的领域中对其进行分析通常会揭示出有趣的模式。此外,在不同的领域的复杂性标准是不同的,性能的改善往往是通过转换到一个替代领域的问题。由于编码理论和信号处理的结果,基于离散傅里叶变换(DFT)的攻击已经被证明在其计算复杂性方面比代数攻击更有效。受DFT攻击的启发,本文提出了一种基于线性反馈移位寄存器(LFSR)序列发生器的变换域分析方法。讨论了非线性滤波器和组合器发生器的时域和频域行为,以及基于中国剩余定理(CRT)的一些新的观察结果。CRT被用来建立LFSR序列的模式和有限域的基本循环结构。DFT频谱攻击的组合器生成器的应用也被证明。我们提出的方法节省了组合器生成器的选择性DFT攻击的最后一级计算。所提出的方法是证明了一些例子的组合器生成器,并可扩展到一般配置的组合器生成器。

英文摘要:

In cryptanalysis, security of ciphers vis-a-vis attacks is gauged against three criteria of complexities, i.e., computations, memory and time. Some features may not be so apparent in a particular domain, and their analysis in a transformed domain often reveals interesting patterns. Moreover, the complexity criteria in different domains are different and performance improvements are often achieved by transforming the problem in an alternate domain. Owing to the results of coding theory and signal processing, Discrete Fourier Transform (DFT) based attacks have proven to be efficient than algebraic attacks in terms of their computational complexity. Motivated by DFT based attacks, we present a transform domain analysis of Linear Feedback Shift Register(LFSR) based sequence generators. The time and frequency domain behavior of non-linear filter and combiner generators is discussed along with some novel observations based on the Chinese Remainder Theorem (CRT). CRT is exploited to establish patterns in LFSR sequences and underlying cyclic structures of finite fields. Application of DFT spectra attacks on combiner generators is also demonstrated. Our proposed method saves on the last stage computations of selective DFT attacks for combiner generators. The proposed approach is demonstrated on some examples of combiner generators and is scalable to general configuration of combiner generators.

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

↑