Abstract: This paper proves that the success rate of slide-algebraic attack 1 algorithm on KeeLoq cipher is only 2-64. To solve this problem, this paper analyzes the relationship between the number of slide pairs and success rate, proposes an improved method to the slide-algebraic attack 1. By reducing the number of slide pairs used in building algebraic equations to two, the success rate is improved to 0.632, and the computation complexity is decreased from 278 CPU clocks to 273 CPU clocks.

Key words: KeeLoq cipher, slide-algebraic attack, slide pair

摘要： 证明对KeeLoq密码的第1种滑动-代数攻击算法的成功率仅为2-64，针对该问题，分析滑动对个数与成功率的关系，提出改进算法，将用于建立代数方程组的滑动对减少为2个，使改进算法的成功率提高至0.632，并将计算复杂性由原来的278个CPU时钟降为273个CPU时钟。

关键词: KeeLoq密码, 滑动-代数攻击, 滑动对

CLC Number: 

• TN918.1