Finding slid pairs in trivium with MiniSat

• 作 者: ZENG Wen QI WenFeng
• 机 构: Department of Applied Mathematics, Zhengzhou Information Science and Technology Institute,
• 出 处: Science China(Information Sciences)
• 发表日期: 2013年09期
• 关键词: clock instance consuming sliding cipher Boolean algebraic convert clause solver

A pair of distinct (key, IV) is said to be slidable if they can produce two identical keystreams up to a shift. In this paper, we investigate slid pairs in Trivium. We convert the resulting nonlinear sliding equations into a SAT instance and use MiniSat, a SAT solver, to solve it. We not only find more slid pairs than previous result on slid pair in Trivium but also provide a new method which can treat higher clock-shifts and is much less time-consuming.

A pair of distinct (key, IV) is said to be slidable if they can produce two identical keystreams up to a shift. In this paper, we investigate slid pairs in Trivium. We convert the resulting nonlinear sliding equations into a SAT instance and use MiniSat, a SAT solver, to solve it. We not only find more slid pairs than previous result on slid pair in Trivium but also provide a new method which can treat higher clock-shifts and is much less time-consuming.