A linearization attack on the Key Stream Generator (KSG) of the modified E0 algorithm proposed by Hermelin [Proceedings of ICISC'99, Springer LNCS 1787, 2000, 17-29] is given in this paper. The initial value can be recovered by a linearization attack with O(260.52) operations by solving a System of Linear Equations (SLE) with at most 220.538 unknowns. Frederik Armknecht [Cryptology ePrint Archive, 2002/191]proposed a linearization attack on the KSG ofE0 algorithm with O(270.341) operations by solving an SLE with at most 224.056 unknowns, so the modification proposed by Hermelin reduces the ability of E0 to resist the linearization attack by comparing with the results of Frederik Armknecht.
展开▼
机译：本文给出了一种改进的E0算法对密钥流生成器（KSG）的线性化攻击，该算法由Hermelin提出[ICISC'99，Springer LNCS 1787，2000，17-29]。通过求解最多包含220.538个未知数的线性方程组（SLE），可以通过使用O（260.52）操作进行线性化攻击来恢复初始值。 Frederik Armknecht [Cryptology ePrint Archive，2002/191]通过求解最多包含224.056个未知数的SLE，对具有O（270.341）操作的E0算法的KSG提出了线性化攻击，因此Hermelin提出的修改降低了E0抵抗E0算法的能力。通过与Frederik Armknecht的结果进行比较来进行线性化攻击。
展开▼
