Solving Trivium-based Boolean Equations Using the Method of Syllogisms

Issue title: Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010

Article type: Research Article

Authors: Zajac, Pavol

Affiliations: Department of Applied Informatics and IT, Slovak University of Technology, Bratislava, Slovakia. [email protected]

Note: [] Address for correspondence: KAIVT FEI STU, Ilkovičova 3, 81219 Bratislava, Slovakia This material is based upon work supported under the grant NIL-I-004 from Iceland, Liechtenstein and Norway through the EEA Financial Mechanism and the Norwegian Financial Mechanism, and under the grant VEGA 1/0244/09.

Abstract: The article examines a practical application of the method of syllogisms to solve a system of Boolean equations arising in the cryptanalysis of the stream cipher Trivium. Experimental results show that different guessing strategies lead to significantly different complexities of generic attacks. A new experimental approach is presented that can be used to estimate lower bounds on the complexity of such attacks.

Keywords: Boolean equations, algebraic cryptanalysis, method of syllogisms, Trivium

DOI: 10.3233/FI-2012-635

Journal: Fundamenta Informaticae, vol. 114, no. 3-4, pp. 359-373, 2012