论文标题
对密码的不变跳动攻击
Invariant Hopping Attacks on Block Ciphers
论文作者
论文摘要
自1970年代以来，块密码在广泛使用中。他们的迭代结构容易出现无数的圆形不变攻击，例如线性密码分析（LC）。下一步是查看非线性多项式不变的cf。 EUROCRYPT'95。直到最近，研究人员发现了极少的攻击，并有一些不可能的结果。最终，最近的论文显示了如何为块密码构建多项式不变攻击，但是许多这样的结果是2级。在本文中，我们提出了一种新的增量方法，用于构建对块密码的高度多项式不变攻击。对一个密码设置的微不足道攻击将被转移，以表明在几个步骤中对更强大的密码的存在更高级的攻击。关键工具是操纵所谓的基本方程的根源。示例是用旧的历史块密码T-310构建的。
Block ciphers are in widespread use since the 1970s. Their iterated structure is prone to numerous round invariant attacks for example in Linear Cryptanalysis (LC). The next step is to look at non-linear polynomial invariants cf. Eurocrypt'95. Until recently, researchers have found extremely few such attacks, with some impossibility results. Eventually recent papers show how to construct polynomial invariant attacks for block ciphers, however many such results were of degree 2. In this paper we propose a new incremental methodology for constructing high degree polynomial invariant attacks on block ciphers. A trivial attack on one cipher setup will be transposed to show the existence of a more advanced attack on a stronger cipher in several steps. The key tool is the manipulation of the roots of the so called Fundamental Equation. Examples are constructed with an old historical block cipher T-310.
